Performance of a conservative simulator of ATM networks

The paper describes an implementation of a conservative parallel distributed simulator that has been used to simulate a high fidelity model of ATM networks. Important optimisations of the simulator for this application are described. The performance of the simulator is reported on up to 12 processors and compared with a sequential implementation. It is seen that the simulator gives good speedup and better performance than the sequential implementation. It is noted that the low overhead of the simulator relies on there being good lookahead in realistic models of ATM networks. Some situations where this lookahead is significantly reduced are described together with future extensions to fix these problems