Abstract

In this paper, we present a discrete-time queuing analysis of the ATM multiplexer fed by independent binary Markov sources with two priority classes of cells. Each source alternates between On, Off periods and each On period consists of a random number of sub-periods. Each sub-period generates geometrically distributed number of cells, first cell of a sub-period is assigned high-priority while remaining cells are assigned low-priority. During normal operation the system delivers both high- and low-priority traffic while during congestion delivers only high-priority cells to their destinations and discard low-priority cells. We determine the performance of the system before and after discarding of the low-priority cells. We determine probability generating function of the queue length in both cases under infinite buffer assumption. Then, the mean delay for infinite buffer and approximate cell loss probabilities for the finite buffer cases are presented as a function of the percentage of the high-priority traffic load.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.