Method of routing in an asynchronous transfer mode network

• US 5,940,396 A
• Filed: 08/21/1996
• Issued: 08/17/1999
• Est. Priority Date: 08/21/1996
• Status: Expired due to Term

• Current Assignee: Palo Alto Networks Incorporated
• Original Assignee: 3COM Limited (HP Inc.)
• Inventors: Rochberger, Haim
• Primary Examiner(s): Pham, Chi H.
• Assistant Examiner(s): NGUYEN, STEVEN H D
• Application Number:
  US08/697,220
• Time in Patent Office: 1,091 Days
• Field of Search: 370/400, 370/401, 370/406, 370/408, 370/409, 370/389, 370/392, 370/395, 370/396, 370/397, 370/399, 370/256, 370/218, 395/200.64, 395/200.68, 395/675
• US Class Current: 370/408
• CPC Class Codes: H04L 2012/5621 Virtual private network [VPN]; Private-network - network-interface (P-NNI)
• CPC Class Codes: H04Q 11/0478 Provisions for broadband connections

Abstract

A novel method of routing and performing autoconfiguration in an ATM network is disclosed. The method simplifies the configuration and routing for ATM networks having a relatively large number of nodes. Networks are constructed in hierarchical fashion in the form of branches and trees and assigned network address prefixes in accordance with their location in the network. Network nodes periodically exchange identification information permitting both switches on either side of a link to be aware of who they are connected to. Each node registers a network address and its associated significant length for each of its neighbors on each of its links. A node performs routing by comparing the destination address against each of its registered addresses for all its links. The routing method takes advantage of the network address prefix to ensure that the routing proceeds in the correct direction towards the destination and does not enter a tree or a branch that does not contain the destination. In addition, each node performs load balancing at each point in the routing process. A node can generate crankback messages if the routing leads to a dead end.

Claims

1. A method of routing in an Asynchronous Transfer Mode (ATM) network, said network including a plurality of nodes, each said node having one or more ports and possibly connected to one or more users through a first type link, said nodes connected to each other through a second type link, said network including a source node connected to a source user and a destination node connected to a destination user having a destination address, said source user generating a SETUP message containing said destination address, each node having a network address comprising a network prefix and a significant length, said method comprising the steps of:

constructing said network in hierarchical fashion out of one or more trees, each said tree having a root such that said trees are connected in a mesh at their roots;

exchanging identification messages between said nodes across each of said links on each node (termed the current node) in the routing path;

making a first determination of whether said destination address matches the network address of a user connected to said current node through said first type link;

outputting said SETUP message to a port in accordance with said first determination if said first determination is true;

making a second determination of whether said destination address fully matches the network address of a node connected to said current node through said second type link;

outputting said SETUP message to a port in accordance with said second determination if said second determination is true;

making a third determination of whether said destination address partially matches the network address of a node connected to said current node through said second type link;

outputting said SETUP message to a port in accordance with said third determination if said third determination is true; and

outputting said SETUP message onto a default port.

2. The method according to claim 1, wherein said step of constructing comprises the steps of:

arranging said plurality of nodes so as to form one or more trees, each said tree having a root and one or more nodes coupled to said root;

connecting said trees together at their roots such that said roots form at least a partial mesh; and

assigning each said node a network address, assigning said network addresses in hierarchical fashion such that nodes further away from said root are assigned longer network prefixes and network nodes within the same hierarchical level have equal significant lengths.

3. The method according to claim 1, wherein said step of exchanging comprises the steps of:

each said node sending an identification message out on ports that are connected to other nodes, said identification message comprising a network prefix and a significant length; and

each node receiving said identification message, registering said network prefix for the port it was received on.

4. The method according to claim 1, wherein said step of making a first determination comprises comparing the full network address against the network addresses of each user connected to said current node.

5. The method according to claim 1, wherein said step of making a second determination comprises choosing a node coupled to said current node whose network address prefix, up to its significant length, is the longest address prefix that completely matches said destination address prefix.

6. The method according to claim 1, wherein said step of making a third determination comprises choosing a node coupled to said current node whose network address prefix, up to its significant length, partially matches said destination address prefix, the match chosen from several partial matches is the match with the shortest significant length.

7. The method according to claim 1, wherein said step of outputting said SETUP message onto a default port comprises choosing a node coupled to said current node having a network address prefix with the shortest significant length.

8. The method according to claim 7, wherein the significant length of the network address prefix of said chosen node must be smaller than or equal to the significant length of the network address prefix of said current node.

9. The method according to claim 1, further comprising:

making a forth determination of whether said destination address prefix matches the address prefix of said current node; and

outputting a RELEASE message to the port said SETUP message was received on.

10. The method according to claim 1, further comprising the steps of:

maintaining a hop count in said SETUP message;

verifying, at each node in said routing path, that said hop count has not exceeded a predetermined maximum;

incrementing a hop count field within said SETUP message before forwarding said message to the next node on said routing path.

11. The method according to claim 1, further comprising the step of balancing the load across a plurality of equally matching nodes.

12. The method according to claim 1, further comprising the step of balancing the load across a plurality of equally matching nodes using a round robin technique.

13. The method according to claim 1, further comprising the step of performing crankback operation in response to finding that a route to the destination does not exist on the routing path.

14. A method of routing in an Asynchronous Transfer Mode (,ATM) network, said network including a plurality of nodes, said nodes connected to each other by one more links, said network including a source node connected to a source user and a destination node connected to a destination user, said source and said destination user connected to said source node and said destination node, respectively, each node having a network address comprising a network prefix and a significant length, said method comprising the steps of:

on each node, termed the current node, in the routing path;

making a first determination of whether said destination address matches the network address of a user connected to said current node through said first type link;

outputting said SETUP message to a port in accordance with said first determination if said first determination is true;

making a second determination of whether said destination address fully matches the network address of a node connected to said current node through said second type link;

outputting said SETUP message to a port in accordance with said second determination if said second determination is true;

making a third determination of whether said destination address partially matches the network address of a node connected to said current node through said second type link;

outputting said SETUP message to a port in accordance with said third determination if said third determination is true; and

outputting said SETUP message onto a default port.

15. The method according to claim 14, further comprising the steps of:

maintaining a hop count in said SETUP message;

verifying, at each node in said routing path, that said hop count has not exceeded a predetermined maximum; and

incrementing a hop count field within said SETUP message before forwarding said message to the next node on said routing path.

16. The method according to claim 14, further comprising the step of balancing the load across a plurality of equally matching nodes.

17. The method according to claim 14, further comprising the step of balancing the load across a plurality of equally matching nodes using a round robin technique.

18. The method according to claim 14, further comprising the step of performing a crankback operation in response to finding that a route to the destination does not exist on the routing path.