A new framework supporting the bottleneck analysis of multiclass queueing networks

Abstract

In this paper, we introduce a new framework supporting the bottleneck analysis of closed, multiclass BCMP queue- ing networks with large population sizes. First, we provide a sufficient and necessary condition establishing the existence of a single bottleneck. Then, we derive the new framework proposing efficient algorithms for the identification of queue- ing networks bottlenecks by means of linear programming. Our analysis reduces the computational requirements of ex- isting techniques and, under general assumptions, it is able to handle load-dependent stations. Theoretical and practi- cal insights on the asymptotic behavior of multiclass net- works are investigated as application of the proposed frame- work. © 2008 ICST ISBN.