Mean value analysis for polling systems
From MaRDI portal
Publication:851237
DOI10.1007/s11134-006-7898-8zbMath1137.90434OpenAlexW2120226612MaRDI QIDQ851237
Erik M. M. Winands, Geert-Jan van Houtum, Ivo J. B. F. Adan
Publication date: 17 November 2006
Published in: Queueing Systems (Search for Journal in Brave)
Full work available at URL: https://research.tue.nl/nl/publications/bc7a2e33-ec80-4268-8d9a-7f8775d33b63
Measures of association (correlation, canonical correlation, etc.) (62H20) Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)
Related Items
A duplex cyclic polling system for mixed queues, Optimal routeing in two-queue polling systems, The analysis of batch sojourn-times in polling systems, A polling model with smart customers, A two-queue polling model with two priority levels in the first queue, Iterative approximation of \(k\)-limited polling systems, On competitive analysis for polling systems, Branching-type polling systems with large setups, Analysis of tandem polling queues with finite buffers, POLLING SYSTEMS WITH TWO-PHASE GATED SERVICE, On polling systems with large setups, A polling model with reneging at polling instants, Analysis of multiclass Markovian polling systems with feedback and composite scheduling algorithms, MEAN VALUE ANALYSIS OF SINGLE SERVER RETRIAL QUEUES, Mixed gated/exhaustive service in a polling model with priorities, The impact of scheduling policies on the waiting-time distributions in polling systems, Heavy-traffic limits for polling models with exhaustive service and non-FCFS service order policies, Managing premium wines using an \((s - 1,s)\) inventory policy: a heuristic solution approach, Ordinal optimization of \(G/G/1/K\) polling systems with \(k\)-limited service discipline, On the Marginal Standard Error Rule and the Testing of Initial Transient Deletion Methods
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A new approach to analysis of polling systems
- Workloads and waiting times in single-server systems with multiple customer classes
- Polling systems and multitype branching processes
- A Proof for the Queuing Formula: L = λW
- Polling in a Loop System
- Poisson Arrivals See Time Averages
- 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 Served in Cyclic Order: Waiting Times
- Queues with Periodic Service and Changeover Time
- The individual station technique for the analysis of cyclic polling systems
