Delay analysis of a packet voice multiplexer

The performance of a statistical multiplexer whose inputs consist of a superposition of voice packets from c trunks is studied. Voice calls are established according to a Poisson process and call holding times have a general distribution. Each voice call, while in progress, generates packets at fixed intervals of Δ. Thus, when n calls are in progress, the packet generation process is a superposition of n renewal processes, each with an interarrival time of exactly Δ. These packets are fed to a transmitter whose service time for all packets is exactly β. It is assumed that c β<Δ, i.e. the transmitter queue is stable even when all trunks are busy. The delay for such a system is analyzed by solving the ΣD_i/D/1 queue. An efficient hybrid simulation method for the packet voice multiplexer is proposed