CA2402372A1 - Layer 3 routing in self-healing networks - Google Patents
Layer 3 routing in self-healing networks Download PDFInfo
- Publication number
- CA2402372A1 CA2402372A1 CA002402372A CA2402372A CA2402372A1 CA 2402372 A1 CA2402372 A1 CA 2402372A1 CA 002402372 A CA002402372 A CA 002402372A CA 2402372 A CA2402372 A CA 2402372A CA 2402372 A1 CA2402372 A1 CA 2402372A1
- Authority
- CA
- Canada
- Prior art keywords
- routing
- lower layer
- cost
- self
- network
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Abandoned
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/28—Routing or path finding of packets in data switching networks using route fault recovery
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/02—Topology update or discovery
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/12—Shortest path evaluation
- H04L45/123—Evaluation of link metrics
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L69/00—Network arrangements, protocols or services independent of the application payload and not provided for in the other groups of this subclass
- H04L69/30—Definitions, standards or architectural aspects of layered protocol stacks
- H04L69/32—Architecture of open systems interconnection [OSI] 7-layer type protocol stacks, e.g. the interfaces between the data link level and the physical level
- H04L69/322—Intralayer communication protocols among peer entities or protocol data unit [PDU] definitions
- H04L69/325—Intralayer communication protocols among peer entities or protocol data unit [PDU] definitions in the network layer [OSI layer 3], e.g. X.25
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L69/00—Network arrangements, protocols or services independent of the application payload and not provided for in the other groups of this subclass
- H04L69/30—Definitions, standards or architectural aspects of layered protocol stacks
- H04L69/32—Architecture of open systems interconnection [OSI] 7-layer type protocol stacks, e.g. the interfaces between the data link level and the physical level
Abstract
Upper layer 3 routing in conjunction with self-healing lower layer networks is more informed by the addition of reachability costs determined in the lower layer. Maintenance changes on the self-healing network are monitored. A change causes revision of reachability costs. The revised costs are communicated by lower layer logic to upper layer logic.
Description
Background of the Invention The present invention relates to layer 3 routing in conjunction with operation over self healing networks. A self-healing network as defined herein is a lower layer routing protocol which can hide a broken link in the network from the upper layers, routing the communication without interruption.
When used in conjunction with conventional networks, a layer 3 routing entity tends to determine the least costly path between any two layer 3 routing entities in the network according to a routing protocol, such as RIP, OSPF (RFC 2328). Layer 3 routing entities are connected to one another by a link. There are many examples of links, but a frame relay DLCI, ATM VCC, Ethernet LAN are but a few. Layer 3 routing entities maintain knowledge of their immediate neighbors to whom they are linked. Point-to-point links (such as a frame relay DLCI) will always set up routing adjacencies. While broadcast links (such as Ethernet) may or may not set up routing adjacencies, they will always set up neighbor adjacencies. (Neighbors are a subset of routing adjacencies.) When a point-to-point link fails, the routing entities readjust their adjacency lists.
Routing adjacencies to entities that are not neighbors rnay need to be recomputed to get around the failed link. When the link is reestablished, the routing entities must perform a complex sequence of handshaking to set up routing adjacency again. This process is compute and bandwidth intensive.
Self healing networks such as SONET rings hide most of the link failures from the routing entities. This is performed, in the case of SONET rings, by sending the traffic between the two routing entities around the ring in the opposite direction.
Activity between the routing entities is thereby maintained and a broken link is not seen. In particular, a link flap in which a link is repeatedly opened and closed is hidden from the upper layer routing logic. The costly recomputation and resynchronization of the layer 3 routing entities is thereby avoided. However, this may lead to inefficient transport of data because the broken link is hidden from the layer 3 router. A break in the SONET ring between two routing entities that are relatively close will result in data traffic between the two entities being sent around the long side of the ring. If those two entities were joined by a second route, it may have been possible to redirect traffic through the second route instead of taking the long path around the first SONET ring. However, the layer 3 muter SUBSTITUTE SHEET (RULE 26) is unaware of the break in the SONET ring and takes the long pain arouna the tirst ring instead of the shorter path on the second route.
Summary of the Invention In accordance with embodiments of the present invention, reachability costs are determined by a self-healing lower layer network and communicated to upper layer routing logic. Maintenance changes in the self healing network are monitored.
Thus, a break in a link is recognized. When a maintenance change occurs, reachability costs are revised. The reachability costs provide a relative measure of the burden in getting from one point to another on the self-healing network. The revised cost data is communicated to the upper layer logic. In an embodiment of the invention, reachability costs can be a measure of the number of routers which are traversed from one point to another through the active portions of the ring. Program code for performing the method of an embodiment of the invention may be incorporated into add drop multiplexor functionality for use on a self-healing network.
A self healing lower layer network of an embodiment of the invention connects a plurality of routers in a ring configuration. Reachability costs are determined by messages sent over the self healing lower layer network that contain an originator identifier and a node counter data field. The node counter date field is changed by one increment at each muter through which the message passes. By reading the originator identifier and node counter data field at each muter, each router learns the number of routers between the originator and itself. This number is used to determine the reachability cost.
The cost is recorded. A least cost reachability cost for a route is communicated by lower layer logic to upper layer logic. A maintenance change due to a link failure may result in revising the least cost reachability cost by replacing a cost for routing in one direction about the ring with a cost for running in an opposite direction about the ring with a cost for running in an opposite direction about the ring.
In accordance with the method of embodiments of the invention, lower overall network utilization can be achieved. Other objects and advantages of the invention will become apparent during the following description of the presently preferred embodiments of the invention taken in conjunction with the drawings.
When used in conjunction with conventional networks, a layer 3 routing entity tends to determine the least costly path between any two layer 3 routing entities in the network according to a routing protocol, such as RIP, OSPF (RFC 2328). Layer 3 routing entities are connected to one another by a link. There are many examples of links, but a frame relay DLCI, ATM VCC, Ethernet LAN are but a few. Layer 3 routing entities maintain knowledge of their immediate neighbors to whom they are linked. Point-to-point links (such as a frame relay DLCI) will always set up routing adjacencies. While broadcast links (such as Ethernet) may or may not set up routing adjacencies, they will always set up neighbor adjacencies. (Neighbors are a subset of routing adjacencies.) When a point-to-point link fails, the routing entities readjust their adjacency lists.
Routing adjacencies to entities that are not neighbors rnay need to be recomputed to get around the failed link. When the link is reestablished, the routing entities must perform a complex sequence of handshaking to set up routing adjacency again. This process is compute and bandwidth intensive.
Self healing networks such as SONET rings hide most of the link failures from the routing entities. This is performed, in the case of SONET rings, by sending the traffic between the two routing entities around the ring in the opposite direction.
Activity between the routing entities is thereby maintained and a broken link is not seen. In particular, a link flap in which a link is repeatedly opened and closed is hidden from the upper layer routing logic. The costly recomputation and resynchronization of the layer 3 routing entities is thereby avoided. However, this may lead to inefficient transport of data because the broken link is hidden from the layer 3 router. A break in the SONET ring between two routing entities that are relatively close will result in data traffic between the two entities being sent around the long side of the ring. If those two entities were joined by a second route, it may have been possible to redirect traffic through the second route instead of taking the long path around the first SONET ring. However, the layer 3 muter SUBSTITUTE SHEET (RULE 26) is unaware of the break in the SONET ring and takes the long pain arouna the tirst ring instead of the shorter path on the second route.
Summary of the Invention In accordance with embodiments of the present invention, reachability costs are determined by a self-healing lower layer network and communicated to upper layer routing logic. Maintenance changes in the self healing network are monitored.
Thus, a break in a link is recognized. When a maintenance change occurs, reachability costs are revised. The reachability costs provide a relative measure of the burden in getting from one point to another on the self-healing network. The revised cost data is communicated to the upper layer logic. In an embodiment of the invention, reachability costs can be a measure of the number of routers which are traversed from one point to another through the active portions of the ring. Program code for performing the method of an embodiment of the invention may be incorporated into add drop multiplexor functionality for use on a self-healing network.
A self healing lower layer network of an embodiment of the invention connects a plurality of routers in a ring configuration. Reachability costs are determined by messages sent over the self healing lower layer network that contain an originator identifier and a node counter data field. The node counter date field is changed by one increment at each muter through which the message passes. By reading the originator identifier and node counter data field at each muter, each router learns the number of routers between the originator and itself. This number is used to determine the reachability cost.
The cost is recorded. A least cost reachability cost for a route is communicated by lower layer logic to upper layer logic. A maintenance change due to a link failure may result in revising the least cost reachability cost by replacing a cost for routing in one direction about the ring with a cost for running in an opposite direction about the ring with a cost for running in an opposite direction about the ring.
In accordance with the method of embodiments of the invention, lower overall network utilization can be achieved. Other objects and advantages of the invention will become apparent during the following description of the presently preferred embodiments of the invention taken in conjunction with the drawings.
Brief Description of the Drawings FIG. 1 is a schematic block diagram of a routing network which may take advantage of the present invention.
FIG. 2 is a flow chart of a method for implementing an embodiment of the present invention.
FIG. 3 is a flow chart of a method for dynamically maintaining reachability costs in accordance with an embodiment of the present invention.
Detailed Description of the Preferred Embodiments A network as shown in FIG. 1 is comprised of a number of point-to-point links.
A
link connects two layer 3 routing entities. Layer 3 routing and above are considered herein as upper layer routing. Each layer 3 routing entity includes a router 10. The router is interfaced with the data network through lower layer routing logic. For SONET rings, the lower layer logic is found in an add drop multiplexor ("ADM") 12. For Multi Protocol Label Switching (MPLS), the logic is included in a label edge router.
For any self healing lower layer network, the lower layer routing entity may be included in a box that also contains the associated router. Alternatively, a separate add drop multiplexor box or label edge router may be in communication over a communication link with a separate router box.
A self healing lower layer network is shown including ADM's A, B, D, E, G, H, I, J, K, L in FIG. 1. Self healing networks operate under any of a number of layer 3 routing protocols, such as OSPF, RFC 2328 or RIP. The lower layer protocols of typical self-healing networks include SONET rings, Virtual Network Switching ("VNS") and a variety of types of Multi-Protocol Label Switching (MPLS). With conventional self healing networks like VNS or SONET, all neighbors appear to be reachable at the same cost. In conventional networks, two layer 3 routers, Boston and Los Angeles, connected using VNS or SONET appear to have the same cost of communication as two other routers, New York and Philadelphia. This is grossly inaccurate because the cost of communication between Boston and Los Angeles is much greater than the cost between the much closer cities New York and Philadelphia. When a router has a choice of routes, this can lead to inefficient routing. Another impact on the efriciency of routing occurs when there is a link failure in a self healing network. Conventionally, the self healing network hides the fact that a link failure has occurred, curing the failure itself by rerouting data traffic. For example, if we assume that the ring of ADM's A, L, K, J, I, H, G, E, D, B
normally handles traffic in a counterclockwise direction, if there is a failure between L
and K, data from A intended for K will be rerouted clockwise about the ring.
This will result in a much longer data path. But in conventional systems, the router at A would be unaware of the increased reachability cost of getting from A to K as a result of the link failure. Where that muter has an alternate network available for getting to K, for example, A, O, N, M, K, the muter under conventional self-healing network technology would fail to recognize this alternate route as the more efficient route after the link failure.
In accordance with an embodiment of the invention, a process to determine and maintain reachability costs on a self-healing lower layer network may be implemented as program code in lower layer logic at a routing node. Referring now to FIG. 2, a method is illustrated for determining reachability costs in lower layer logic on a self-healing network. In accordance with the present invention, reachability costs can include any factors that are important to the network operator in selecting a preferred rate, including available bandwidth, physical distance, number of intermediate hops on the self-healing network, etc. A simple method of determining one type of reachability cost (i.e., physical distance) is to count the number of repeaters from one routing entity to the other along the self healing network. FIG. 2 provides an example of such a method. Discovery of a self healing lower layer network topology occurs by the lower layer logic in each routing node sending neighbor discovery messages onto the network. In a ring configuration, messages are sent out each of the opposite ports, referred to as the east and west ports for convenience herein. The discovery messages are sent on the lower layer network's maintenance channel. Once a routing node receives a neighbor discovery message, its lower layer logic then periodically broadcasts an "I am present" message in both directions. The message may be sent out every 500 ms. for example. The message includes a node counter field and an originator ID. At each routing node along the ring, the "I am present" message are read I8. Each node receiving the message changes the node counter field by one increment 20 and forwards the message to the next node 22. In accordance with a presently preferred embodiment, the "I am pICSCU~ ~IICSSa~e is originated with a node counter field set at 255 and each node, in turn, decrements the counter by one.
As the present messages are read, the receiving node learns the distance in terms of routing node count between it and the originator from the value of the node counter field. This information is used to give a reachability cost for the originator on the self healing lower layer network. The reachability cost is recorded 24 by the lower layer logic.
Two reachability costs are obtained on a ring network for each originator, one for east going messages and one for west going messages. The least cost of the two is communicated up to the upper layer logic for use in computing point-to-point links costs.
Conventional lower layer logic monitors the status of each link and causes traffic to be rerouted upon detection of a link failure. In accordance with embodiments of the present invention, reachability costs are dynamically maintained in response to the status of the links as shown in FIG. 3. The maintenance channel is monitored 28 to detect link failures. If there is a status change 30, the reachability costs are revised 32. If a routing node cannot be reached along the shorter portion of the ring, the least cost reachability cost becomes the cost for the longer portion of the ring. Thus, the least cost reachability cost is replaced by the cost for routing in an opposite direction about the ring. The revised least cost reachability cost is communicated to the upper layer logic 34. The self-healing lower layer network still behaves by hiding the fact of a link failure from the upper layer logic, but succeeds in educating the upper layer by revising the reachability costs. To avoid interference with data traffic between the router and ADM, the reachability costs may preferably be sent on an out-of band channel. The upper layer logic is then in a position to make a more efficient choice of routes for data traffic. In the case of FIG. 1, the router at ADM A when sending data to K will be informed of the increased cost that would show up between A and K when such a link failure occurs. The router may then determine that the more efficient network would be to send data from A to O, N, M, K.
This would advantageously reduce overall network utilization.
There are numerous factors that the upper layer logic may choose to take into account when determining relative costs of available routes from one routing node to another. In accordance with embodiments of the invention, a preferred route is selected in upper layer logic in view of calculations for each of the avaiianle routes wnerem routes over a self healing lower layer network are evaluated using reachability cost data obtained from lower layer logic. For example, the cost of a route can be calculated and a cost value assigned to the route fox layer 3 routing as follows:
Route cost = # of Hops (indicated by reachability cost)*Magic number+Sonet Interface preference In this calculation, the reachability cost for the lower layer logic is multiplied by a "magic number." The "magic number" would be a constant used by the system operator to weigh the relative importance of the number of hops on a Sonet ring as compared with cost data available for other available routes on other types of lower layer networks.
The Sonet Interface preference is a number also used to weigh the system's relative preference for one type of lower layer network over another. Calculation for available routes are compared and the preferred route is selected on the basis of the calculations.
Alternative embodiments of the invention may be implemented as a computer program product for use in lower layer logic on an add drop multiplexor label edge router or other data network interface. Such implementation may include a series of computer instructions fixed either on a tangible medium, such as a computer readable media (e.g., a diskette, CD-ROM, ROM, or fixed disk), or transmittable to a computer system via a modem or other interface device, such as a communications adapter connected to a network over a medium. The medium may be either a tangible medium (e.g., optical or analog communications lines) or a medium implemented with wireless techniques (e.g., microwave, infrared or other transmission techniques). The series of computer instructions embodies all or part of the functionality previously described herein with respect to the system. Those skilled in the art should appreciate that such computer instructions can be written in a number of programming languages for use with many computer architectures or operating systems. Furthermore, such instructions may be stored in any memory device, such as semiconductor, magnetic, optical or other memory devices, and may be transmitted using any communications technology, such as optical, infrared, microwave, or other transmission technologies. It is expected that such a computer program product may be distributed as a removable media with accompanying printed or electronic documentation (e.g., shrink wrapped software), preloaded with a computer system (e.g., on system ROM or fixed disk), or distnnutea rrom a server or electronic bulletin board over the network (e.g., the Internet or World Wide Web).
Of course, it should be understood that various changes and modifications to the preferred embodiments described above will be apparent to those skilled in the art. The factors used to determine a reachability cost may vary significantly from one system to another. The manner in which an upper layer logic uses the reachability costs to select a preferred route will also vary from one system to another. These and other variations can be made without departing from the spirit and scope of the invention and without diminishing its attendant advantages. It is, therefore, intended that such changes and modifications be covered by the following claims.
FIG. 2 is a flow chart of a method for implementing an embodiment of the present invention.
FIG. 3 is a flow chart of a method for dynamically maintaining reachability costs in accordance with an embodiment of the present invention.
Detailed Description of the Preferred Embodiments A network as shown in FIG. 1 is comprised of a number of point-to-point links.
A
link connects two layer 3 routing entities. Layer 3 routing and above are considered herein as upper layer routing. Each layer 3 routing entity includes a router 10. The router is interfaced with the data network through lower layer routing logic. For SONET rings, the lower layer logic is found in an add drop multiplexor ("ADM") 12. For Multi Protocol Label Switching (MPLS), the logic is included in a label edge router.
For any self healing lower layer network, the lower layer routing entity may be included in a box that also contains the associated router. Alternatively, a separate add drop multiplexor box or label edge router may be in communication over a communication link with a separate router box.
A self healing lower layer network is shown including ADM's A, B, D, E, G, H, I, J, K, L in FIG. 1. Self healing networks operate under any of a number of layer 3 routing protocols, such as OSPF, RFC 2328 or RIP. The lower layer protocols of typical self-healing networks include SONET rings, Virtual Network Switching ("VNS") and a variety of types of Multi-Protocol Label Switching (MPLS). With conventional self healing networks like VNS or SONET, all neighbors appear to be reachable at the same cost. In conventional networks, two layer 3 routers, Boston and Los Angeles, connected using VNS or SONET appear to have the same cost of communication as two other routers, New York and Philadelphia. This is grossly inaccurate because the cost of communication between Boston and Los Angeles is much greater than the cost between the much closer cities New York and Philadelphia. When a router has a choice of routes, this can lead to inefficient routing. Another impact on the efriciency of routing occurs when there is a link failure in a self healing network. Conventionally, the self healing network hides the fact that a link failure has occurred, curing the failure itself by rerouting data traffic. For example, if we assume that the ring of ADM's A, L, K, J, I, H, G, E, D, B
normally handles traffic in a counterclockwise direction, if there is a failure between L
and K, data from A intended for K will be rerouted clockwise about the ring.
This will result in a much longer data path. But in conventional systems, the router at A would be unaware of the increased reachability cost of getting from A to K as a result of the link failure. Where that muter has an alternate network available for getting to K, for example, A, O, N, M, K, the muter under conventional self-healing network technology would fail to recognize this alternate route as the more efficient route after the link failure.
In accordance with an embodiment of the invention, a process to determine and maintain reachability costs on a self-healing lower layer network may be implemented as program code in lower layer logic at a routing node. Referring now to FIG. 2, a method is illustrated for determining reachability costs in lower layer logic on a self-healing network. In accordance with the present invention, reachability costs can include any factors that are important to the network operator in selecting a preferred rate, including available bandwidth, physical distance, number of intermediate hops on the self-healing network, etc. A simple method of determining one type of reachability cost (i.e., physical distance) is to count the number of repeaters from one routing entity to the other along the self healing network. FIG. 2 provides an example of such a method. Discovery of a self healing lower layer network topology occurs by the lower layer logic in each routing node sending neighbor discovery messages onto the network. In a ring configuration, messages are sent out each of the opposite ports, referred to as the east and west ports for convenience herein. The discovery messages are sent on the lower layer network's maintenance channel. Once a routing node receives a neighbor discovery message, its lower layer logic then periodically broadcasts an "I am present" message in both directions. The message may be sent out every 500 ms. for example. The message includes a node counter field and an originator ID. At each routing node along the ring, the "I am present" message are read I8. Each node receiving the message changes the node counter field by one increment 20 and forwards the message to the next node 22. In accordance with a presently preferred embodiment, the "I am pICSCU~ ~IICSSa~e is originated with a node counter field set at 255 and each node, in turn, decrements the counter by one.
As the present messages are read, the receiving node learns the distance in terms of routing node count between it and the originator from the value of the node counter field. This information is used to give a reachability cost for the originator on the self healing lower layer network. The reachability cost is recorded 24 by the lower layer logic.
Two reachability costs are obtained on a ring network for each originator, one for east going messages and one for west going messages. The least cost of the two is communicated up to the upper layer logic for use in computing point-to-point links costs.
Conventional lower layer logic monitors the status of each link and causes traffic to be rerouted upon detection of a link failure. In accordance with embodiments of the present invention, reachability costs are dynamically maintained in response to the status of the links as shown in FIG. 3. The maintenance channel is monitored 28 to detect link failures. If there is a status change 30, the reachability costs are revised 32. If a routing node cannot be reached along the shorter portion of the ring, the least cost reachability cost becomes the cost for the longer portion of the ring. Thus, the least cost reachability cost is replaced by the cost for routing in an opposite direction about the ring. The revised least cost reachability cost is communicated to the upper layer logic 34. The self-healing lower layer network still behaves by hiding the fact of a link failure from the upper layer logic, but succeeds in educating the upper layer by revising the reachability costs. To avoid interference with data traffic between the router and ADM, the reachability costs may preferably be sent on an out-of band channel. The upper layer logic is then in a position to make a more efficient choice of routes for data traffic. In the case of FIG. 1, the router at ADM A when sending data to K will be informed of the increased cost that would show up between A and K when such a link failure occurs. The router may then determine that the more efficient network would be to send data from A to O, N, M, K.
This would advantageously reduce overall network utilization.
There are numerous factors that the upper layer logic may choose to take into account when determining relative costs of available routes from one routing node to another. In accordance with embodiments of the invention, a preferred route is selected in upper layer logic in view of calculations for each of the avaiianle routes wnerem routes over a self healing lower layer network are evaluated using reachability cost data obtained from lower layer logic. For example, the cost of a route can be calculated and a cost value assigned to the route fox layer 3 routing as follows:
Route cost = # of Hops (indicated by reachability cost)*Magic number+Sonet Interface preference In this calculation, the reachability cost for the lower layer logic is multiplied by a "magic number." The "magic number" would be a constant used by the system operator to weigh the relative importance of the number of hops on a Sonet ring as compared with cost data available for other available routes on other types of lower layer networks.
The Sonet Interface preference is a number also used to weigh the system's relative preference for one type of lower layer network over another. Calculation for available routes are compared and the preferred route is selected on the basis of the calculations.
Alternative embodiments of the invention may be implemented as a computer program product for use in lower layer logic on an add drop multiplexor label edge router or other data network interface. Such implementation may include a series of computer instructions fixed either on a tangible medium, such as a computer readable media (e.g., a diskette, CD-ROM, ROM, or fixed disk), or transmittable to a computer system via a modem or other interface device, such as a communications adapter connected to a network over a medium. The medium may be either a tangible medium (e.g., optical or analog communications lines) or a medium implemented with wireless techniques (e.g., microwave, infrared or other transmission techniques). The series of computer instructions embodies all or part of the functionality previously described herein with respect to the system. Those skilled in the art should appreciate that such computer instructions can be written in a number of programming languages for use with many computer architectures or operating systems. Furthermore, such instructions may be stored in any memory device, such as semiconductor, magnetic, optical or other memory devices, and may be transmitted using any communications technology, such as optical, infrared, microwave, or other transmission technologies. It is expected that such a computer program product may be distributed as a removable media with accompanying printed or electronic documentation (e.g., shrink wrapped software), preloaded with a computer system (e.g., on system ROM or fixed disk), or distnnutea rrom a server or electronic bulletin board over the network (e.g., the Internet or World Wide Web).
Of course, it should be understood that various changes and modifications to the preferred embodiments described above will be apparent to those skilled in the art. The factors used to determine a reachability cost may vary significantly from one system to another. The manner in which an upper layer logic uses the reachability costs to select a preferred route will also vary from one system to another. These and other variations can be made without departing from the spirit and scope of the invention and without diminishing its attendant advantages. It is, therefore, intended that such changes and modifications be covered by the following claims.
Claims (26)
1. A method for enhanced upper layer routing in connection with a self healing lower layer network comprising:
monitoring maintenance changes on the self healing lower layer network;
revising in lower layer logic a table of reachability costs for getting from one point to another on the self-healing network in response to a maintenance change;
and providing revised cost data to upper layer logic.
monitoring maintenance changes on the self healing lower layer network;
revising in lower layer logic a table of reachability costs for getting from one point to another on the self-healing network in response to a maintenance change;
and providing revised cost data to upper layer logic.
2. The method of claim 1 further comprising calculating, in the upper layer logic, a preferred route using cost data obtained from the lower layer logic.
3. The method of claim 1 wherein the self healing lower layer network is a ring configuration of routing nodes and wherein said act of revising comprises replacing a cost for routing in one direction about the ring with a cost for routing in an opposite direction about the ring.
4. The method of claim 1 wherein the maintenance change comprises a link failure.
5. A method for informed upper layer routing in connection with a self healing lower layer network comprising:
determining, in lower layer logic, reachability costs for getting from one routing node to other routing nodes on the self-healing network; and providing the reachability costs to upper layer logic.
determining, in lower layer logic, reachability costs for getting from one routing node to other routing nodes on the self-healing network; and providing the reachability costs to upper layer logic.
6. The method of claim 5 further comprising calculating, in the upper layer logic, a relative cost for a route on the self healing lower layer network using the reachability costs.
7. The method of claim 6 further comprising selecting a preferred route from one routing node to another by comparing the calculations of relative costs for a plurality of available routes.
8. The method of claim 6 wherein calculating in the upper layer logic comprises multiplying a reachability cost by a preference number.
9. The method of claim 5 wherein determining comprises transmitting a message on the self healing network from a first routing node to a second routing node, said message being changed at each node along the way to the second routing node to produce a reachability cost between the first router and the second routing node.
10. The method of claim 5 further comprising:
monitoring maintenance changes on the self healing lower layer network;
revising in lower layer logic the reachability cost of getting from one routing node to another on the self-healing network in response to a maintenance change;
and providing revised cost data to the upper layer logic.
monitoring maintenance changes on the self healing lower layer network;
revising in lower layer logic the reachability cost of getting from one routing node to another on the self-healing network in response to a maintenance change;
and providing revised cost data to the upper layer logic.
11. The method of claim 5 wherein the upper layer logic comprises layer 3 routing logic.
12. A computer program product for use in routing logic of a self healing lower layer network comprising:
program code for monitoring maintenance changes on the self healing lower layer network;
program code, responsive to a maintenance change, for revising reachability costs for getting from one point to other points on the self healing network; and program code for sending the revised reachability costs to upper layer logic.
program code for monitoring maintenance changes on the self healing lower layer network;
program code, responsive to a maintenance change, for revising reachability costs for getting from one point to other points on the self healing network; and program code for sending the revised reachability costs to upper layer logic.
13. The computer program product of claim 12 further comprising program code for determining reachability costs between one point and another on the self-healing network.
14. The computer program product of claim 13 wherein said program code for determining comprises reading a node count from a message sent from one node to the node on which said program code is running.
15. The computer program product of claim 12 wherein the self healing lower layer network is a ring configuration of routing nodes and wherein said program code for revising comprises program code for replacing a cost for routing in one direction about the ring with a cost for routing in an opposite direction about the ring.
16. An add drop multiplexor for use on a self-healing lower layer network comprising:
data storage for a plurality of reachability costs for getting from the add drop multiplexor to other points on the self healing lower layer network;
program code for monitoring maintenance changes on the self healing lower layer network;
program code, responsive to a maintenance change, for revising one or more of the reachability costs; and program code for sending the revised reachability costs to upper layer logic.
data storage for a plurality of reachability costs for getting from the add drop multiplexor to other points on the self healing lower layer network;
program code for monitoring maintenance changes on the self healing lower layer network;
program code, responsive to a maintenance change, for revising one or more of the reachability costs; and program code for sending the revised reachability costs to upper layer logic.
17. The add drop multiplexor of claim 16 further comprising program code for determining reachability costs between the add drop multiplexor and another on the self healing lower layer network.
18. The add drop multiplexor of claim 17 wherein said program code fox determining comprises reading a node count on a message received from another add drop multiplexor on the self healing lower layer network.
19. The add drop multiplexor of claim 16 wherein the self healing lower layer network is a ring configuration and wherein said program code for revising comprises program code for replacing a cost for routing in one direction about the ring with a cost for routing in an opposite direction about the ring.
20. On a self healing lower layer network connecting a plurality of routing nodes in a ring each having lower layer logic for routing over the self healing lower layer and upper layer logic, the method comprising:
sending a message over the self healing lower layer network with a node counter data field and an originator identifier;
changing the node counter data field by one increment at each routing node through which the message passes;
reading the node counter data field and originator identifier at each routing node;
recording a reachability cost determined by the node counter data field for the originator in the originator identifier; and communicating a least cost reachability cost for the originator from the lower layer logic of a routing node to the upper layer logic of the routing node.
sending a message over the self healing lower layer network with a node counter data field and an originator identifier;
changing the node counter data field by one increment at each routing node through which the message passes;
reading the node counter data field and originator identifier at each routing node;
recording a reachability cost determined by the node counter data field for the originator in the originator identifier; and communicating a least cost reachability cost for the originator from the lower layer logic of a routing node to the upper layer logic of the routing node.
21. The method of claim 20 further comprising monitoring maintenance changes on the self-healing lower layer network, revising the least cost reachability cost in response to a maintenance change, and communicating the revised least cost reachability cost to upper layer logic.
22. The method of claim 21 wherein revising comprises replacing a cost for routing in one direction about the ring with a cost for routing in an opposite direction about the ring.
23. A communication system including a plurality of routing nodes interconnected over a self-healing lower layer network, each routing node having lower layer logic and upper layer logic, said system comprising in at least one of said routing nodes:
program code for determining in lower layer logic reachability costs for getting to other routing nodes in said self healing lower layer network; and program code for communicating the reachability costs from the lower layer logic to the upper layer logic.
program code for determining in lower layer logic reachability costs for getting to other routing nodes in said self healing lower layer network; and program code for communicating the reachability costs from the lower layer logic to the upper layer logic.
24. The communication system of claim 23 wherein the lower layer logic in each of said routing nodes comprises means for sending a "present" message over the self healing lower layer network with a node counter data field and an originator identifier and means for changing the node counter data field of each received "present" message by one increment before passing the "present" message along the self healing lower layer network.
25. The communication system of claim 23 wherein the lower layer logic in at least one of said routing nodes comprises:
program code for monitoring link failures on the self healing lower layer network;
program code, responsive to a link failure, for revising reachability costs for getting to other routing nodes on the self-healing network; and program code for sending the revised reachability costs to upper layer logic.
program code for monitoring link failures on the self healing lower layer network;
program code, responsive to a link failure, for revising reachability costs for getting to other routing nodes on the self-healing network; and program code for sending the revised reachability costs to upper layer logic.
26. The communication system of claim 25 wherein the plurality of routing nodes are arranged in a ring configuration on the self healing lower layer network and wherein said program code for revising reachability costs comprises program code for replacing a cost for routing in one direction about the ring with a cost for routing in an opposite direction about the ring.
Applications Claiming Priority (3)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| US09/522,096 US6490244B1 (en) | 2000-03-09 | 2000-03-09 | Layer 3 routing in self-healing networks |
| US09/522,096 | 2000-03-09 | ||
| PCT/US2001/007419 WO2001067677A2 (en) | 2000-03-09 | 2001-03-08 | Layer 3 routing in self-healing networks |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CA2402372A1 true CA2402372A1 (en) | 2001-09-13 |
Family
ID=24079451
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CA002402372A Abandoned CA2402372A1 (en) | 2000-03-09 | 2001-03-08 | Layer 3 routing in self-healing networks |
Country Status (5)
| Country | Link |
|---|---|
| US (1) | US6490244B1 (en) |
| EP (1) | EP1264450A2 (en) |
| AU (1) | AU2001240113A1 (en) |
| CA (1) | CA2402372A1 (en) |
| WO (1) | WO2001067677A2 (en) |
Families Citing this family (17)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP3626616B2 (en) * | 1999-02-04 | 2005-03-09 | 日本電気株式会社 | Quality assurance type communication route notification method and router |
| US7545755B2 (en) * | 2000-03-03 | 2009-06-09 | Adtran Inc. | Routing switch detecting change in session identifier before reconfiguring routing table |
| US6898183B1 (en) * | 2000-03-14 | 2005-05-24 | Cisco Technology, Inc. | Method of determining a data link path in a managed network |
| US6781959B1 (en) | 2000-07-31 | 2004-08-24 | Cisco Technology, Inc. | Method and apparatus for determining troubleshooting information for completed calls in a telecommunications network |
| US20020167899A1 (en) * | 2001-05-11 | 2002-11-14 | Thompson Richard A. | System and method for the configuration, repair and protection of virtual ring networks |
| US7212490B1 (en) * | 2001-07-06 | 2007-05-01 | Cisco Technology, Inc. | Dynamic load balancing for dual ring topology networks |
| US7315903B1 (en) * | 2001-07-20 | 2008-01-01 | Palladia Systems, Inc. | Self-configuring server and server network |
| US20050237944A1 (en) * | 2002-04-26 | 2005-10-27 | Manfred Angermayr | Automatic route configuration for quasi-associated m3ua connections |
| JP3997847B2 (en) * | 2002-06-17 | 2007-10-24 | 日本電気株式会社 | Optimal route calculation method and optimum route calculation program |
| US20050097196A1 (en) * | 2003-10-03 | 2005-05-05 | Wronski Leszek D. | Network status messaging |
| IL158656A (en) * | 2003-10-29 | 2009-02-11 | Eci Telecom Ltd | Rerouting mpls traffic in ring networks |
| US20050190757A1 (en) * | 2004-02-27 | 2005-09-01 | Cisco Technology Inc. | Interworking between Ethernet and non-Ethernet customer sites for VPLS |
| CN100387017C (en) * | 2005-09-01 | 2008-05-07 | 西安交通大学 | High usable self-healing Logic box fault detecting and tolerating method for constituting multi-machine system |
| US9240927B2 (en) * | 2009-02-26 | 2016-01-19 | Qualcomm Incorporated | Methods and apparatus for enhanced overlay state maintenance |
| US8549175B2 (en) * | 2009-06-09 | 2013-10-01 | Qualcomm Incorporated | Methods and apparatus for adaptively scheduling a finger stabilization algorithm |
| US10545753B2 (en) * | 2015-04-21 | 2020-01-28 | Arista Networks, Inc. | System and method of updating a network element |
| US9893967B1 (en) * | 2015-05-14 | 2018-02-13 | Hrl Laboratories, Llc | Measuring network efficiency |
Family Cites Families (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US5444693A (en) | 1992-04-27 | 1995-08-22 | At&T Corp. | System for restoration of communications networks |
| US5262906A (en) | 1992-06-19 | 1993-11-16 | Alcatel Network Systems, Inc. | Message routing for SONET telecommunications maintenance network |
| US5546542A (en) | 1993-11-29 | 1996-08-13 | Bell Communications Research, Inc. | Method for efficiently determining the direction for routing a set of anticipated demands between selected nodes on a ring communication network |
| US5923646A (en) | 1996-08-30 | 1999-07-13 | Nynex Science & Technology | Method for designing or routing a self-healing ring in a communications network and a self-healing ring routed in accordance with the method |
| US6295275B1 (en) * | 1998-08-19 | 2001-09-25 | Mci Communications Corporation | Dynamic route generation for real-time network restoration using pre-plan route generation methodology |
-
2000
- 2000-03-09 US US09/522,096 patent/US6490244B1/en not_active Expired - Lifetime
-
2001
- 2001-03-08 EP EP01914761A patent/EP1264450A2/en not_active Withdrawn
- 2001-03-08 AU AU2001240113A patent/AU2001240113A1/en not_active Abandoned
- 2001-03-08 CA CA002402372A patent/CA2402372A1/en not_active Abandoned
- 2001-03-08 WO PCT/US2001/007419 patent/WO2001067677A2/en not_active Application Discontinuation
Also Published As
| Publication number | Publication date |
|---|---|
| US6490244B1 (en) | 2002-12-03 |
| EP1264450A2 (en) | 2002-12-11 |
| WO2001067677A3 (en) | 2002-02-14 |
| AU2001240113A1 (en) | 2001-09-17 |
| WO2001067677A2 (en) | 2001-09-13 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US6490244B1 (en) | Layer 3 routing in self-healing networks | |
| US6721269B2 (en) | Apparatus and method for internet protocol flow ring protection switching | |
| Saito et al. | Traffic engineering using multiple multipoint-to-point LSPs | |
| Kodian et al. | Failure-independent path-protecting p-cycles: Efficient and simple fully preconnected optical-path protection | |
| US8787150B2 (en) | Resiliency schemes in communications networks | |
| EP2151959B1 (en) | Path calculation device for calculating and controlling paths in a network | |
| EP0452479B1 (en) | Automatic fault recovery in a packet network | |
| US9692687B2 (en) | Method and apparatus for rapid rerouting of LDP packets | |
| US8456982B2 (en) | System and method for fast network restoration | |
| KR20230022265A (en) | Interior gateway protocol flood minimization | |
| US7042850B2 (en) | Focused link state advertisements | |
| US20080008104A1 (en) | Technique for efficiently determining acceptable link-based loop free alternates in a computer network | |
| CN101953124A (en) | Constructing repair paths around multiple non-available links in a data communications network | |
| CN101326762A (en) | Constructing and implementing backup paths in autonomous systems | |
| US11646960B2 (en) | Controller provided protection paths | |
| CN108768796B (en) | Link fault detection method and device | |
| US7969898B1 (en) | Technique for breaking loops in a communications network | |
| Chiesa et al. | A survey of fast recovery mechanisms in the data plane | |
| WO2002006918A2 (en) | A method, system, and product for preventing data loss and forwarding loops when conducting a scheduled change to the topology of a link-state routing protocol network | |
| JPWO2005057864A1 (en) | Network path switching system | |
| EP1185041B1 (en) | OSPF autonomous system with a backbone divided into two sub-areas | |
| US6973028B1 (en) | SONET ring map generation method and system | |
| JP3780987B2 (en) | Route control method and apparatus, route control program, and storage medium storing route control program | |
| US7483398B1 (en) | Method and system for detecting ring link provisioning mismatch | |
| Abujassar | Restoration of IP Networks by Using a Hybrid Interacting Mechanism Between Layer 2 & 3 in the Networks Over OA&M: Fault Prediction and Mitigation on the IGP Network with Fast Detection by Using the OA&M Ethernet |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| EEER | Examination request | ||
| FZDE | Discontinued |