Abstract
The Markov-modulated arrival process has been widely used in modelling traffic sources. In this paper, we model an input traffic to an ATM switch as a Markov-modulated Bernoulli process (MMBP), and analyse the queuing behaviour of a buffer fed with N identical MMBP sources using a probability generating function coupled with a matrix geometric approach; both the infinite and finite buffer cases are considered. Numerical results for the case of two MMBPs are also presented.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
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
