QUEUING ANALYSIS OF EXPLICIT PRIORITY ASSIGNMENT BUFFER ACCESS SCHEMEFOR ATM NETWORKS

The recommended implementation of two quality of service bearer servic es in ATM networks has generated considerable work on the analysis of implicit policy assignment space priority control buffer access scheme s. Since then, there has been more interest directed towards explicit policy assignment space priority schemes because of their increased ef ficiency and flexibility over implicit assignment sc hemes. This paper considers an explicit policy assignment space priority control scheme employing the partial buffer sharing buffer access mechanism. Cell lo ss probabilities are derived for a traffic model consisting of two sou rce classes. Each source class consists of bursty traffic generated by a multiple number of three-state discrete-time Markov sources. The de pendence of cell loss probabilities on traffic load and burstiness cha racteristics, as well as system parameters such as buffer size and buf fer sharing thresholds, is examined. (C) 1998 Elsevier Science B.V.