Message routing in a computer network

• US 4,466,060 A
• Filed: 02/11/1982
• Issued: 08/14/1984
• Est. Priority Date: 02/11/1982
• Status: Expired due to Term

• Current Assignee: Bell Telephone Laboratories, Inc. (Nokia Corporation)
• Original Assignee: AT&T Bell Telephone Laboratories
• Inventors: Riddle, Guy G.
• Primary Examiner(s): NOT, DEFINED
• Application Number:
  US06/348,158
• Time in Patent Office: 915 Days
• Field of Search: 364/200 MS File
• US Class Current: 709/242
• CPC Class Codes: G06F 15/17381 Two dimensional, e.g. mesh, torus
• 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

Abstract

An adaptive distributed message routing algorithm that may be implemented in a computer program to control the routing of data messages in a packet message switching digital computer network. Network topology information is exchanged only between neighbor nodes in the form of minimum spanning trees, referred to as exclusionary trees. An exclusionary tree is formed by excluding the neighbor node and its links from the tree. From the set of exclusionary trees received a route table and transmitted exclusionary trees are constructed.

Claims

1. In a computer network comprising a plurality of nodes, the method of routing messages among said nodes comprising the following steps for each node:

receiving a first exclusionary tree from at least one neighbor node,

constructing at least a second exclusionary tree from said first exclusionary tree,

transmitting said second exclusionary tree to a neighbor node, and

routing messages according to the information in said first exclusionary tree.

3. The method as set forth in either claim 1 or claim 2 wherein said step of routing messages according to the information in said first exclusionary tree comprises the steps of

constructing an intermediate form of the information contained in said first exclusionary tree, and

routing messages according to the information in said intermediate form.

4. The method as set forth in claim 3 wherein said intermediate form comprises a routing graph.

5. The method as set forth in claim 3 wherein said intermediate form comprises a route table.

2. In a computer network comprising a plurality of nodes and a plurality of links, the method of routing messages over said links comprising the following steps for each node:

receiving a first exclusionary tree over at least one of said links,

constructing at least a second exclusionary tree from said first exclusionary tree,

transmitting said second exclusionary tree over one of said links, and

routing messages according to the information in said first exclusionary tree.

6. In a computer network comprising a plurality of nodes and a plurality of links, the method of routing messages among the nodes comprising the following steps for each node:

receiving a plurality of exclusionary trees, one over each of a plurality of links,

constructing from the received exclusionary trees a plurality of new exclusionary trees, one for each of the links,

transmitting said one of the new exclusionary trees over each of the links,

constructing a route table from the received exclusionary trees, and

routing messages according to the information in the route table.

7. The method as set forth in claim 6 further comprising the steps of:

retaining the received exclusionary trees,

receiving a new exclusionary tree over one of said plurality of links, and

replacing the retained exclusionary tree received from said one link with the new received exclusionary tree.

8. The method as set forth in claim 7 further comprising the steps of:

receiving a second new exclusionary tree over said one link before the above recited step of replacing is performed,

discarding first said new exclusionary tree, and

replacing the retained exclusionary tree received over said one link with said second new received exclusionary tree.

9. The method of claim 6 further comprising the steps of:

detecting the occurrence of a new link coming up, and

transmitting a hello message on said new link, said hello message including information identifying the transmitting node and including no information identifying the intended receiving node.

10. The method of claim 9 further comprising the steps of

retaining a copy of said transmitted exclusionary trees,

receiving a hello message over a link,

determining in response to said hello message if a copy of an exclusionary tree previously transmitted over said link has been retained and, if so,

transmitting over said link a copy of said previously transmitted exclusionary tree and, if not,

constructing from the received exclusionary trees above recited a new exclusionary tree for said link and

transmitting said new exclusionary tree over said link.

11. The method of claim 9 wherein said hello message further includes information identifying the version number of the routing method used by the transmitting node.

12. The method of claim 11 further comprising the steps of

receiving a hello message,

comparing the version number of the routing method used by the node transmitting said hello message with the version number of the routing method used by the receiving node, and if equal,

transmitting an exclusionary tree over the link, and if different,

modifying the routing method used by the receiving node.

13. The method in claim 12 wherein said step of modifying comprises the step of

transmitting an exclusionary tree over the link in a modified format.

14. The method in claim 12 wherein said step of modifying comprises the step of

refraining from transmitting an exclusionary tree over the link.

15. The method of claim 6 further comprising the steps of:

retaining the received exclusionary trees,

detecting the occurrence of a link going down, and

discarding the retained exclusionary tree received over said link.

16. The method as set forth in claim 6 wherein said route table contains multiple routes for a given destination node.

17. The method as set forth in claim 16 wherein said multiple routes are indicated by multiple node numbers.

18. The method as set forth in claim 16 wherein said multiple routes are indicated by multiple link numbers.

19. The method as set forth in claim 18 wherein said network includes multiple links interconnecting two nodes.

20. The method as set forth in claim 19 wherein said multiple links are treated independently and carry identical exclusionary tree information.

21. The method as set forth in claim 6 wherein said exclusionary trees include weight information indicating relative delays encountered on said links.

22. The method as set forth in claim 6 wherein said exclusionary trees are minimum spanning trees.