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.
- ATM networks
- Buffer access scheme
- Queueing analysis
ASJC Scopus subject areas
- Computer Networks and Communications