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
Original language | English |
---|---|
Pages (from-to) | 878-883 |
Number of pages | 6 |
Journal | Computer Communications |
Volume | 20 |
Issue number | 10 |
DOIs | |
Publication status | Published - Sept 25 1997 |
Externally published | Yes |
Keywords
- ATM
- B-ISDNs
- MMBP
- Markov chain
ASJC Scopus subject areas
- Computer Networks and Communications