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

摘要

The proposed implementation of two QOS bearer services in ATMnetworks has generated considerable work on the analysis of implicitpolicy assignment space priority control buffer access schemes.Recently, there have been more interest directed towards explicit policyassignment space priority schemes because of their increased efficiencyand flexibility over implicit assignment schemes. The paper considers anexplicit policy assignment space priority control scheme employing thepush-out buffer access mechanism. Cell loss probabilities are derivedfor a traffic model consisting of two service classes. Each serviceclass consists of bursty traffic generated by a multiple number ofthree-state discrete-time Markov sources. The effect of cell lossprobabilities on traffic load and burstiness characteristics, as well asbuffer size, is examined. The authors have previously analyzed theperformance of an explicit policy assignment partial buffer sharingscheme for the same traffic model. Performance comparisons between thepush-out and partial buffer sharing schemes are also made in the presentpaper