Hostname: page-component-7b7567c8c-wxvwp Total loading time: 0 Render date: 2026-11-17T00:15:49.292Z Has data issue: false hasContentIssue false

Weak Convergence Limits for Closed Cyclic Networks of Queues with Multiple Bottleneck Nodes

Published online by Cambridge University Press:  04 February 2016

Ole Stenzel*
Affiliation:
University of Hamburg
Hans Daduna*
Affiliation:
University of Hamburg
*
∗ Current address: Institute of Stochastics, Ulm University, Helmholtzstrasse 18, 89069 Ulm, Germany.
∗∗ Postal address: Center of Mathematical Statistics and Stochastic Processes, University of Hamburg, Bundesstrasse 55, 20146 Hamburg, Germany. Email address: daduna@math.uni-hamburg.de
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 a sequence of cycles of exponential single-server nodes, where the number of nodes is fixed and the number of customers grows unboundedly. We prove a central limit theorem for the cycle time distribution. We investigate the idle time structure of the bottleneck nodes and the joint sojourn time distribution that a test customer observes at the nonbottleneck nodes during a cycle. Furthermore, we study the filling behaviour of the bottleneck nodes, and show that the single bottleneck and multiple bottleneck cases lead to different asymptotic behaviours.

MSC classification

Information

Type
Research Article
Copyright
© Applied Probability Trust