Heavy Traffic Analysis of Polling Systems in Tandem

DOI10.1287/opre.47.4.524zbMath0979.90018OpenAlexW2126503494MaRDI QIDQ2770120

Martin I. Reiman, Lawrence M. Wein

Publication date: 7 February 2002

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

Full work available at URL: http://hdl.handle.net/1721.1/48046

zbMATH Keywords

sojourn time distributioninterarrival timestandem queueing networkheavy traffic approximations

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Queues and service in operations research (90B22) Traffic problems in operations research (90B20)

Related Items (10)

A law of the iterated logarithm for the sojourn time process in queues in series ⋮ Polling: past, present, and perspective ⋮ Polling systems with periodic server routing in heavy traffic: renewal arrivals ⋮ About the sojourn time process in multiphase queueing systems ⋮ Analysis of tandem polling queues with finite buffers ⋮ Mathematical methods to study the polling systems ⋮ Reduction of a polling network to a single node ⋮ Polling systems with periodic server routeing in heavy traffic: distribution of the delay ⋮ Heavy traffic limit for the workload plateau process in a tandem queue with identical service times ⋮ Heavy traffic analysis of roving server networks

This page was built for publication: Heavy Traffic Analysis of Polling Systems in Tandem