An approximate analysis of a cyclic server queue with limited service and reservations
From MaRDI portal
Publication:1193794
DOI10.1007/BF01159293zbMath0752.60080OpenAlexW2094847274MaRDI QIDQ1193794
Duan-Shin Lee, Bhaskar Sengupta
Publication date: 27 September 1992
Published in: Queueing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01159293
satellite communicationsqueueing problemcyclic queueing systemsojourn-time distributionsstochastic dominance arguments
Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)
Related Items (3)
Iterative approximation of \(k\)-limited polling systems ⋮ Mathematical methods to study the polling systems ⋮ Stability conditions for a pipeline polling scheme in satellite communications
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Dominance relations in polling systems
- Symmetric queues served in cyclic order
- Queueing systems with vacations - a survey
- Stability of token passing rings
- Mean-delay approximation for cyclic-service queueing systems
- Queuing analysis of polling models
- Analysis of cyclic service systems with limited service: Bounds and approximations
- Waiting-time approximations in multi-queue systems with cyclic service
- M/G/1/N Queue with vacation time and limited service discipline
- An Inversion Technique for the Laplace Transform
- Mean waiting time approximations in cyclic-service systems with exhaustive limited service policy
- Waiting Lines and Times in a System with Polling
- Expected Waiting Time for Nonsymmetric Cyclic Queueing Systems—Exact Results and Applications
- Queues Served in Cyclic Order
- Queues with Periodic Service and Changeover Time
This page was built for publication: An approximate analysis of a cyclic server queue with limited service and reservations