Simulation of a Routing Algorithm using Distributed Simulation Techniques

. This paper describes our experiment in simulation of a routing algorithm in ATM networks using distributed simulation techniques. These techniques are a promising tool for performance evaluation of large and complex systems that can not be handled sequentially. The simulations are performed on a CM-5 and the results show that interesting speedups can be achieved when compared to a sequential execution. However, they also raise the problem of optimal partitioning and load balancing in communication network models where communication costs represent the main overhead. 1 Introduction Discrete event simulation often represents the only way to study the behavior of a system. This is because analytical methods may be unsuitable when the size and the complexity of the system require simplifications that reduce the usefulness of the study. Simulation is more likely to allow a complete study since the level of detail is not theoretically limited. However, the flexibility of simulation is pai..