Article ID Journal Published Year Pages File Type
10524022 Operations Research Letters 2005 9 Pages PDF
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.
Keywords
Related Topics
Physical Sciences and Engineering Mathematics Discrete Mathematics and Combinatorics
Preview
Polling systems with periodic server routing in heavy traffic: renewal arrivals
Authors
, ,