Abstract
An ATM statistical multiplexer with infinite buffer capacity and a number of independent (not necessarily identical) 2-state MMBP (Markov modulated Bernoulli process) traffic sources is considered in this paper, which is modeled as a discrete-time single-server queueing system with correlated arrivals. A simple analytic approach is presented to obtain an upper bound for the tail distribution of the buffer contents. This upper bound is good and even tight in many cases, as shown by the numerical results. Compared to a previously reported general solution technique, our approximate analytic approach is very easy to use and not limited by the system size, and costs nearly no CPU-time. So it is useful in practice. This analytic method can also be easily extended to general m-state Markov modulated arrival processes (e.g., m-state MMBPs). >
Sign-in/Register to access full text options 
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 callDisclaimer: 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.
