Routing strategies in digital networks

Abstract

The problem of obtaining efficient routing algorithms for the fast delivery of messages to their destinations is of the utmost Importance in the design of modern digital networks. The research project deals with the investigation of various types of routing algorithms and the techniques available for evaluating the performance of these algorithms. A minimum delay adaptive routing algorithm, developed by R G ftallager is selected. The overall performance of a particular network consisting of randomly distributed nodtts is optimised using the algorithm. The performance of the network is optimized by minimizing the average packet delays. A simulation program is used to determines the performance of the netuork. The minimum delay routing algorithm provides a 30 to 40 percent improvement on the average packet delays compared to a static least cost, algorithm. The improvement is obtained once the adaptive routing algorithm has been carefully adapted to the network in which it is implemented.