A new formula for the busy period of a non-empty multiserver queueing system

DOI10.1016/S0096-3003(02)00371-5zbMath1029.60073OpenAlexW2011083477MaRDI QIDQ1399806

Ahmed M. K. Tarabia

Publication date: 30 July 2003

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

Full work available at URL: https://doi.org/10.1016/s0096-3003(02)00371-5

zbMATH Keywords

recurrence relationbusy periodqueueing systemM/M/\(c/\infty\)-system

Mathematics Subject Classification ID

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

Related Items (2)

The busy period of an \(\mathrm{M}/\mathrm{M}/1\) queue with balking and reneging ⋮ Analysis of random walks with an absorbing barrier and chemical rule

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Many server queueing processes with Poisson input and exponential service times
• The busy periods of some queueing systems
• The busy Period for the M/M/1 machine interference model
• Transient solution to the many-server Poisson queue: a simple approach
• On the busy period of a multichannel Markovian queue
• The equivalence of the transient behaviour formulae for the single server queue
• The generalised state-dependent queue: the busy period Erlangian
• The Remaining Busy Period for a Single Server Queue with Poisson Input
• On infinite server queues with batch arrivals
• Busy Period Analysis of a Time-Sharing System
• A Combinatorial Method in the Theory of Queues

This page was built for publication: A new formula for the busy period of a non-empty multiserver queueing system