Tail probabilities of low-priority waiting times and queue lengths in {MAP}/{GI}/1 queues

Authors:
Vijay Subramanian;R. Srikant
Affiliations:
Mathematics of Communication Networks, Motorola, 1501 W. Shure Drive, Arlington Heights, IL 60004, USA E-mail: VSUBRAM2@email.mot.com;Coordinated Science Laboratory and Department of General Engineering, University of Illinois, 1308 W. Main Street, Urbana, IL 61801, USA E-mail: rsrikant@uiuc.edu
Venue:
Queueing Systems: Theory and Applications
Year:
1999

Citing 12
Cited 2

A storage model with a two-state random environment

Operations Research - Supplement to Operations Research: stochastic processes
A generalized processor sharing approach to flow control in integrated services networks: the single-node case

IEEE/ACM Transactions on Networking (TON)
Mean waiting times in nonpreemptive priority queues with Markovian arrival and i.i.d. service processes

Performance '93 Proceedings of the 16th IFIP Working Group 7.3 international symposium on Computer performance modeling measurement and evaluation
Analysis of a nonpreemptive priority queue with SPP arrivals of high class

Performance Evaluation
Effective bandwidths with priorities

IEEE/ACM Transactions on Networking (TON)
Asymptotics for M/G/1 low-priority waiting-time tail probabilities

Queueing Systems: Theory and Applications
The BMAP/G/1 QUEUE: A Tutorial

Performance Evaluation of Computer and Communication Systems, Joint Tutorial Papers of Performance '93 and Sigmetrics '93
Analysis, approximations and admission control of a multi-service multiplexing system with priorities

INFOCOM '95 Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 2)-Volume - Volume 2
Effective bandwidths of departure processes from queues with time varying capacities

INFOCOM '95 Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 3)-Volume - Volume 3
Bounds, approximations and applications for a two-queue GPS system

INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 3
Fundamental bounds and approximations for ATM multiplexers with applications to video teleconferencing

IEEE Journal on Selected Areas in Communications
Resource management in wide-area ATM networks using effective bandwidths

IEEE Journal on Selected Areas in Communications

Priority queueing systems: from probability generating functions to tail probabilities

Queueing Systems: Theory and Applications
Geometric tail of queue length of low-priority customers in a nonpreemptive priority MAP/PH/1 queue

Queueing Systems: Theory and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider the problem of estimating tail probabilities of waiting times 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 a numerical investigation of the large-buffer asymptotic behavior of the the waiting-time distribution for low-priority sources shows that these asymptotics are often non-exponential.