The transient solution of M/M/1 queues under (M,N)-policy. A combinatorial approach

DOI10.1016/0378-3758(93)90031-ZzbMath0777.05004MaRDI QIDQ1209635

Walter Böhm, Sri Gopal Mohanty

Publication date: 16 May 1993

Published in: Journal of Statistical Planning and Inference (Search for Journal in Brave)

zbMATH Keywords

lattice pathsprobability distributionsqueueing theorytransient solution(M,N)-policyM/M/1 queues

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)

Related Items (5)

Transient analysis of queues with heterogeneous arrivals ⋮ The equivalence of the transient behaviour formulae for the single server queue ⋮ Lattice path counting and \(M/M/c\) queueing systems ⋮ The transient solution of M/M/1 queues under (M,N)-policy. A combinatorial approach ⋮ Lattice path approach to transient solution of \(M/M/1\) with (\(0,k\)) control policy

Cites Work

• The transient solution of M/M/1 queues under (M,N)-policy. A combinatorial approach
• Lattice path approach to transient solution of \(M/M/1\) with (\(0,k\)) control policy
• Lattice Paths with Diagonal Steps
• On a Generalization of One Dimensional Random Walk with a Partially Reflecting Barrier
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The transient solution of M/M/1 queues under (M,N)-policy. A combinatorial approach