DocumentCode :
3495442
Title :
Robust box bounds: throughput guarantees for closed multiclass queueing networks with minimal stochastic assumptions
Author :
Majumdar, S. ; Woodside, C.M. ; Neilson, J.E. ; Petriu, D.C.
Author_Institution :
Carleton Univ., Ottawa, Ont., Canada
fYear :
1992
fDate :
4-8 May 1992
Firstpage :
2006
Abstract :
To use queuing theory to analyze real systems such as computer communications networks, one makes assumptions that are, strictly speaking, untrue. The authors provide an exact analysis for cases with greatly relaxed assumptions. Service times can have general increasing failure rate distributions, different by class even at FIFO nodes. Routing can be arbitrary, including dependencies along the route, provided the number of visits to each node is a random variable. Only the mean service time and mean visit rates at nodes need be specified. A lower throughput bound is found which gives a minimum guaranteed throughput for each class; together with the familiar multiclass asymptotic upper bounds they give a convex feasible region in a multidimensional throughput space. A detailed analysis is given for systems with FIFO and infinite-server nodes, and the extension to processor-sharing nodes is described. The results can be reinterpreted as a set of bounds on the separate throughputs. This is equivalent to a circumscribed rectangular region called the robust box bounds
Keywords :
queueing theory; telecommunication networks; telecommunication traffic; FIFO nodes; arbitrary routing; circumscribed rectangular region; closed multiclass queueing networks; computer communications networks; dependencies; exact analysis; feasible region; general distributions; increasing failure rate; infinite-server nodes; lower throughput bound; mean service time; mean visit rates; minimum guaranteed throughput; multiclass asymptotic upper bounds; multidimensional throughput space; number of visits; processor-sharing nodes; random variable; real systems; relaxed assumptions; robust box bounds; service classes; stochastic assumptions; Communication networks; Computer networks; Computer science; Queueing analysis; Robustness; Stochastic processes; Stochastic systems; Systems engineering and theory; Telecommunication computing; Throughput;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
INFOCOM '92. Eleventh Annual Joint Conference of the IEEE Computer and Communications Societies, IEEE
Conference_Location :
Florence
Print_ISBN :
0-7803-0602-3
Type :
conf
DOI :
10.1109/INFCOM.1992.263471
Filename :
263471
Link To Document :
بازگشت