A simple method to obtain the stochastic decomposition structure of the busy period in \(\mathrm{Geo}/\mathrm{Geo}/1/N\) vacation queue
From MaRDI portal
Publication:904287
DOI10.1007/s10288-015-0295-6zbMath1330.60115OpenAlexW1469087774MaRDI QIDQ904287
Attahiru Sule Alfa, Miao-Miao Yu
Publication date: 13 January 2016
Published in: 4OR (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10288-015-0295-6
Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items
Cites Work
- Unnamed Item
- Busy period analysis of the level dependent \(PH/PH/1/K\) queue
- Busy period analysis for the \(n\)-policy \(GI/M/c\) queue
- Discrete \(NT\)-policy single server queue with Markovian arrival process and phase type service
- First-passage-time and busy-period distributions of discrete-time Markovian queues: \(\text{Geom}(n)/\text{Geom}(n)/1/N\)
- Busy period analysis of the state dependent M/M/1/K queue
- Busy period analysis for the \(GI/M/1\) queue with exponential vacations
- Two Types ofRG-Factorizations of Quasi-birth-and-death Processes and Their Applications to Stochastic Integral Functionals
- MOMENTS OF THE DURATION OF BUSY PERIODS OF MX/G/1/n SYSTEMS
- Constructive Computation in Stochastic Models with Applications
- On the busy-period distributions of M/G/1/K queues by state-dependent arrivals and FCFS/LCFS-P service disciplines
- On the waiting-time and busy period distributions for a general birth-and-death queueing model
- On the relationship between the distribution of maximal queue length in the M/G/1 queue and the mean busy period in the M/G/1/n queue
- Technical Note—A Note on the Busy Period of an M/G/1 Finite Queue
- The queue G/M/m/N: Busy period and cycle, waiting time under reverse and random order service
- Queueing Theory for Telecommunications
- M/G/1/N Queue with Vacation Time and Exhaustive Service Discipline
- The Remaining Busy Period of a Finite Queue