Many-sources delay asymptotics with applications to priority queues

Queueing Systems

Volumn 39, Issue 2-3, 2001, Pages 183-200

  Shakkottai, Sanjay ^a   Srikant, R ^b  

^a University of Illinois at Urbana Champaign   (United States)

^b UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

Author keywords

Large deviations waiting time; Many sources scaling; Priority queues

Indexed keywords

QUEUEING NETWORKS;

ARRIVAL PROCESS; MANY-SOURCES SCALING; MARKOVIAN ARRIVALS; PRIORITY QUEUEING; PRIORITY QUEUES; RATE FUNCTIONS; TAIL PROBABILITY; WAITING-TIME;

QUEUEING THEORY;

EID: 0035542375     PISSN: 02570130     EISSN: 15729443     Source Type: Journal    
DOI: 10.1023/A:1012748601464     Document Type: Article

References (21)

1. F. Baccelli and P. Brémaud, Elements of Queueing Theory: Palm-Martingale Calculus and Stochastic Recurrences (Springer, Berlin, 1994).
2. D. Bertsimas, I. Paschalidis and J. Tsitsiklis, Asymptotic buffer overflow probabilities in multiclass multiplexers: An optimal control approach, IEEE Trans. Automat. Control 43(3) (1998) 315-335.
3. D.D. Botvich and N.G. Duffield, Large deviations, the shape of the loss curve, and economies of scale in large multiplexers, Queueing Systems 20 (1995) 293-320.
4. C. Courcoubetis and R. Weber, Buffer overflow asymptotics for a switch handling many traffic sources, J. Appl. Probab. 33(3) (1996) 886-903.
5. G. deVeciana and J. Walrand, Effective bandwidths: Call admission, traffic policing and filtering for ATM networks, Queueing Systems (1995).
6. S. Delas, R. Mazumdar and C. Rosenberg, Cell loss asymptotics for buffers handling a large number of independent stationary sources with HOL service priorities, Preprint; an earlier version appeared in: Proceedings of IEEE Infocom, New York (1999).
7. P. Glynn and W. Whitt, Logarithmic asymptotes for steady-state tail probabilities in a single-server queue, in: Studies in Applied Probability, Festschrift in Honor of Lajos Tacács, eds. J. Galambos and J. Gani (1994).
8. G. Kesidis and T. Konstantopoulos, Extremal traffic and worst-case performance for queues with shaped arrivals, Fields Institute Communications (2000).
9. G. Kesidis, J. Walrand and C. Chang, Effective bandwidths for multiclass Markov fluids and other ATM sources. IEEE/ACM Trans. Networking 1(4) (1993).
10. E. Knightly, Enforcable quality of service guarantees for bursty traffic streams, in: Proceedings of IEEE Infocom, San Francisco, CA (March 1998).
11. N. Likhanov and R. Mazumdar, Cell loss asymptotics for buffers fed with a large number of independent stationary sources, J. Appl. Probab. 36 (March 1999).
12. S. P. Meyn, Multiplicative ergodicity and the multiplicative Poisson equation for Markov chains and processes, to appear in Probab. Theory Related Fields.
13. A. Parekh and R. Gallager, A generalized processor sharing approach to flow control in integrated services networks: The single-node case, IEEE/ACM Trans. Networking 1(3) (1993).
14. I. Paschalidis, Performance analysis and admission control in multimedia communication networks, Automatica, Special Issue on Control Methods for Communication Networks, eds. V. Anantharam and J. Walrand (December 1999).
15. S. Shakkottai and R. Srikant, Many sources delay asymptotics with applications to priority queues, CSL Technical Report, University of Illinois at Urbana-Champaign (2001).
16. A. Shwartz and A. Weiss, Large Deviations for Performance Analysis (Chapman and Hall, London, 1995).
17. A. Simonian and J. Guibert, Large deviations approximation for fluid queues fed by a large number of ON/OFF sources, IEEE J. Selected Areas Commun. 13(1995).
18. A. Stolyar and K. Ramanan, Largest weighted delay first scheduling: Large deviations and optimality, to appear in Ann. Appl. Probab.
19. D. Stoyan, Comparison Methods for Queues and other Stochastic Models (Wiley, New York, 1983).
20. V. Subramanian and R. Srikant, Statistical multiplexing with priorities: Tail probabilities of queue lengths and waiting times, to appear in Queueing Systems (2000).
21. J. Qiu, C. Cetinkaya, C. Li and E. Knightly, Inter-class resource sharing using statistical service envelopes, Preprint; an earlier version appeared, in: Proceedings of IEEE Infocom, New York (1999).