Busy period analysis for the \(n\)-policy \(GI/M/c\) queue

DOI10.1016/j.jkss.2008.02.002zbMath1152.60349OpenAlexW2010792208MaRDI QIDQ955861

Dae Eun Lim, Kyung-Chul Chae

Publication date: 20 November 2008

Published in: Journal of the Korean Statistical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jkss.2008.02.002

zbMATH Keywords

multi-server queueidle period\(n\) threshold policycycle analysispartial busy period

Mathematics Subject Classification ID

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

Related Items (2)

A simple method to obtain the stochastic decomposition structure of the busy period in \(\mathrm{Geo}/\mathrm{Geo}/1/N\) vacation queue ⋮ Busy period analysis for the GI/M/1 queue with phase-type vacations

Cites Work

• The \(N\) threshold policy for the \(GI/M/1\) queue
• Analysis of the busy period for the M/M/c queue: an algorithmic approach
• The queue G/M/m/N: Busy period and cycle, waiting time under reverse and random order service
• Idle and busy periods in stable M/M/k queues
• On the many server queue with exponential service times
• A Combinatorial Method in the Theory of Queues
• Unnamed Item

This page was built for publication: Busy period analysis for the \(n\)-policy \(GI/M/c\) queue