An analysis of the \(M^X/M/1\) queue with multiple working vacations by \(GI/M/1\) type Markov process

DOI10.1007/s00236-018-0316-yzbMath1404.60142OpenAlexW2792162875MaRDI QIDQ1789067

Hong-Bo Zhang

Publication date: 9 October 2018

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00236-018-0316-y

zbMATH Keywords

stationary queue length distributionmultiple working vacationsinfinite phases

Mathematics Subject Classification ID

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

Related Items (1)

Analysis of a batch arrival multi-server queueing system with waiting servers, synchronous working vacations and impatient customers

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• \(M/M/1\) retrial queue with working vacations
• \(GI/G/1/\infty\) batch arrival queueing system with a single exponential vacation
• Queueing systems with vacations - a survey
• Stochastic decompositions in the \(M/M/1\) queue with working vacations
• Analysis of a \(GI/M/1\) queue with multiple working vacations
• Vacation queueing models. Theory and applications
• Constructive Computation in Stochastic Models with Applications
• Computation of Steady-State Probabilities for M/M/1 Priority Queues
• An introduction to queueing theory. Modeling and analysis in applications.
• On The Renewal Input Batch-arrival Queue Under Single And Multiple Working Vacation Policy With Application To EPON

This page was built for publication: An analysis of the \(M^X/M/1\) queue with multiple working vacations by \(GI/M/1\) type Markov process