Lattice path counting and \(M/M/c\) queueing systems

DOI10.1007/BF01148946zbMath0836.60099OpenAlexW1993853939MaRDI QIDQ1892653

Yoichi Seki, Yoshihiro Kimura, Yukio Shibata, Kiyoshi Muto, Haruo Miyazaki

Publication date: 6 May 1996

Published in: Queueing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01148946

zbMATH Keywords

numerical examplesqueue sizetransient solutionlattice path countingdepth of part

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)

Related Items

An application of Riordan arrays to the transient analysis of \(M/M/1\) queues ⋮ Lattice path approach for busy period density of \(M/G/1\) queues using \(C_{3}\) Coxian distribution ⋮ Busy period analysis of queue: lattice path approach ⋮ Lattice path approach for busy period density of \(GIa/Gb/1\) queues using \(C_{2}\) Coxian distributions ⋮ Lattice path approaches for busy period density of \(GI^b/G/1\) queues using \(C_2\) Coxian distributions ⋮ A combinatorial study of two-periodic random walks

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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
• Combinatorial approach to Markovian queueing models
• Time-Dependent Solution of the Many-Server Poisson Queue
• THE JOINT ARRIVAL AND DEPARTURE PROCESS FOR THE M/M/l QUEUE
• Transient solution to the many-server Poisson queue: a simple approach
• A transient solution to an M/M/1 queue: a simple approach
• A Generalization of the Ballot Problem and its Application in the Theory of Queues
• Some New Results for the M/M/1 Queue
• A Single-Server Queue with Recurrent Input and Exponentially Distributed Service Times
• A Combinatorial Method in the Theory of Queues