Parallel simulation of ATM switches using relaxation

Algorithms for simulating an ATM switch on a number of parallel processors are described. These include parallel generation and merging of bursty arrival sources, marking and deleting of lost cells due to buffer overflows, and, in one version of the algorithm, computation of departure instants. When the number of lost cells is relatively small, the run time of the simulation is approximately O(/), where is the total number of cells simulated and the number of processors. The cells are processed in batches of fixed size; that size affects both the structure and the performance of the algorithms.