Bounding blocking probabilities and throughput in queueing networks with buffer capacity constraints

Queueing Systems

Volumn 28, Issue 1-3, 1998, Pages 55-77

  Kumar, Sunil ^a   Srikant, R ^b   Kumar, P R ^b  

^a STANFORD UNIVERSITY   (United States)

^b United States of America   (United States)

Author keywords

Blocking; Communication networks; Finite buffers; Performance evaluation; Queueing networks

Indexed keywords

BUFFER STORAGE; LINEAR PROGRAMMING; MANUFACTURE; QUEUEING NETWORKS; QUEUEING THEORY; TELECOMMUNICATION NETWORKS;

BLOCKING; BUFFER CAPACITY; FINITE BUFFER; FINITE CAPACITY; LINEAR PROGRAMS; PERFORMANCE EVALUATION; PERFORMANCE MEASURE; UPPER AND LOWER BOUNDS;

BLOCKING PROBABILITY;

EID: 0032393939     PISSN: 02570130     EISSN: 15729443     Source Type: Journal    
DOI: 10.1023/a:1019142905175     Document Type: Article

References (18)

1. N. Bean, R.J. Gibbens and S. Zachary, Analysis of large single resource loss systems under heavy traffic with applications to integrated networks, Adv. in Appl. Probab. 27 (1995) 273-292.
2. D. Bertsimas, I.C. Paschalidis and J.N. Tsitsiklis, Optimization of multiclass queueing networks: Polyhedral and nonlinear characterizations of achievable performance, Ann. Appl. Probab. 4 (1994) 43-75.
3. J.G. Dai, On positive Harris recurrence of multiclass queueing networks: A unified approach via fluid limit model, Ann. Appl. Probab. 5 (1995) 49-77.
4. D.G. Down and S.P. Meyn, Piecewise linear test functions for stability of queueing networks, in: Proc. of the IEEE 33rd Conf. on Decision and Control (December 1994) pp. 2069-2074.
5. A.G. Greenberg and R. Srikant, Computational techniques for accurate performance evaluation of multirate, multihop communication networks, IEEE/ACM Trans. Networking 5 (1997) 266-277.
6. J.S. Kaufman, Blocking in a shared resource environment, IEEE Trans. Commun. 29 (1981) 1474-1481.
7. F.P. Kelly, Loss networks, Ann. Appl. Probab. 1 (1991) 319-378.
8. L. Kleinrock, Queueing Systems, Vol. 1: Theory (Wiley-Interscience, New York, 1975).
9. P.R. Kumar, Re-entrant lines, Queueing Systems 13 (1993) 87-110.
10. S. Kumar and P.R. Kumar, Performance bounds for queueing networks and scheduling policies, IEEE Trans. Automat. Control 39 (1994) 1600-1611.
11. P.R. Kumar and S.P. Meyn, Stability of queueing networks and scheduling policies, IEEE Trans. Automat. Control 40 (1995) 251-260.
12. P.R. Kumar and S.P. Meyn, Duality and linear programs for stability and performance analysis of queueing networks and scheduling policies, IEEE Trans. Automat. Control 41 (1996) 4-17.
13. S. Lippman, Applying a new device in the optimization of exponential queueing systems, Oper. Res. 23 (1975) 687-710.
14. S.H. Lu and P.R. Kumar, Distributed scheduling based on due dates and buffer priorities, IEEE Trans. Automat. Control 36 (1991) 1406-1416.
15. H.G. Perros and E.T. Altiok, Queueing Networks with Blocking (North-Holland, Amsterdam, 1989).
16. J.W. Roberts, A service system with heterogeneous service requirements, Performance of Data Communication Systems and Their Applications (1981) 423-431.
17. K.W. Ross, Multiservice Loss Models for Broadband Telecommunication Networks (Springer, London, 1995).
18. W. Whitt, Tail probabilities with statistical multiplexing and effective bandwidths in multi-class queues, Telecommunication Systems 2 (1993) 71-107.