Queueing analysis of explicit priority assignment buffer access scheme for ATM networks

Authors:
Chung G. Kang;Harry H. Tan
Affiliations:
School of Electrical Engineering, Korea University, 1.5-Ka, Anam-dong, Sungbuk-Ku, Seoul 136-701, South Korea;Electrical and Computer Engineering Department, University of California, Irvine, CA 92717, USA
Venue:
Computer Communications
Year:
1998

Citing 6
Cited 1

A finite buffer two class queue with different scheduling and push-out schemes

IEEE INFOCOM '92 Proceedings of the eleventh annual joint conference of the IEEE computer and communications societies on One world through communications (Vol. 1)
Model and call admission control for distributed applications with correlated bursty traffic

Supercomputing '95 Proceedings of the 1995 ACM/IEEE conference on Supercomputing
A Burst-Level Priority Scheme for Bursty Traffic in ATM Networks

IC3N '97 Proceedings of the 6th International Conference on Computer Communications and Networks
Modelling prioritized MPEG video using TES and a frame spreading strategy for transmission in ATM networks

INFOCOM '95 Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 2)-Volume - Volume 2
Priority discarding of speech in integrated packet networks

IEEE Journal on Selected Areas in Communications
Priority queueing strategies and buffer allocation protocols for traffic control at an ATM integrated broadband switching system

IEEE Journal on Selected Areas in Communications

A study on performance comparison of priority-based queueing scheme with two queueing buffer allocations in an UMTS core network gateway

Mobility '08 Proceedings of the International Conference on Mobile Technology, Applications, and Systems

Quantified Score

Hi-index	0.24

Visualization

Abstract

The recommended implementation of two quality of service bearer services in ATM networks has generated considerable work on the analysis of implicit policy assignment space priority control buffer access schemes. Since then, there has been more interest directed towards explicit policy assignment space priority schemes because of their increased efficiency and flexibility over implicit assignment schemes. This paper considers an explicit policy assignment space priority control scheme employing the partial buffer sharing buffer access mechanism. Cell loss probabilities are derived for a traffic model consisting of two source classes. Each source class consists of bursty traffic generated by a multiple number of three-state discrete-time Markov sources. The dependence of cell loss probabilities on traffic load and burstiness characteristics, as well as system parameters such as buffer size and buffer sharing thresholds, is examined.