Analytic computation of end-to-end delays in queueing networks with batch Markovian arrival processes and phase-type service times

This paper poposes an analytic approach to compute end-to-end delays in queueing networks composed of BMAP/PH/1 queues. The approximations for the first two moments of the end-to-end delays an, based on corresponding moments for the delays at each node in the network. In a traffic-based decomposition of queueing networks, different techniques for the departure process approximation, including the ETAOA truncation, and traffic descriptions, like phase-type distributions and Markovian arrival processes (MAPs), have been implemented and are compared with simulation results. Extensions to networks with two classes of customers are also discussed.