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 paths; probability distributions; queueing theory; transient solution; (M,N)-policy; M/M/1 queues

Mathematics Subject Classification ID

05A15: Exact enumeration problems, generating functions

60K25: Queueing theory (aspects of probability theory)

90B22: Queues and service in operations research

Related Items

The equivalence of the transient behaviour formulae for the single server queue, 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, Transient analysis of queues with heterogeneous arrivals, Lattice path counting and \(M/M/c\) queueing systems

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