Simulation facility of distributed memory system with ‘mad postman’ communication network

Abstract

This paper presents a simulation facility developed for the ‘mad-postman’ packet routing communication network. Unlike previously published results for this network this facility and the results generated provide a complete simulation of the network, the network-processor interface and the application layer. The results are presented in terms of average message latency against network throughput for applications that generate randomly addressed packets at random intervals. The results show that if we measure message latency against throughput then at some stage latency increases rapidly with little increase in throughput. This point is independent of message length.