Utilizing bandwidth in ring network using path cost and protection techniques

• US 7,957,324 B2
• Filed: 11/25/2008
• Issued: 06/07/2011
• Est. Priority Date: 03/03/2000
• Status: Active Grant

• Current Assignee: ADTRAN Incorporated (ADTRAN Holdings, Inc.)
• Original Assignee: ADTRAN Incorporated (ADTRAN Holdings, Inc.)
• Inventors: Fan, Jason C., Bannai, Vinay K., Jogalekar, Prasad P.
• Primary Examiner(s): Kumar; Pankaj
• Assistant Examiner(s): Duong; Duc T
• Application Number:
  US12/323,144
• Publication Number:
  US 20090141656A1
• Time in Patent Office: 924 Days
• Field of Search: 370254-256, 370/400, 370/401, 709220-224
• US Class Current: 370/254
• CPC Class Codes: H04L 2101/622 Layer-2 addresses, e.g. medium access control [MAC] addresses
• CPC Class Codes: H04L 2101/672 Short addresses
• CPC Class Codes: H04L 45/02 Topology update or discovery
• CPC Class Codes: H04L 45/021 Ensuring consistency of routing table updates, e.g. by using epoch numbers
• CPC Class Codes: H04L 61/00 Network arrangements, protocols or services for addressing or naming
• CPC Class Codes: H04L 61/2596 Translation of addresses of the same type other than IP, e.g. translation from MAC to MAC addresses
• CPC Class Codes: H04L 61/35 involving non-standard use of addresses for implementing network functionalities, e.g. coding subscription information within the address or functional addressing, i.e. assigning an address to a function

Abstract

The disclosed network includes two rings, wherein a first ring transmits data in a clockwise direction, and the other ring transmits data in a counterclockwise direction. The traffic is removed from the ring by the destination node. During normal operations (i.e., all spans operational), data between nodes can flow on either ring. Thus, both rings are fully utilized during normal operations. The nodes periodically test the bit error rate of the links (or the error rate is constantly calculated) to detect a fault in one of the links. The detection of such a fault sends a broadcast signal to all nodes to reconfigure a routing table within the node so as to identify the optimum routing of source traffic to the destination node after the fault.

Claims

1. A method comprising:

routing data on a data path between nodes of a network, the network including a first ring having first links transmitting data in a first direction around the first ring and including a second ring having second links transmitting data in a second direction around the second ring opposite to the first direction, wherein the data path is provided on the first ring or on the second ring to follow a first lowest-cost path from a source node to a destination node;

in response to detecting a change in at least one link in the first lowest-cost path, determining a second different lowest-cost path on the first ring or on the second ring from the source node to the destination node, the second lowest-cost path having a lower transmission cost than the first lowest-cost path after the change in the at least one link; and

re-routing the data path to the second lowest-cost path.

2. The method of claim 1 further comprising removing data packets from the data path by the destination node to enable increased ring transmission capacity.

3. The method of claim 1 wherein the first lowest-cost data path is provided in only one direction on the first ring or in only one direction on the second ring, and wherein the second lowest-cost data path is provided in only one direction on the first ring or in only one direction on the second ring.

4. The method of claim 1 wherein both of the first and second rings are fully utilized during normal operation without a fault in the network, thereby reducing extra bandwidth reservation for network fault protection.

5. The method of claim 1 wherein the second lowest-cost path is determined based on at least one of:

the number of hops from the source node to the destination node, a cumulative bit error rate from the source node to the destination node, and a level of traffic congestion on the network.

6. The method of claim 1 wherein determining the second lowest-cost path includes determining a direction that data is to be output from the source node to reach the destination node.

7. The method of claim 1 wherein determining the second lowest-cost path includes using at least one table specifying a cost for each link in the network and in each direction along the link, wherein a total cost is determined by adding together a cost of each of the links between the source node and destination node.

8. The method of claim 7 wherein the at least one table stores a value of highest cost reported since the last time the value was cleared for each link in the network, wherein the highest cost is included in a determination of the second lowest-cost path.

9. The method of claim 1 further comprising classifying traffic into a plurality of classes comprising a protected class and an unprotected class, wherein traffic of the unprotected class is dropped or delayed as necessary to allow traffic of the protected class to be transmitted on the second lowest-cost path.

10. The method of claim 1 wherein the change in the network is detected by periodically testing a bit error rate of links between nodes to detect a fault in one of the links, and sending a broadcast signal to all nodes to reconfigure a routing table within each node.

11. A communications network comprising:

communication links;

a plurality of nodes interconnected by the communication links, at least some of the nodes being connected by the links in a first ring having first links transmitting data in a first direction around the first ring and in a second ring having second links transmitting data in a second direction around the second ring opposite to the first direction; and

one or more processors that control the nodes for;

routing data on a data path provided on the first ring or on the second ring to follow a first lowest-cost path from a source node to a destination node;

in response to detecting a change in at least one link in the first lowest-cost path, determining a second different lowest-cost path on the first ring or on the second ring from the source node to the destination node, the second lowest-cost path having a lower transmission cost than the first lowest-cost path after the change in the at least one link; and

re-routing the data path to the second lowest-cost path.

12. The method of claim 11 further comprising removing data packets from the data path by the destination node to enable increased ring transmission capacity.

13. The method of claim 11 wherein the first lowest-cost data path is provided in only one direction on the first ring or in only one direction on the second ring, and wherein the second lowest-cost data path is provided in only one direction on the first ring or in only one direction on the second ring.

14. The method of claim 11 wherein both of the first and second rings are fully utilized during normal operation without a fault in the network, thereby reducing extra bandwidth reservation for network fault protection.

15. The method of claim 11 wherein the second lowest-cost path is determined based on at least one of:

the number of hops from the source node to the destination node, a cumulative bit error rate from the source node to the destination node, and a level of traffic congestion on the network.

16. The method of claim 11 further comprising classifying traffic into a plurality of classes comprising a protected class and an unprotected class, wherein traffic of the unprotected class is dropped or delayed as necessary to allow traffic of the protected class to be transmitted on the second lowest-cost path.

17. The method of claim 11 wherein the change in the network is detected by periodically testing a bit error rate of links between nodes to detect a fault in one of the links, and sending a broadcast signal to all nodes to reconfigure a routing table within each node.

18. A routing switch comprising:

one or more transceivers for being connected to associated links to one or more other routing switches in neighboring nodes, at least some of the nodes being connected in a first ring having first links transmitting data in a first direction around the first ring and in a second ring having second links transmitting data in a second direction around the second ring opposite to the first direction;

a switch fabric for routing information to and from said one or more transceivers; and

one or more processors that control the routing switch for;

routing data on a data path provided on the first ring or on the second ring to follow a first lowest-cost path from a source node to a destination node;

in response to detecting a change in at least one link in the first lowest-cost path, determining a second different lowest-cost path on the first ring or on the second ring from the source node to the destination node, the second lowest-cost path having a lower transmission cost than the first lowest-cost path after the change in the at least one link; and

re-routing the data path to the second lowest-cost path.

19. The method of claim 18 wherein the second lowest-cost path is determined based on at least one of:

the number of hops from the source node to the destination node, a cumulative bit error rate from the source node to the destination node, and a level of traffic congestion on the network.