The polling system with a stopping server
From MaRDI portal
Publication:1342962
DOI10.1007/BF01158769zbMath0836.90076MaRDI QIDQ1342962
Publication date: 15 January 1995
Published in: Queueing Systems (Search for Journal in Brave)
Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)
Related Items (11)
Polling: past, present, and perspective ⋮ Relating polling models with zero and nonzero switchover times ⋮ A model of the polling system for studying the broadband wireless networks ⋮ Mathematical methods to study the polling systems ⋮ Ergodicity and analysis of the process describing the system state in polling systems with two queues ⋮ Approximations for the waiting time distribution in polling models with and without state-dependent setups ⋮ A Marginal Productivity Index Rule for Scheduling Multiclass Queues with Setups ⋮ Polling systems with periodic server routeing in heavy traffic: distribution of the delay ⋮ A Globally Gated Polling System with a Dormant Server ⋮ Dynamic server assignment in a two-queue model ⋮ Gated polling models with customers in orbit.
Cites Work
- A decomposition result for a class of polling models
- Polling systems and multitype branching processes
- A Globally Gated Polling System with a Dormant Server
- 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
- When Should a Roving Server Be Patient?
- Expected Waiting Time for Nonsymmetric Cyclic Queueing Systems—Exact Results and Applications
- Queues Served in Cyclic Order
- Queues Served in Cyclic Order: Waiting Times
- Two Queues with Changeover Times
- Queues with Periodic Service and Changeover Time
- The individual station technique for the analysis of cyclic polling systems
- A Decomposition Theorem for Polling Models: The Switchover Times are Effectively Additive
This page was built for publication: The polling system with a stopping server
