Queueing analysis of explicit policy assignment push-out buffer sharing schemes for ATM networks

The proposed implementation of two QOS bearer services in ATM networks has generated considerable work on the analysis of implicit policy assignment space priority control buffer access schemes. Recently, there have been more interest directed towards explicit policy assignment space priority schemes because of their increased efficiency and flexibility over implicit assignment schemes. The paper considers an explicit policy assignment space priority control scheme employing the push-out buffer access mechanism. 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 buffer size, is examined. The authors have previously analyzed the performance of an explicit policy assignment partial buffer sharing scheme for the same traffic model. Performance comparisons between the push-out and partial buffer sharing schemes are also made in the present paper