A decomposition result for a class of polling models
From MaRDI portal
Publication:1193789
DOI10.1007/BF01159290zbMath0752.60078OpenAlexW2158026453MaRDI QIDQ1193789
Publication date: 27 September 1992
Published in: Queueing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01159290
Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)
Related Items
Polling: past, present, and perspective, Polling systems and multitype branching processes, The polling system with a stopping server, Relating polling models with zero and nonzero switchover times, Waiting times in a two-queue model with exhaustive and Bernoulli service, Multitype branching processes with immigration in random environment, and polling systems, Mathematical methods to study the polling systems, Transient analysis for exponential time-limited polling models under the preemptive repeat random policy, A New Method for Deriving Waiting-Time Approximations in Polling Systems with Renewal Arrivals, Analysis of polling models with a self-ruling server, L\'evy-driven polling systems and continuous-state branching processes
Cites Work
- Unnamed Item
- Queueing systems with vacations - a survey
- Workloads and waiting times in single-server systems with multiple customer classes
- Compartmental models for virtual circuit networks
- Technical Note—A Note on the M/G/1 Queue with Server Vacations
- Stochastic Decompositions in the M/G/1 Queue with Generalized Vacations
- Pseudo-conservation laws in cyclic-service systems
- Analysis of cyclic service systems with limited service: Bounds and approximations
- Polling systems with zero switch-over periods: a general method for analyzing the expected delay
- Technical Note—Delays in Single-Server Queues with Batch Input
- Multiqueue Systems with Nonexhaustive Cyclic Service
- Queues Served in Cyclic Order
- Queues Served in Cyclic Order: Waiting Times
- Queues with Periodic Service and Changeover Time
