Bounds on finite horizon QoS metrics with application to call admission

Authors:
Zhen Liu;Philippe Nain;Don Towsley
Affiliations:
INRIA, Sophia Antipolis Cedex, France;INRIA, Sophia Antipolis Cedex, France;Department of Computer Science, University of Massachusetts, Amherst, MA
Venue:
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
Year:
1996

Citing 9
Cited 1

Effective bandwidths at multi-class queues

Queueing Systems: Theory and Applications
Effective bandwidths for the multi-type UAS channel

Queueing Systems: Theory and Applications
On computing per-session performance bounds in high-speed multi-hop computer networks

SIGMETRICS '92/PERFORMANCE '92 Proceedings of the 1992 ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems
Effective bandwidth of general Markovian traffic sources and admission control of high speed networks

IEEE/ACM Transactions on Networking (TON)
Performance and stability of communication networks via robust exponential bounds

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

IEEE/ACM Transactions on Networking (TON)
The Markov-modulated Poisson process (MMPP) cookbook

Performance Evaluation
Quality-of-service issues in high-speed networks

Quality-of-service issues in high-speed networks
Exponential Bounds with an Application to Call Admission

Exponential Bounds with an Application to Call Admission

Exponential bounds with applications to call admission

Journal of the ACM (JACM)

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we are concerned with a discrete time, single server system in which packets arrive from a finite population of sources. Under the assumption that arrivals from each source are modulated by a Markov process, we consider the following metrics (i) the fraction of an interval during which the queue length exceeds a certain value, and (ii) the fraction of a group of packets from a single source that arrive to find the queue length above a certain value. For both metrics we derive upper and lower bounds on the probabilities that they exceed a threshold. These are important measures because they reflect more accumtely the behavior perceived by applications such as networked audio and video. An application of these results to call admission is also given.