Communication system for sending an identical routing tree to all connected nodes to establish a shortest route and transmitting messages thereafter

• US 4,987,536 A
• Filed: 05/12/1988
• Issued: 01/22/1991
• Est. Priority Date: 05/12/1988
• Status: Expired due to Term

• Current Assignee: Motorola, Inc. (Motorola Solutions, Inc.)
• Original Assignee: Codex Corporation
• Inventors: Humblet, Pierre A.
• Primary Examiner(s): Lee, Thomas C.
• Application Number:
  US07/193,391
• Time in Patent Office: 985 Days
• Field of Search: 364/200MS File, 364/900 MS File, 364/514, 370/60, 370/94, 370/16, 370/94.2, 370/94.3
• US Class Current: 709/241
• CPC Class Codes: G06F 15/173 using an interconnection network, e.g. matrix, shuffle, pyramid, star, snowflake
• CPC Class Codes: H04L 45/02 Topology update or discovery
• CPC Class Codes: H04L 45/48 Routing tree calculation
• CPC Class Codes: H04L 45/484 using multiple routing trees
• CPC Class Codes: H04Q 3/66 Traffic distributors

Abstract

The communications network includes a plurality of interconnected nodes and communication links between nodes. Computing apparatus in provided for determining a shortest path from a starting node to a destination node. The computing apparatus is adapted so that each node forms a routing tree having nodes with indentities, branches with weights, and a distinguished node called a root. The routing tree is the estimated shortest path to all of the nodes and each node communicates its routing tree to each adjacent node. Upon receipt of a routing tree by a reference node from an adjacent node, the reference node stores the routing tree and produces a large tree having roots and branches by placing the reference node as the root of the large tree and creating branches from the reference node to the roots of the routing trees of the adjacent nodes. The lengths of the branches are equal to the lengths of the links from the reference node to the adjacent nodes. A breadth first search of the large tree is performed to determine a connected subset of the large tree where each node identity appears only once. The connected subset forms the new routing tree for the reference node. If the new routing tree differs from the previous routing tree, the new routing tree is broadcast to all adjacent nodes and the procedure is repeated until no new tree differs from a previous tree, thereby defining a final routing tree. The final routing tree includes the shortest path from the reference node to all connected nodes.

Claims

1. In a communications network in which a plurality of nodes having unique identities transmit messages over links that have lengths between the nodes, a machine implemented method for sending massages from a first node to a destination node over a shortest path from the first node to the destination node, comprising the steps of:

forming a first routing tree for said first node that represents an estimated shortest path from said first node to other nodes and that includes all nodes that are connected by a link to said first node, one node in said first routing tree serving as a root of said first routing tree,

sending, by said first node, an identical tree to all said nodes that are connected by a link to said first node, said identical tree comprising at least a portion of said first routing tree;

receiving, by said first node, respective routing trees transmitted by said nodes that are connected by a link to said first node; and

storing, by said first node, the received routing trees,

forming a new routing tree for said first node using said received routing trees, said new routing tree including a group of said nodes one of which is said destination node,

comparing said new routing tree to a previous routing tree at said first node and, if said trees are different, determining a subsequent new routing tree that is not different from said previous routing tree, whereby said subsequent new routing tree defines the shortest paths from said first node to all of said nodes in said group, and

transmitting messages from said first node to said destination node over the shortest path for said destination node defined by said new routing tree.

2. The method of claim 1 wherein said step of forming said new routing tree comprises

forming a large tree by placing said first node as the root of said large tree and creating branches that have lengths from said first node to roots of the routing trees of said nodes that are connected by a link to said first node, the lengths of said branches equaling the lengths of the links from said first node to said nodes, and

determining said new routing tree based on said large tree.

3. The method of claim 2 wherein said step of determining said new routing tree comprises

finding a largest connected subset of said large tree in which each node appears only once, said subset being said new routing tree.

4. The method of claim 3 wherein said step of finding the largest connected subset includes performing a breadth first search of the large tree.

5. The method of claim 4 wherein said step of determining a subsequent new routing tree comprises broadcasting said new routing tree to all said nodes that are connected by a link to said first node and repeating said breadth first search, comparing, and broadcast steps until no new routing tree differs from a previous routing tree.

6. The method of claim 1 further comprising storing said subsequent new routing tree.

7. The method of claim 5 wherein said breadth first search, comparing, and broadcast steps are repeated at predetermined intervals or whenever there is a change in the lengths of the links in the network.

8. The method of claim 1 further comprising setting the length of a link to infinity upon a failure of said link.

9. The method of claim 1 wherein the lengths of the links are direction dependent.

10. The method of claim 5 wherein said step of determining a subsequent new routing tree comprises broadcasting only the differences between the new routing tree and a previous routing tree to all nodes that are connected by a link to said first node and repeating said breadth first search, comparing, and broadcast steps until no new routing tree differs from a previous routing tree.

11. The method of claim 1 comprising performing said steps of sending the first routing tree, receiving the respective routing trees from said nodes that are connected by a link to said first node, and forming said new routing tree whenever a change occurs in one or more of the links in said network.

12. The method of claim 1 comprising performing said steps of sending the first routing tree, receiving the respective routing trees from said nodes that are connected by a link to said first node, and forming said new routing tree in response to receipt of a routing tree from another node.

13. The method of claim 1 comprising performing said steps of sending the first routing tree, receiving the respective routing trees from said nodes that are connected by a link to said first node, and forming said new routing tree at predetermined time intervals.

14. The method of claim 13 wherein the predetermined time interval for said first node is different than that for another node in said network.

15. The method of claim 1 wherein said step of determining said subsequent new routing tree includes repeating at least some of said steps at least once.