AbstractPerformance evaluation of several routing algorithms is made by discrete event simulation of a computer network consisting of 10 nodes. Both nonadaptive and adaptive routing algorithms are discussed and then the fixed (nonadaptive routing technique), the shortest-rpieue (isolated routing technique), and the shortest-path (distributed routing technique) routing algorithms are selected and described for simulation. We used average packet delay and network throughput as measures of network performance. We give results for each of the following goals:a) To evaluate and compare the network performance for the routing algorithms under light, moderate and heavy load conditions, during a transient period subject to changes in the mean arrival rate of messages and network link failures.b) To develop innovative design tools.c) To discuss and shed light on the characteristics of an ideal routing technique (correctness, computational simplicity, adaptiveness to changing traffic and topologies, stability, fairness and optimality).