A discrete-time batch Markovian arrival process as B-ISDN traffic model

Abstract

In this paper, a class of versatile discrete-time Markovian arrival processes (D-BMAP'’s)is introduced. A model for the superposition of video sources, both with uniform and multiple activity levels, belongs to this class. Formula for the correlation between arrivals in the D-BMAParederived. Observing the D-BMAP/G/1/N queue at departure epochs results in a finite Markov chain of M/G/1 type. An efficient method allowing the computation of the queue lenght distribution at departures is proposed. Using matrix analytical methods, we derive a solution for the buffer occupancy andfor the loss probability which can be expressed in a form suitable for numerical computations. Finally, we show that the output processof this queue is again a DMAP.