Polling systems with periodic server routing in heavy traffic: renewal arrivals

Authors:
Tava Lennon Olsen;R. D. Van Der Mei
Affiliations:
John M. Olin School of Business, Washington University, St. Louis, MO, USA;CWI, Advanced Communication Networks, Amsterdam, The Netherlands and Faculty of Sciences, Vrije Universiteit, Amsterdam, The Netherlands
Venue:
Operations Research Letters
Year:
2005

Citing 9
Cited 11

Polling Systems in Heavy Traffic: a Bessel Process Limit

Mathematics of Operations Research
A Practical Scheduling Method for Multiclass Production Systems with Setups

Management Science
Polling systems in heavy traffic: Exhaustiveness of service policies

Queueing Systems: Theory and Applications
Dynamic Scheduling of a Two-Class Queue with Setups

Operations Research
Heavy Traffic Analysis of Polling Systems in Tandem

Operations Research
Heavy Traffic Analysis of the Dynamic Stochastic Inventory-Routing Problem

Transportation Science
The Stochastic Economic Lot Scheduling Problem: Heavy Traffic Analysis of Dynamic Cyclic Policies

Operations Research
Heavy Traffic Analysis of Dynamic Cyclic Policies: A Unified Treatment of the Single Machine Scheduling Problem

Operations Research
Approximations for the waiting time distribution in polling models with and without state-dependent setups

Operations Research Letters

Mean value analysis for polling systems in heavy traffic

valuetools '06 Proceedings of the 1st international conference on Performance evaluation methodolgies and tools
Polling models with renewal arrivals: A new method to derive heavy-traffic asymptotics

Performance Evaluation
Heavy traffic analysis of polling models by mean value analysis

Performance Evaluation
Polling systems with two-phase gated service: Heavy traffic results for the waiting time distribution

Probability in the Engineering and Informational Sciences
On a unifying theory on polling models in heavy traffic

ITC20'07 Proceedings of the 20th international teletraffic conference on Managing traffic performance in converged networks
Closed-form waiting time approximations for polling systems

Performance Evaluation
A note on polling models with renewal arrivals and nonzero switch-over times

Operations Research Letters
Polling systems with batch service

OR Spectrum
A Queueing Model to Evaluate the Impact of Patient “Batching” on Throughput and Flow Time in a Medical Teaching Facility

Manufacturing & Service Operations Management
Waiting times in queueing networks with a single shared server

Queueing Systems: Theory and Applications
Scheduling in polling systems in heavy traffic

ACM SIGMETRICS Performance Evaluation Review - Special issue on the 31st international symposium on computer performance, modeling, measurements and evaluation (IFIPWG 7.3 Performance 2013)

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper considers heavy-traffic limit theorems for polling models with periodic server routing with general renewal arrivals and mixtures of gated and exhaustive service policies. We provide a strong conjecture for the limiting waiting-time distribution in a general parameter setting when the load tends to 1, under proper heavy-traffic scalings.