Approximation techniques for computing packet loss in finite-buffered voice multiplexers

Abstract

The three performance models studied differ primarily in the manner in which the superposition of the voice sources (i.e. the arrival process) is modeled. The first approach models the superimposed voice sources as a renewal process. The second approach is based on modeling the superimposed voice sources as a Markov modulated Poisson process (MMPP). The choice of parameters for the MMPP captures aspects of the long-term correlation in the arrival process in a more intuitive manner and computes loss more accurately than previous approaches for computing the MMPP parameters. A fluid flow approximation for the superposition is evaluated on the basis of the technique of D. Anick et al. (1982). For all three approaches, the case of multiplexing voice sources over a T1-rate link is considered. Both the new MMPP model and the fluid flow approximation can provide accurate loss predictions for parameter ranges of practical interest. The modeling of buffer overflow for general arrival processes is addressed, and modeling approaches for analyzing finite-buffer multiplexers with general arrival and service processes in a network environment are outlined.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">&gt;</ETX>