Packet Loss Process in a Queue with Markovian Arrivals

In this report, a detailed analysis of the packet loss process in a finite-buffer queue fed by the Markovian arrival process (MAP) is shown. The results consist of both transient and stationary characterization of the loss process in terms of the loss ratio, the number of packets lost per time unit and the number of losses in an interval of a given length. In addition to the analytical results, a number of numerical examples based on an IP traffic trace file are presented.