Delay asymptotics for a priority queueing system

Authors:
Sanjay Shakkottai;R. Srikant
Affiliations:
Coordiated Science Laboratory and Dept. of Electrical and Computer Engineering, University of Illinois at Urbana-Champaign;Coordiated Science Laboratory and Dept. of General Engineering, University of Illinois at Urbana-Champaign
Venue:
Proceedings of the 2000 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Year:
2000

Citing 3
Cited 0

A generalized processor sharing approach to flow control in integrated services networks: the single-node case

IEEE/ACM Transactions on Networking (TON)
Effective bandwidths for multiclass Markov fluids and other ATM sources

IEEE/ACM Transactions on Networking (TON)
Large deviations approximation for fluid queues fed by a large number of on/off sources

IEEE Journal on Selected Areas in Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we study discrete-time priority queueing systems fed by a large number of arrival streams. We first provide bounds on the actual delay asymptote in terms of the virtual delay asymptote. Then, under suitable assumptions on the arrival process to the queue, we show that these asymptotes are the same. We then consider a priority queueing system with two queues. Using the earlier result, we derive an upper bound on the tail probability of the delay. Under certain assumptions on the rate function of the arrival process, we show that the upper bound is tight. We then consider a system with Markovian arrivals and numerically evaluate the delay tail probability and validate these results with simulations.