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. This work was conducted while the author visited the LIP6 (previously MASI) laboratory for a 6 months period as part of his Master degree.