An application of Riordan arrays to the transient analysis of \(M/M/1\) queues

DOI10.1016/j.amc.2014.03.142zbMath1334.90032OpenAlexW2050730260MaRDI QIDQ275072

Bong Dae Choi, Gi-Sang Cheon, Sung-Tae Jin

Publication date: 25 April 2016

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2014.03.142

zbMATH Keywords

\(M/M/1\) queuetransient probability\(q\)-pathRiordan array (with multiple support function)

Mathematics Subject Classification ID

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

Related Items

Exact time-dependent solutions for the $M / D / 1$ queue ⋮ Riordan arrays and related polynomial sequences

Cites Work

• Unnamed Item
• Unnamed Item
• The double Riordan group
• Combinatorics of Riordan arrays with identical \(A\) and \(Z\) sequences
• Identities induced by Riordan arrays
• Riordan group involutions and the \(\varDelta \)-sequence
• The relevant prefixes of coloured Motzkin walks: an average case analysis
• The Riordan group
• Riordan arrays and combinatorial sums
• The combinatorics of birth-death processes and applications to queues
• Waiting patterns for a printer
• Services within a busy period of an M/M/1 queue and Dyck paths
• Lattice path counting and \(M/M/c\) queueing systems
• Combinatorial inversions and implicit Riordan arrays
• On Some Alternative Characterizations of Riordan Arrays