Abstract: We consider the problem of identifying bottlenecks in closed queueing networks with state-dependent service rates. A particular node is said to be a bottleneck if the number of items in that node grows without bound as the total number of items in the network becomes large. We will see that bottleneck behaviour depends on the relative sizes of the radii of convergence of certain power series associated with each node. Several special cases will be described, which illustrate a range of interesting behaviour.
Acknowledgement: This work is supported by the ARC
The speaker:
Last modified: 11th July 2016