Method and apparatus for determining alternate routes in a network using a connection-oriented protocol

• US 5,953,312 A
• Filed: 09/13/1996
• Issued: 09/14/1999
• Est. Priority Date: 09/13/1996
• Status: Expired due to Term

• Current Assignee: RPX Clearinghouse LLC (RPX Corporation)
• Original Assignee: Bay Networks, Inc. (Nortel Networks Corporation)
• Inventors: Burch, Gregory A., Shieh, Shu Ching, Goransson, Paul N., Crawley, Eric S.
• Primary Examiner(s): TON, DANG T
• Application Number:
  US08/710,267
• Time in Patent Office: 1,096 Days
• Field of Search: 370/216, 370/217, 370/218, 370/219, 370/220, 370/222, 370/223, 370/224, 370/227, 370/228, 370/395, 370/289, 370/230, 370/231, 370/235, 370/233, 370/234, 370/237, 370/351 , 370/352, 370/353, 370/389, 370/468, 370/471, 370/431, 370/444, 370/439, 370/408, 370/407, 370/406, 370/455, 370/462, 395/181.01, 379/221, 340/827, 340/825.03
• US Class Current: 370/218
• CPC Class Codes: H04L 45/08 Learning-based routing, e.g. using neural networks or artificial intelligence

Abstract

A system for selecting an alternate route in a network using a connection-oriented protocol. The system is implemented in response to inadequate resources to a normal next hop node for a requested connection. The system may also be implemented if the normal next hop node is not capable of supporting the requested data flow. An alternate next hop node is identified having adequate resources for the requested connection. The connection request is then sent to the alternate next hop node. A refusal message is generated if the connection request sent to the alternate next hop node fails. The identification of alternate next hop nodes having adequate resources is performed on a limited basis.

Claims

1. A method for selecting an alternate route for a data flow in a network using a connection-oriented protocol, said method responsive to a connection request, said method comprising the steps of:

identifying an alternate next hop node in said network having adequate resources and capable of accepting said data flow;

sending said connection request to said alternate next hop node; and

generating a refusal message if said connection request to said alternate next hop node fails.

2. The method of claim 1 wherein the step of identifying an alternate next hop node is performed only once.

3. The method of claim 1 wherein the step of identifying an alternate next hop node includes identifying a limited number of alternate next hop nodes.

4. The method of claim 1 wherein said method is implemented when a normal next hop node has inadequate available resources.

5. The method of claim 1 wherein said method is implemented when a normal next hop node is incapable of accepting said data flow.

6. The method of claim 1 wherein said network is an asynchronous transfer mode (ATM) network.

7. The method of claim 1 wherein said network is a Frame Relay network.

8. The method of claim 1 wherein said network utilizes a switching system product to provide branch exchanges in communication networks.

9. The method of claim 1 wherein said network utilizes a transmission system product to provide interconnections between networks and network subscribers.

10. The method of claim 1 wherein the step of identifying an alternate next hop node includes selecting a highest priority node from a neighbor table.

11. A method for routing data in a network using a connection-oriented protocol, said method comprising the steps of:

receiving a connection request from an ingress node;

sending said connection request to a normal next hop node if said normal next hop node has adequate resources and said normal next hop node is capable of accepting said requested connection; and

performing an alternate route exploration if said normal next hop node lacks adequate resources for the requested data flow or is incapable of accepting said requested connection.

12. The method of claim 11 wherein said normal next hop node is determined using a lookup table.

13. The method of claim 11 wherein the step of performing an alternate route exploration is performed only once.

14. The method of claim 11 wherein the step of performing an alternate route exploration includes identifying a limited number of alternate next hop nodes.

15. The method of claim 11 wherein said network is an asynchronous transfer mode (ATM) network.

16. The method of claim 11 wherein said network is a Frame Relay network.

17. The method of claim 11 wherein said network utilizes a switching system product to provide branch exchanges in communication networks.

18. The method of claim 11 wherein said network utilizes a transmission system product to provide interconnections between networks and network subscribers.

19. The method of claim 11 wherein the step of performing an alternate route exploration includes:

identifying an alternate next hop node having adequate resources;

sending said connection request to said alternate next hop node; and

generating a refusal message if said connection request sent to said alternate next hop node fails.

20. The method of claim 11 wherein the step of performing an alternate route exploration includes selecting a highest priority node from a neighbor table.

21. An apparatus for routing data in a network using a connection-oriented protocol, comprising:

a receiving mechanism adapted to receive a connection request from an ingress node;

a sending mechanism coupled to said receiving mechanism and adapted to send said connection request to a normal next hop node if said normal next hop node has adequate resources and said normal next hop node is capable of accepting said requested connection; and

an alternate route exploration mechanism coupled to said sending mechanism and configured to perform an alternate route exploration if said normal next hop node lacks adequate resources for the requested data flow or is incapable of accepting said requested connection.

22. The apparatus of claim 21 wherein said sending mechanism determines said normal next hop node using a lookup table coupled to said sending mechanism.

23. The apparatus of claim 21 wherein said network is an asynchronous transfer mode (ATM) network.

24. The apparatus of claim 21 wherein said alternate route exploration mechanism includes a neighbor table identifying neighboring nodes.

25. The apparatus of claim 21 wherein the apparatus comprises a switching system product to provide branch exchanges in communication networks.

26. The apparatus of claim 21 wherein the apparatus comprises a transmission system product to provide interconnections between networks and network subscribers.

27. An apparatus for selecting an alternate route for a data flow in a network using a connection-oriented protocol, said apparatus responsive to a connection request, comprising:

means for identifying an alternate next hop node in said network having adequate resources and capable of accepting said data flow;

means for sending said connection request to said alternate next hop node; and

means for generating a refusal message if said connection request to said alternate next hop node fails.

28. The apparatus of claim 27 wherein said network is an asynchronous transfer mode (ATM) network.

29. The apparatus of claim 27 wherein said means for identifying an alternate next hop node includes a neighbor table containing neighboring node information.