Averaging Principles for a Diffusion-Scaled, Heavy-Traffic Polling Station with K Job Classes

DOI10.1287/moor.1100.0460zbMath1219.60077OpenAlexW2144414963MaRDI QIDQ3169113

Otis B. Jennings

Publication date: 27 April 2011

Published in: Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/moor.1100.0460

zbMATH Keywords

heavy trafficpolling systemsdiffusion limitsmulticlass queueing networks

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Functional limit theorems; invariance principles (60F17)

Related Items (4)

Polling: past, present, and perspective ⋮ Comparisons of ticket and standard queues ⋮ Induced idleness leads to deterministic heavy traffic limits for queue-based random-access algorithms ⋮ Heavy traffic analysis of roving server networks

This page was built for publication: Averaging Principles for a Diffusion-Scaled, Heavy-Traffic Polling Station with K Job Classes