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

✍ Scribed by Tava Lennon Olsen; R.D. van der Mei

• Publisher: Elsevier Science
• Year: 2005
• Tongue: English
• Weight: 224 KB
• Volume: 33
• Category: Article
• ISSN: 0167-6377
• DOI: 10.1016/j.orl.2004.05.003

✦ Synopsis

This paper considers heavy-tra c 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-tra c scalings.