Distributed double loop networks are very advantageous for the design and implementation of local area networks and parallel processing architectures, mainly due to their fault-tolerance, low communication latency, and regularity. In this paper, an algorithm for the formulation of routing tables that facilitate routing of messages in a distributed double loop network is presented. The algorithm takes O(d) steps to formulate the routing tables, where d is the diameter of the network. This algorithm is based on breadth first search technique. It finds the distance table for a given node first and then computes the routing table from the distance table. In contrast with some similar works, knowledge of the diameter of the network is not required. The algorithm can also be applied to any similar graph with appropriate modification.
展开▼
