By Topic

Statistical multiplexing with priorities: tail probabilities of queue lengths and waiting times

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Subramanian, V.G. ; Coordinated Sci. Lab., Illinois Univ., Urbana, IL, USA ; Srikant, R.

We consider the problem of estimating tail probabilities of waiting times and queue lengths in statistical multiplexing systems with two classes of sources-one with high priority and the other with low priority. The priority discipline is assumed to be nonpreemptive. Exact expressions for the transforms of these quantities are derived assuming that packet or cell streams are generated by Markovian arrival processes (MAPs). Then we numerically investigate the large-buffer asymptotic behavior of the waiting-time distribution for low-priority sources and show that these asymptotics may be non-exponential

Published in:

Decision and Control, 1997., Proceedings of the 36th IEEE Conference on  (Volume:2 )

Date of Conference:

10-12 Dec 1997