A simulation model for performance analysis of routing algorithms in concurrent systems under realistic load

The communication behavior of concurrent programs has great influence on the efficiency of a routing algorithm. Selection of a good routing algorithm for a particular application or network constraint requires performance analysis under realistic load. We have proposed a simulator model for the study and analysis of the various routing policies in concurrent systems. In this paper a timed Petri net model for representing concurrent programs and its probabilistic approximation are presented. The development considerations and operation methodology of the proposed event-driven simulator are presented.