Queueing analysis of explicit priority assignment partial buffer sharing schemes for ATM networks

Chung G. Kang, Harry H. Tan

Research output: Chapter in Book/Report/Conference proceedingConference contribution

19 Citations (Scopus)

Abstract

The implementation of two QOS bearer services in ATM networks has generated considerable recent interest in implicit assignment space priority control buffer access schemes. This paper considers the more flexible explicit assignment space priority control policy employing the partial buffer sharing scheme. Cell loss probabilities are derived for a traffic model consisting of two service classes. Each service class consists of bursty traffic generated by a multiple number of three-state discrete-time Markov sources. The effect of cell loss probabilities on traffic load and burstiness characteristics, as well as system parameters such as buffer size and buffer sharing threshold, is examined.

Original languageEnglish
Title of host publicationProceedings - IEEE INFOCOM
PublisherPubl by IEEE
Pages810-819
Number of pages10
ISBN (Print)0818635800
Publication statusPublished - 1993
Externally publishedYes
EventProceedings of the 12th Annual Joint Conference of the IEEE Computer and Communications Societies - IEEE INFOCOM '93 - San Francisco, CA, USA
Duration: 1993 Mar 301993 Apr 1

Publication series

NameProceedings - IEEE INFOCOM
Volume2
ISSN (Print)0743-166X

Other

OtherProceedings of the 12th Annual Joint Conference of the IEEE Computer and Communications Societies - IEEE INFOCOM '93
CitySan Francisco, CA, USA
Period93/3/3093/4/1

ASJC Scopus subject areas

  • Computer Science(all)
  • Electrical and Electronic Engineering

Fingerprint Dive into the research topics of 'Queueing analysis of explicit priority assignment partial buffer sharing schemes for ATM networks'. Together they form a unique fingerprint.

Cite this