Queueing Analysis of a Threshold Based Priority Scheme For ATM Networks

62Citations
Citations of this article
8Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In this paper, we propose a threshold based priority scheme in which a tuning parameter is used to provide adequate quality of service to real-time traffic while providing the best possible service to the nonreal time traffic. Our priority scheme is a generalization of the static priority scheme and the 1-limited scheme and is more flexible than both. For this scheme, we carry out a queueing analysis and obtain the joint distribution of the queue-lengths. We show by numerical examples how the parameter of this scheme can be tuned dynamically, so that the tuning function can be integrated with the call admission policy. © 1993 IEEE

Cite

CITATION STYLE

APA

Lee, D. S., & Sengupta, B. (1993). Queueing Analysis of a Threshold Based Priority Scheme For ATM Networks. IEEE/ACM Transactions on Networking, 1(6), 709–717. https://doi.org/10.1109/90.266058

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free