Hostname: page-component-7b7567c8c-wxvwp Total loading time: 0 Render date: 2026-11-19T02:56:52.655Z Has data issue: false hasContentIssue false

Weak Convergence Limits for Sojourn Times in Cyclic Queues Under Heavy Traffic Conditions

Published online by Cambridge University Press:  14 July 2016

Hans Daduna*
Affiliation:
Hamburg University
Christian Malchin*
Affiliation:
Hamburg University
Ryszard Szekli*
Affiliation:
Wrocław University
*
∗ Postal address: Department of Mathematics, Hamburg University, Bundesstrasse 55, 20146 Hamburg, Germany.
∗ Postal address: Department of Mathematics, Hamburg University, Bundesstrasse 55, 20146 Hamburg, Germany.
∗∗∗ Postal address: Mathematical Institute, Wrocław University, pl. Grunwaldzki 2/4, 50-384 Wrocław, Poland.
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

We consider sequences of closed cycles of exponential single-server nodes with a single bottleneck. We study the cycle time and the successive sojourn times of a customer when the population sizes go to infinity. Starting from old results on the mean cycle times under heavy traffic conditions, we prove a central limit theorem for the cycle time distribution. This result is then utilised to prove a weak convergence characteristic of the vector of a customer's successive sojourn times during a cycle for a sequence of networks with population sizes going to infinity. The limiting picture is a composition of a central limit theorem for the bottleneck node and an exponential limit for the unscaled sequences of sojourn times for the nonbottleneck nodes.

Information

Type
Research Article
Copyright
Copyright © Applied Probability Trust 2008