Evaluation of a Path-Finding Algorithm for Local Interconnected Area Networks

The issue of routing in interconnected local area networks (LAN's) is considered. Of particular interest is source routing where the source station specifies, in an inter-LAN frame, the complete path traversed by that frame. In source routing, a mectianism is needed for the source station to determine a path to any given destination. A path- finding algorithm has been proposed by Sy, Pitt, and Donnan. In this paper, we evaluate the performance of that algorithm using a simula- tion model of interconnected token rings. Our evaluation is based on a connection-oriented environment and the assumption that the path- finding algorithm is used eacti time a new connection is established. Our results indicate that the algorithm selects paths with good delay and throughput performance for the new connection. As to the existing connections, the algorithm yields good throughput behavior, but may not perform well as far as delay is concerned;