Parallel trace-driven simulation for packet loss in finite-buffered voice multiplexers

Packet loss of voice multiplexers is usually studied by a G/D/1/K system. Most analytic analyses concentrate on modeling the input processes to the multiplexer. Sometimes, it is necessary to study the behavior of the multiplexer under real workload. A trace of packet arrivals is used as the input to the simulation model. The trace is usually huge, and the time to complete the simulation is very long. To speed up the simulation process, this paper proposes a parallel simulation algorithm. We show that the speedup of our approach is O(N) where N is the number of processors. The algorithm can also be used for the trace-driven simulation of any system modeled as a G/D/1/K queue.