CA2311105C - Network data routing protection cycles for automatic protection switching - Google Patents
Network data routing protection cycles for automatic protection switching Download PDFInfo
- Publication number
- CA2311105C CA2311105C CA002311105A CA2311105A CA2311105C CA 2311105 C CA2311105 C CA 2311105C CA 002311105 A CA002311105 A CA 002311105A CA 2311105 A CA2311105 A CA 2311105A CA 2311105 C CA2311105 C CA 2311105C
- Authority
- CA
- Canada
- Prior art keywords
- protection cycle
- packet
- network
- protection
- node
- 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.)
- Expired - Lifetime
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/22—Alternate routing
-
- 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/40—Network arrangements, protocols or services independent of the application payload and not provided for in the other groups of this subclass for recovering from a failure of a protocol instance or entity, e.g. service redundancy protocols, protocol state redundancy or protocol service redirection
-
- 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
- H04L45/03—Topology update or discovery by updating link state protocols
Abstract
A computer network processes data packets in the event of a network link failure. The network includes a plurality of routers that deliver data packets to the network via a plurality of links. At least one router includes a protection cycle manager. The protection cycle manager has a protection cycle packet identifier and a protection cycle packet processor. The protection cycle packet identifier identifies, as protection cycle packets, data packets having a specific protection cycle format. The protection cycle packet processor processes protection cycle packets to determine whether the packet destination corresponds to the routing node, and if the packet destination corresponds to the routing node, the protection cycle packet is treated by the routing node as a data packet received from the packet source via the failed link. Otherwise, if the packet destination does not correspond to the routing node, the protection cycle packet is sent to a protection cycle node for the routing node.
Description
Attorney Docket: 2204/146 Network Data Routing Protection Cycles for Automatic Protection Switching Technical Field The present invention relates to computer networks, and more specifically to a computer network that provides automatic protection switching to reroute data packets in the event of a network link failure.
Background Art In an Internet Protocol (IP) based computer network, data routing protocols such as Open Shortest Path First (OSPF), Intermediate System-Intermediate System (IS-IS), and Routing Information Protocol (RIP) are used to determine the path that data packets travel through the network. When a link between two network routers fails, the routing protocols are used to advertise the failure throughout the network.
Most routers can detect a local link failure relatively quickly, but it takes the network as a whole a much longer time to converge. This convergence time is typically on the order of 10-60 seconds depending on the routing protocol and the size of the network. Eventually, all of the involved routers learn of the link failure and compute new routes for data packets to affected destinations. Once all the routers converge on a new set of routes, data packet forwarding proceeds normally.
While the network is converging after a link fails, transient loops can occur which consume valuable bandwidth. Loop prevention algorithms have been proposed to eliminate such transient loops. When using these algorithms, routes are pinned until the network has converged and the new routes have been proven to be loop-free. Loop prevention algorithms have the advantage that data packets flowing on unaffected routes are not disrupted while transient loops are eliminated.
The main drawback of loop prevention algorithms is that data packets directed out of a failed link get lost, or "black holed," during the convergence. Loop prevention algorithms also extend the convergence time somewhat while new routes are being verified to be loop-free.
Summary of the Invention A preferred embodiment of the present invention includes an apparatus and method for processing data packets in the event of a link failure of a routing node that delivers data packets to a data network via a plurality of links. A
protection cycle manager includes a protection cycle packet identifier and a protection cycle packet processor. The packet identifier identifies, as protection cycle packets, data packets having a specific protection cycle format that includes a packet source and a packet destination. The processor processes each protection cycle packet to determine whether the packet destination corresponds to the routing node, and if the packet destination corresponds to the routing node, the protection cycle packet is treated by the routing node as a data packet received from the packet source via the failed link. Otherwise, if the packet destination does not correspond to the routing node, the protection cycle packet is sent to a protection cycle node for the routing node.
A further embodiment may include a protection cycle packeter, that, in response to failure of a link for the routing node,, converts affected data packets routed over the failed link into protection cycle packets in the specific protection cycle format. The protection cycle manager may further advertise a link failure to the network using a routing protocol. The specific protection cycle format may include a label stack based on Multi-Protocol Label Switching (MPLS) which may include labels for the packet source and the packet destination. The protection cycle node may be a next node on a Label Switched Path (LSP), in which case, the LSP
may be based on network topology information which may be derived from a network protocol.
Background Art In an Internet Protocol (IP) based computer network, data routing protocols such as Open Shortest Path First (OSPF), Intermediate System-Intermediate System (IS-IS), and Routing Information Protocol (RIP) are used to determine the path that data packets travel through the network. When a link between two network routers fails, the routing protocols are used to advertise the failure throughout the network.
Most routers can detect a local link failure relatively quickly, but it takes the network as a whole a much longer time to converge. This convergence time is typically on the order of 10-60 seconds depending on the routing protocol and the size of the network. Eventually, all of the involved routers learn of the link failure and compute new routes for data packets to affected destinations. Once all the routers converge on a new set of routes, data packet forwarding proceeds normally.
While the network is converging after a link fails, transient loops can occur which consume valuable bandwidth. Loop prevention algorithms have been proposed to eliminate such transient loops. When using these algorithms, routes are pinned until the network has converged and the new routes have been proven to be loop-free. Loop prevention algorithms have the advantage that data packets flowing on unaffected routes are not disrupted while transient loops are eliminated.
The main drawback of loop prevention algorithms is that data packets directed out of a failed link get lost, or "black holed," during the convergence. Loop prevention algorithms also extend the convergence time somewhat while new routes are being verified to be loop-free.
Summary of the Invention A preferred embodiment of the present invention includes an apparatus and method for processing data packets in the event of a link failure of a routing node that delivers data packets to a data network via a plurality of links. A
protection cycle manager includes a protection cycle packet identifier and a protection cycle packet processor. The packet identifier identifies, as protection cycle packets, data packets having a specific protection cycle format that includes a packet source and a packet destination. The processor processes each protection cycle packet to determine whether the packet destination corresponds to the routing node, and if the packet destination corresponds to the routing node, the protection cycle packet is treated by the routing node as a data packet received from the packet source via the failed link. Otherwise, if the packet destination does not correspond to the routing node, the protection cycle packet is sent to a protection cycle node for the routing node.
A further embodiment may include a protection cycle packeter, that, in response to failure of a link for the routing node,, converts affected data packets routed over the failed link into protection cycle packets in the specific protection cycle format. The protection cycle manager may further advertise a link failure to the network using a routing protocol. The specific protection cycle format may include a label stack based on Multi-Protocol Label Switching (MPLS) which may include labels for the packet source and the packet destination. The protection cycle node may be a next node on a Label Switched Path (LSP), in which case, the LSP
may be based on network topology information which may be derived from a network protocol.
A preferred embodiment also includes a data router that delivers data packets to a data network via a plurality of links, the router processing data packets in the event of a link failure. The router includes a data interface for data packets to enter and exit the router, and a protection cycle manager. The protection cycle manager includes a protection cycle packet identifier and a protection cycle processor. The packet identifier identifies, as protection cycle packets, data packets having a specific protection cycle format that includes a packet source and a packet destination. The processor processes protection cycle packets to determine whether the packet destination corresponds to the routing node, and: (i) if the packet destination corresponds to the router, the protection cycle packet is treated by the router as a data packet received from the packet source via the failed link, and, (ii) if the packet destination does not correspond to the routing node, the protection cycle packets are sent to a protection cycle node for the router.
Another preferred embodiment includes a computer network having a plurality of data packet streams. The network includes a plurality of subnetworks, each subnetwork having at least one application that generates a stream of data packets for transmission over the computer network, and a plurality of routers that deliver data packets to the network via a plurality of links. At least one router processes data packets in the event of a link failure. The at least one router includes a plurality of data interfaces for streams of data packets to enter and exit the at least one router, and a protection cycle manager having a protection cycle packet identifier and a protection cycle processor. The packet identifier identifies, as protection cycle packets, data packets having a specific protection cycle format that includes a packet source and a packet destination. The processor processes protection cycle packets to determine whether the packet destination corresponds to the routing node, and: (i) if the packet destination corresponds to the at least one router, the protection cycle packet is treated by the at least one router as a data packet received from the packet source via the failed link, and, (ii) if the packet destination does not correspond to the routing node, the protection cycle packets are sent to a protection cycle node for the at least one router.
A preferred embodiment includes a computer program product for use on a computer system for processing data packets in the event of a link failure of a routing node that delivers data packets to a data network via a plurality of links.
The computer program product comprises a computer-usable medium having computer-readable program code thereon. The computer readable program code includes program code for identifying, as protection cycle packets, data packets having a specific protection cycle format that includes a packet source and a packet destination. There is also program code for processing protection cycle packets to determine whether the packet destination corresponds to the routing node, and:
(i) if the packet destination corresponds to the routing node, the protection cycle packet is treated by the routing node as a data packet received from the packet source via the failed link, and, (ii) if the packet destination does not correspond to the routing node, the protection cycle packets are sent to a protection cycle node for the routing node.
Brief Description of the Drawings The present invention will be more readily understood by reference to the following detailed description taken with the accompanying drawings, in which:
Fig. 1 is an illustration of a computer network which uses MPLS p-cycle automatic protection switching according to a preferred embodiment.
Fig. 2 is an illustration of a network node router which supports p-cycles according to a preferred embodiment.
Fig. 3 is a flow chart illustration of the logical steps in a method of providing automatic protection switching according to a preferred embodiment.
Detailed Description of Specific Embodiments .; .
A preferred embodiment of the present invention uses Multi-Protocol Label Switching (MPLS) with explicit routing to establish an MPLS layer protection cycle (p-cycle) that provides automatic protection switching to reroute data packets in the event of a network link failure. An MPLS Label Switched Path (LSP) tunnel passes through the end points of the link that will be protected. The LSP tunnel established in this way forms an MPLS p-cycle through which failed-link packets are directed. A given p-cycle may protect one or multiple links. In a preferred embodiment, a standard multi-layered MPLS label stack is used in the p-cycle.
In other embodiments, a p-cycle may be implemented in another protocol other than MPLS.
The p-cycle may be configured by hand, or automatically established using network link state and topology information derived from a routing protocol, such as Open Shortest Path First (OSPF). Various algorithms may be used to automatically compute the specific structure of a given p-cycle. A preferred embodiment uses a network management application for this purpose since the p-cycle will not follow an optimal path. When a p-cycle is bi-directional, a bandwidth protection mechanism may be implemented so that some of the p-cycle traffic goes one way, and the rest the other way.
A preferred embodiment uses a diffusion-based loop prevention algorithm as is known in the art to detect when the network has converged so that it is safe to switch to the new routed path. Such diffusion algorithms are discussed, for example, in Garcia-Lunes-Aceves, J.J., "Loop-Free Routing Using Diffusing Computations," IEEE/ACM Transactions on Networking, vol. 1, no. 1, 1993, pp.
141. Using p-cycles with a loop prevention algorithm allows for uninterrupted service in the event of a link failure without black holing of packets on the failed link.
Fig. 1 is an illustration of a computer network using a preferred embodiment of the present invention for MPLS p-cycle automatic protection switching. In Fig. 1, network nodes A 10 through H 17 are normally linked via the dashed lines to route data packets from node to node. In the network segment shown, the normal network links between A and E, A and F, B and D, B and E, and H and F are also protected by a p-cycle 18. The p-cycle 18 forms a loop through the network so that a packet sent through the p-cycle will eventually come back to its origination node if not taken out of the p-cycle by one of the nodes it passes through. In Fig. 1, LSP p-cycle 18 traverses the network segment from node A 10 to B 11 to C 12 ... to G
16 to H 17 and back to A 10.
Only one p-cycle 18 is shown in Fig. 1. In practice, a p-cycle is established for every set of links to be protected. A preferred embodiment can operate successfully in any arbitrary network topology. It should be noted, however, that to realize full link-level protection, for every two neighbors A and B connected by link L in the network, another network path between A and B must exist that does not include L.
Various options may be employed with respect to network-level encapsulation on the original link. For example, the original network-layer encapsulation (e.g., IP) may be tunneled in the p-cycle LSP. If MPLS is being used on the original link, then the labeled packet may be tunneled on the backup link using MPLS label stacking. Multiple independent link failures may be tolerated using multiple layers of tunneling.
The router for each node monitors its own local links. When a link failure is detected, the router for an affected node quickly routes the data packet traffic over to the p-cycle 18. Then, the network routing protocol advertises the link failure so that the network can be re-routed without the failed link, and a loop-prevention mechanism determines that the re-routed network is loop-free. Packet traffic may then be switched to the re-routed network and new p-cycles recalculated as necessary.
Fig. 2 is an illustration of a network node router which supports p-cycles according to a preferred embodiment. Network node router 20 is a part of a computer network 22 of routers in mutual communication via a plurality of network node data links 21. Router 20 also serves to connect one or more local area networks (LANs) 23 having one or more workstations 231. Data packets enter and exit the router 20 as controlled by a data interface driver 24 which is connected to the network node links 21.
Fig. 3 is a flow chart illustration of the logical steps in a corresponding method of providing automatic protection switching according to a preferred embodiment. A protection cycle manager 25 includes a p-cycle packet identifier that, in step 301, identifies as p-cycle packets, data packets that have a p-cycle label stack, which, in a preferred embodiment, is a standard MPLS label stack. In such an embodiment, the top label in the stack indicates the next node in the p-cycle.
The next label on the stack is the identity of the destination node that ultimately receives the packet, the third label in the stack is the identity of the node creating the label stack. Identified p-cycle packets are processed by p-cycle packet processor which, in step 302, pops the topmost label off the label stack and checks the next label to see if the router node's own identity is in the destination node position in the label stack. If not, the label for the next p-cycle node is pushed onto the stack and the packet is sent by the data interface driver 24 via the node link 21 to the next node on the p-cycle, step 303. If, in step 302, the router node's own identity is carried in the destination node position in the label stack, the source node label in the label stack is checked to determine which network link the packet normally would have used, step 304. The p-cycle label stack is then deleted, step 305, and thereafter, the packet is treated as if it had been received via the normal network link 21 from the source node, step 306.
In a preferred embodiment, the network node router also includes a network link monitor 26 in communication with the data interface driver 24. When the link monitor 26 detects a failed link, step 307, protection cycle packeter 253 attaches to affected data packets a p-cycle label stack having appropriate labels for source node, destination node, and p-cycle node, step 308, and the p-cycle packets are then sent to the p-cycle node for that router, step 303. A link failure also is advertised to the network using the routing protocol, step 309. A new network route is then established to replace the failed link, step 310, and a loop prevention algorithm is used to determine that the new network routes have converged and are loop-free, step 311.
Preferred embodiments of the invention, or portions thereof (e.g., the p-cycle packet processor 252, p-cycle packet identifier 251, link monitor 26, etc.), may be implemented in any conventional computer programming language. For example, preferred embodiments may be implemented in a procedural programming language (e.g., "C") or an object oriented programming language (e.g., "C++"
or "JAVA"). Alternative embodiments of the invention may be implemented as preprogrammed hardware elements (e.g., application specific integrated circuits), or other related components.
Alternative embodiments of the invention may be implemented as a computer program product for use with a computer system. 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 preferably 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 medium 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 distributed from a server or electronic bulletin board over the network (e.g., the Internet or World Wide Web).
Although various exemplary embodiments of the invention have been disclosed, it should be apparent to those skilled in the art that various changes and modifications can be made that will achieve some of the advantages of the invention without departing from the true scope of the invention. These and other obvious modifications are intended to be covered by the appended claims.
Another preferred embodiment includes a computer network having a plurality of data packet streams. The network includes a plurality of subnetworks, each subnetwork having at least one application that generates a stream of data packets for transmission over the computer network, and a plurality of routers that deliver data packets to the network via a plurality of links. At least one router processes data packets in the event of a link failure. The at least one router includes a plurality of data interfaces for streams of data packets to enter and exit the at least one router, and a protection cycle manager having a protection cycle packet identifier and a protection cycle processor. The packet identifier identifies, as protection cycle packets, data packets having a specific protection cycle format that includes a packet source and a packet destination. The processor processes protection cycle packets to determine whether the packet destination corresponds to the routing node, and: (i) if the packet destination corresponds to the at least one router, the protection cycle packet is treated by the at least one router as a data packet received from the packet source via the failed link, and, (ii) if the packet destination does not correspond to the routing node, the protection cycle packets are sent to a protection cycle node for the at least one router.
A preferred embodiment includes a computer program product for use on a computer system for processing data packets in the event of a link failure of a routing node that delivers data packets to a data network via a plurality of links.
The computer program product comprises a computer-usable medium having computer-readable program code thereon. The computer readable program code includes program code for identifying, as protection cycle packets, data packets having a specific protection cycle format that includes a packet source and a packet destination. There is also program code for processing protection cycle packets to determine whether the packet destination corresponds to the routing node, and:
(i) if the packet destination corresponds to the routing node, the protection cycle packet is treated by the routing node as a data packet received from the packet source via the failed link, and, (ii) if the packet destination does not correspond to the routing node, the protection cycle packets are sent to a protection cycle node for the routing node.
Brief Description of the Drawings The present invention will be more readily understood by reference to the following detailed description taken with the accompanying drawings, in which:
Fig. 1 is an illustration of a computer network which uses MPLS p-cycle automatic protection switching according to a preferred embodiment.
Fig. 2 is an illustration of a network node router which supports p-cycles according to a preferred embodiment.
Fig. 3 is a flow chart illustration of the logical steps in a method of providing automatic protection switching according to a preferred embodiment.
Detailed Description of Specific Embodiments .; .
A preferred embodiment of the present invention uses Multi-Protocol Label Switching (MPLS) with explicit routing to establish an MPLS layer protection cycle (p-cycle) that provides automatic protection switching to reroute data packets in the event of a network link failure. An MPLS Label Switched Path (LSP) tunnel passes through the end points of the link that will be protected. The LSP tunnel established in this way forms an MPLS p-cycle through which failed-link packets are directed. A given p-cycle may protect one or multiple links. In a preferred embodiment, a standard multi-layered MPLS label stack is used in the p-cycle.
In other embodiments, a p-cycle may be implemented in another protocol other than MPLS.
The p-cycle may be configured by hand, or automatically established using network link state and topology information derived from a routing protocol, such as Open Shortest Path First (OSPF). Various algorithms may be used to automatically compute the specific structure of a given p-cycle. A preferred embodiment uses a network management application for this purpose since the p-cycle will not follow an optimal path. When a p-cycle is bi-directional, a bandwidth protection mechanism may be implemented so that some of the p-cycle traffic goes one way, and the rest the other way.
A preferred embodiment uses a diffusion-based loop prevention algorithm as is known in the art to detect when the network has converged so that it is safe to switch to the new routed path. Such diffusion algorithms are discussed, for example, in Garcia-Lunes-Aceves, J.J., "Loop-Free Routing Using Diffusing Computations," IEEE/ACM Transactions on Networking, vol. 1, no. 1, 1993, pp.
141. Using p-cycles with a loop prevention algorithm allows for uninterrupted service in the event of a link failure without black holing of packets on the failed link.
Fig. 1 is an illustration of a computer network using a preferred embodiment of the present invention for MPLS p-cycle automatic protection switching. In Fig. 1, network nodes A 10 through H 17 are normally linked via the dashed lines to route data packets from node to node. In the network segment shown, the normal network links between A and E, A and F, B and D, B and E, and H and F are also protected by a p-cycle 18. The p-cycle 18 forms a loop through the network so that a packet sent through the p-cycle will eventually come back to its origination node if not taken out of the p-cycle by one of the nodes it passes through. In Fig. 1, LSP p-cycle 18 traverses the network segment from node A 10 to B 11 to C 12 ... to G
16 to H 17 and back to A 10.
Only one p-cycle 18 is shown in Fig. 1. In practice, a p-cycle is established for every set of links to be protected. A preferred embodiment can operate successfully in any arbitrary network topology. It should be noted, however, that to realize full link-level protection, for every two neighbors A and B connected by link L in the network, another network path between A and B must exist that does not include L.
Various options may be employed with respect to network-level encapsulation on the original link. For example, the original network-layer encapsulation (e.g., IP) may be tunneled in the p-cycle LSP. If MPLS is being used on the original link, then the labeled packet may be tunneled on the backup link using MPLS label stacking. Multiple independent link failures may be tolerated using multiple layers of tunneling.
The router for each node monitors its own local links. When a link failure is detected, the router for an affected node quickly routes the data packet traffic over to the p-cycle 18. Then, the network routing protocol advertises the link failure so that the network can be re-routed without the failed link, and a loop-prevention mechanism determines that the re-routed network is loop-free. Packet traffic may then be switched to the re-routed network and new p-cycles recalculated as necessary.
Fig. 2 is an illustration of a network node router which supports p-cycles according to a preferred embodiment. Network node router 20 is a part of a computer network 22 of routers in mutual communication via a plurality of network node data links 21. Router 20 also serves to connect one or more local area networks (LANs) 23 having one or more workstations 231. Data packets enter and exit the router 20 as controlled by a data interface driver 24 which is connected to the network node links 21.
Fig. 3 is a flow chart illustration of the logical steps in a corresponding method of providing automatic protection switching according to a preferred embodiment. A protection cycle manager 25 includes a p-cycle packet identifier that, in step 301, identifies as p-cycle packets, data packets that have a p-cycle label stack, which, in a preferred embodiment, is a standard MPLS label stack. In such an embodiment, the top label in the stack indicates the next node in the p-cycle.
The next label on the stack is the identity of the destination node that ultimately receives the packet, the third label in the stack is the identity of the node creating the label stack. Identified p-cycle packets are processed by p-cycle packet processor which, in step 302, pops the topmost label off the label stack and checks the next label to see if the router node's own identity is in the destination node position in the label stack. If not, the label for the next p-cycle node is pushed onto the stack and the packet is sent by the data interface driver 24 via the node link 21 to the next node on the p-cycle, step 303. If, in step 302, the router node's own identity is carried in the destination node position in the label stack, the source node label in the label stack is checked to determine which network link the packet normally would have used, step 304. The p-cycle label stack is then deleted, step 305, and thereafter, the packet is treated as if it had been received via the normal network link 21 from the source node, step 306.
In a preferred embodiment, the network node router also includes a network link monitor 26 in communication with the data interface driver 24. When the link monitor 26 detects a failed link, step 307, protection cycle packeter 253 attaches to affected data packets a p-cycle label stack having appropriate labels for source node, destination node, and p-cycle node, step 308, and the p-cycle packets are then sent to the p-cycle node for that router, step 303. A link failure also is advertised to the network using the routing protocol, step 309. A new network route is then established to replace the failed link, step 310, and a loop prevention algorithm is used to determine that the new network routes have converged and are loop-free, step 311.
Preferred embodiments of the invention, or portions thereof (e.g., the p-cycle packet processor 252, p-cycle packet identifier 251, link monitor 26, etc.), may be implemented in any conventional computer programming language. For example, preferred embodiments may be implemented in a procedural programming language (e.g., "C") or an object oriented programming language (e.g., "C++"
or "JAVA"). Alternative embodiments of the invention may be implemented as preprogrammed hardware elements (e.g., application specific integrated circuits), or other related components.
Alternative embodiments of the invention may be implemented as a computer program product for use with a computer system. 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 preferably 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 medium 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 distributed from a server or electronic bulletin board over the network (e.g., the Internet or World Wide Web).
Although various exemplary embodiments of the invention have been disclosed, it should be apparent to those skilled in the art that various changes and modifications can be made that will achieve some of the advantages of the invention without departing from the true scope of the invention. These and other obvious modifications are intended to be covered by the appended claims.
Claims (56)
1. A protection cycle manager that processes data packets in the event of a link failure of a routing node that delivers data packets to a computer network via a plurality of links, the protection cycle manager comprising:
a protection cycle packet identifier that identifies, as protection cycle packets, data packets having a specific protection cycle format that includes a packet source and a packet destination; and a protection cycle packet processor that processes each protection cycle packet to determine whether the packet destination corresponds to the routing node; and:
i.
if the packet destination corresponds to the routing node, the protection cycle packet is treated by the routing node as a data packet received from the packet source via the failed link; and if the packet destination does not correspond to the routing node, the protection cycle packet is sent to a protection cycle node for the routing node.
a protection cycle packet identifier that identifies, as protection cycle packets, data packets having a specific protection cycle format that includes a packet source and a packet destination; and a protection cycle packet processor that processes each protection cycle packet to determine whether the packet destination corresponds to the routing node; and:
i.
if the packet destination corresponds to the routing node, the protection cycle packet is treated by the routing node as a data packet received from the packet source via the failed link; and if the packet destination does not correspond to the routing node, the protection cycle packet is sent to a protection cycle node for the routing node.
2. A protection cycle manager according to claim 1, further comprising:
a protection cycle packeter, that converts, in response to failure of a link for the routing node, affected data packets routed over the failed link into protection cycle packets in the specific protection cycle format.
a protection cycle packeter, that converts, in response to failure of a link for the routing node, affected data packets routed over the failed link into protection cycle packets in the specific protection cycle format.
3. A protection cycle manager according to claim 1, wherein the protection cycle manager further advertises a link failure to the network using a routing protocol.
4. A protection cycle manager according to claim 1, wherein the specific protection cycle format includes a label stack based on Multi-Protocol Label Switching (MPLS).
5. A protection cycle manager according to claim 4, wherein the label stack includes labels for the packet source and the packet destination.
6. A protection cycle manager according to claim 1, wherein the protection cycle node is a next node on a Label Switched Path (LSP).
7. A protection cycle manager according to claim 6, wherein the LSP is based on network topology information.
8. A protection cycle manager according to claim 7, wherein the network topology information is derived from a network protocol.
9. A method of processing data packets in the event of a link failure of a routing node that delivers data packets to a data network via a plurality of links, the method comprising:
identifying, as protection cycle packets, data packets having a specific protection cycle format that includes a packet source and a packet destination; and processing each protection cycle packet to determine whether the packet destination corresponds to the routing node, and:
(i) if the packet destination corresponds to the routing node, the protection cycle packet is treated by the routing node as a data packet received from the packet source via the failed link; and (ii) if the packet destination does not correspond to the routing node, the protection cycle packet is sent to a protection cycle node for the routing node.
identifying, as protection cycle packets, data packets having a specific protection cycle format that includes a packet source and a packet destination; and processing each protection cycle packet to determine whether the packet destination corresponds to the routing node, and:
(i) if the packet destination corresponds to the routing node, the protection cycle packet is treated by the routing node as a data packet received from the packet source via the failed link; and (ii) if the packet destination does not correspond to the routing node, the protection cycle packet is sent to a protection cycle node for the routing node.
10. A method according to claim 9, further comprising:
converting, in response failure of a link for the routing node, affected data packets routed over the failed link into protection cycle packets in the specific protection cycle format.
converting, in response failure of a link for the routing node, affected data packets routed over the failed link into protection cycle packets in the specific protection cycle format.
11. A method according to claim 9, further comprising advertising a link failure to the network using a routing protocol.
12. A method according to claim 9, further comprising establishing a new network route to replace a failed link.
13. A method according to claim 9, further comprising using a loop prevention algorithm after a link failure for determining that the network has converged and is loop-free.
14. A method according to claim 9, wherein the specific protection cycle format includes a label stack based on Multi-Protocol Label Switching (MPLS).
15. A method according to claim 14, wherein the label stack includes labels for the packet source and the packet destination.
16. A method according to claim 9, wherein the protection cycle node is a next node on a Label Switched Path (LSP).
17. A method according to claim 16, wherein the LSP is based on network topology information.
18. A method according to claim 17, wherein the network topology information is derived from a network protocol.
19. A data router that delivers data packets to a computer network via a plurality of links, the router processing data packets in the event of a link failure, the router comprising:
a data interface for data packets to enter and exit the router; and a protection cycle manager including:
a protection cycle packet identifier that identifies, as protection cycle packets, data packets having a specific protection cycle format that includes a packet source and a packet destination; and a protection cycle packet processor that processes each protection cycle packet to determine whether the packet destination corresponds to the routing node, and:
(i) if the packet destination corresponds to the router, the protection cycle packet is treated by the router as a data packet received from the packet source via the failed link, and, (ii) if the packet destination does not correspond to the routing node, the protection cycle packet is sent to a protection cycle node for the router.
a data interface for data packets to enter and exit the router; and a protection cycle manager including:
a protection cycle packet identifier that identifies, as protection cycle packets, data packets having a specific protection cycle format that includes a packet source and a packet destination; and a protection cycle packet processor that processes each protection cycle packet to determine whether the packet destination corresponds to the routing node, and:
(i) if the packet destination corresponds to the router, the protection cycle packet is treated by the router as a data packet received from the packet source via the failed link, and, (ii) if the packet destination does not correspond to the routing node, the protection cycle packet is sent to a protection cycle node for the router.
20. A data router according to claim 19, further comprising:
a protection cycle packeter, that, in response to failure of a link for the routing node, converts affected data packets routed over the failed link into protection cycle packets in the specific protection cycle format.
a protection cycle packeter, that, in response to failure of a link for the routing node, converts affected data packets routed over the failed link into protection cycle packets in the specific protection cycle format.
21. A data router according to claim 19, wherein the router further advertises a link failure to the network using a routing protocol.
22. A data router according to claim 19, wherein the specific protection cycle format includes a label stack based on Multi-Protocol Label Switching (MPLS).
23. A data router according to claim 22, wherein the label stack includes labels for the packet source and the packet destination.
24. A data router according to claim 19, wherein the protection cycle node is a next node on a Label Switched Path (LSP).
25. A data router according to claim 24, wherein the LSP is based on network topology information.
26. A data router according to claim 25, wherein the network topology information is derived from a network protocol.
27. A computer network having a plurality of data packet streams, the network comprising:
a plurality of subnetworks, each subnetwork having at least one application that generates a stream of data packets for transmission over the computer network;
and a plurality of routers that deliver data packets to the network via a plurality of links, at least one router processing data packets in the event of a link failure, the at least one router including:
a plurality of data interfaces for streams of data packets to enter and exit the at least one router; and a protection cycle manager having:
a protection cycle packet identifier that identifies, as protection cycle packets, data packets having a specific protection cycle format that includes a packet source and a packet destination; and a protection cycle packet processor that processes each protection cycle packet to determine whether the packet destination corresponds to the routing node, and:
(i) if the packet destination corresponds to the at least one router, the protection cycle packet is treated by the at least one router as a data packet received from the packet source via the failed link, and, (ii) if the packet destination does not correspond to the routing node, the protection cycle packet is sent to a protection cycle node for the at least one router.
a plurality of subnetworks, each subnetwork having at least one application that generates a stream of data packets for transmission over the computer network;
and a plurality of routers that deliver data packets to the network via a plurality of links, at least one router processing data packets in the event of a link failure, the at least one router including:
a plurality of data interfaces for streams of data packets to enter and exit the at least one router; and a protection cycle manager having:
a protection cycle packet identifier that identifies, as protection cycle packets, data packets having a specific protection cycle format that includes a packet source and a packet destination; and a protection cycle packet processor that processes each protection cycle packet to determine whether the packet destination corresponds to the routing node, and:
(i) if the packet destination corresponds to the at least one router, the protection cycle packet is treated by the at least one router as a data packet received from the packet source via the failed link, and, (ii) if the packet destination does not correspond to the routing node, the protection cycle packet is sent to a protection cycle node for the at least one router.
28. A computer network according to claim 27, wherein the at least one router further comprises:
a protection cycle packeter, that, in response to failure of a link for the routing node, converts affected data packets routed over the failed link into protection cycle packets in the specific protection cycle format.
a protection cycle packeter, that, in response to failure of a link for the routing node, converts affected data packets routed over the failed link into protection cycle packets in the specific protection cycle format.
29. A computer network according to claim 27, wherein the at least one router further advertises a link failure to the network using a routing protocol.
30. A computer network according to claim 27, further comprising a failed link recalculator that establishes a new network route to replace a failed link.
31. A computer network according to claim 30, wherein the failed link recalculator uses a loop prevention algorithm after a link failure for determining that the network has converged and is loop-free.
32. A computer network according to claim 27, wherein the specific protection cycle format includes a label stack based on Multi-Protocol Label Switching (MPLS).
33. A computer network according to claim 32, wherein the label stack includes labels for the packet source and the packet destination.
34. A computer network according to claim 27, wherein the protection cycle node is a next node on a Label Switched Path (LSP).
35. A computer network according to claim 34, wherein the LSP is based on network topology information.
36. A computer network according to claim 35, wherein the network topology information is derived from a network protocol.
37. A computer program product for use on a computer system for processing data packets in the event of a link failure of a routing node that delivers data packets to a computer network via a plurality of links, the computer program product comprising a computer-usable medium having computer-readable program code thereon, the computer readable program code including:
program code for identifying, as protection cycle packets, data packets having a specific protection cycle format that includes a packet source and a packet destination; and program code for processing each protection cycle packet to determine whether the packet destination corresponds to the routing node, and:
(i) if the packet destination corresponds to the routing node, the protection cycle packet is treated by the routing node as a data packet received from the packet source via the failed link, and, (ii) if the packet destination does not correspond to the routing node, the protection cycle packet is sent to a protection cycle node for the routing node.
program code for identifying, as protection cycle packets, data packets having a specific protection cycle format that includes a packet source and a packet destination; and program code for processing each protection cycle packet to determine whether the packet destination corresponds to the routing node, and:
(i) if the packet destination corresponds to the routing node, the protection cycle packet is treated by the routing node as a data packet received from the packet source via the failed link, and, (ii) if the packet destination does not correspond to the routing node, the protection cycle packet is sent to a protection cycle node for the routing node.
38. A computer program product according to claim 37, further comprising:
program code for converting, in response to failure of a link for the routing node, affected data packets routed over the failed link into protection cycle packets in the specific protection cycle format.
program code for converting, in response to failure of a link for the routing node, affected data packets routed over the failed link into protection cycle packets in the specific protection cycle format.
39. A computer program product according to claim 37, further comprising program code for advertising a link failure to the network using a routing protocol.
40. A computer program product according to claim 37, further comprising program code for using a loop prevention algorithm after a link failure for determining that the network has converged and is loop-free.
41. A computer program product according to claim 37, further comprising program code for establishing a new network route to replace a failed link.
42. A computer program product according to claim 37, wherein the specific protection cycle format includes a label stack based on Multi-Protocol Label Switching (MPLS).
43. A computer program product according to claim 42, wherein the label stack includes labels for the packet source and the packet destination.
44. A computer program product according to claim 37, wherein the protection cycle node is a next node on a Label Switched Path (LSP).
45. A computer program product according to claim 44, wherein the LSP is based upon network topology information.
46. A computer program product according to claim 45, wherein the network topology information is derived from a network protocol.
47. A protection cycle manager that processes data packets in the event of a link failure of a routing node that delivers data packets to a computer network via a plurality of links, the protection cycle manager comprising:
means for identifying, as protection cycle packets, data packets having a specific protection cycle format that includes a packet source and a packet destination; and means for processing each protection cycle packet to determine whether the packet destination corresponds to the routing node, and:
(i) if the packet destination corresponds to the routing node, the protection cycle packet is treated by the routing node as a data packet received from the packet source via the failed link; and (ii) if the packet destination does not correspond to the routing node, the protection cycle packet is sent to a protection cycle node for the routing node.
means for identifying, as protection cycle packets, data packets having a specific protection cycle format that includes a packet source and a packet destination; and means for processing each protection cycle packet to determine whether the packet destination corresponds to the routing node, and:
(i) if the packet destination corresponds to the routing node, the protection cycle packet is treated by the routing node as a data packet received from the packet source via the failed link; and (ii) if the packet destination does not correspond to the routing node, the protection cycle packet is sent to a protection cycle node for the routing node.
48. A protection cycle manager according to claim 47, further comprising:
means for converting, in response failure of a link for the routing node, affected data packets routed over the failed link into protection cycle packets in the specific protection cycle format.
means for converting, in response failure of a link for the routing node, affected data packets routed over the failed link into protection cycle packets in the specific protection cycle format.
49. A protection cycle manager according to claim 47, further comprising:
means for advertising a link failure to the network using a routing protocol.
means for advertising a link failure to the network using a routing protocol.
50. A protection cycle manager according to claim 47, further comprising:
means for establishing a new network route to replace a failed link.
means for establishing a new network route to replace a failed link.
51. A protection cycle manager according to claim 47, further comprising:
means for using a loop prevention algorithm after a link failure for determining that the network has converged and is loop-free.
means for using a loop prevention algorithm after a link failure for determining that the network has converged and is loop-free.
52. A protection cycle manager according to claim 47, wherein the specific protection cycle format includes a label stack based on Multi-Protocol Label Switching (MPLS).
53. A protection cycle manager according to claim 52, wherein the label stack includes labels for the packet source and the packet destination.
54. A protection cycle manager according to claim 47, wherein the protection cycle node is a next node on a Label Switched Path (LSP).
55. A protection cycle manager according to claim 54, wherein the LSP is based on network topology information.
56. A protection cycle manager according to claim 55, wherein the network topology information is derived from a network protocol.
Applications Claiming Priority (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US09/378,141 | 1999-08-20 | ||
US09/378,141 US6535481B1 (en) | 1999-08-20 | 1999-08-20 | Network data routing protection cycles for automatic protection switching |
Publications (2)
Publication Number | Publication Date |
---|---|
CA2311105A1 CA2311105A1 (en) | 2001-02-20 |
CA2311105C true CA2311105C (en) | 2009-02-17 |
Family
ID=23491905
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CA002311105A Expired - Lifetime CA2311105C (en) | 1999-08-20 | 2000-06-02 | Network data routing protection cycles for automatic protection switching |
Country Status (4)
Country | Link |
---|---|
US (4) | US6535481B1 (en) |
EP (1) | EP1079570B1 (en) |
CA (1) | CA2311105C (en) |
DE (1) | DE60032073T2 (en) |
Families Citing this family (109)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US7167443B1 (en) * | 1999-09-10 | 2007-01-23 | Alcatel | System and method for packet level restoration of IP traffic using overhead signaling in a fiber optic ring network |
WO2001020829A1 (en) * | 1999-09-14 | 2001-03-22 | Megaxess, Inc. | Method and apparatus for prevention of congestion in atm networks through atm protection switching |
US7298693B1 (en) | 1999-10-21 | 2007-11-20 | Tellabs Operations, Inc. | Reverse notification tree for data networks |
AU1338001A (en) * | 1999-10-21 | 2001-04-30 | Tellabs Operations, Inc. | Method and apparatus for detecting mpls network failures |
US7315510B1 (en) * | 1999-10-21 | 2008-01-01 | Tellabs Operations, Inc. | Method and apparatus for detecting MPLS network failures |
US7804767B1 (en) | 1999-10-25 | 2010-09-28 | Tellabs Operations, Inc. | Protection/restoration of MPLS networks |
CA2310872A1 (en) * | 1999-12-22 | 2001-06-22 | Nortel Networks Corporation | Automatic protection switching using link-level redundancy supporting multi-protocol label switching |
JP3356145B2 (en) * | 1999-12-22 | 2002-12-09 | 日本電気株式会社 | Transmission line failure relief method, transmission line failure relief system, storage medium, and router |
US7076559B1 (en) * | 1999-12-28 | 2006-07-11 | Nortel Networks Limited | System, device, and method for establishing label switched paths across multiple autonomous systems |
IT1316315B1 (en) * | 2000-02-01 | 2003-04-10 | Cit Alcatel | METHOD TO IDENTIFY THE CURRENT ROUTE OF THE CIRCUITS IN MS-SPRINGS RINGS FOR TELECOMMUNICATIONS |
EP1126742A1 (en) * | 2000-02-15 | 2001-08-22 | Siemens Aktiengesellschaft | Method for protection switching of transmission equipment in MPLS networks |
JP3498666B2 (en) * | 2000-02-28 | 2004-02-16 | 日本電気株式会社 | Data transfer device, data transfer system, data transfer method, and storage medium |
FI20001317A (en) * | 2000-05-31 | 2001-12-01 | Nokia Networks Oy | Secure routing in a telecommunications network |
EP1298853A4 (en) * | 2000-06-16 | 2003-08-13 | Fujitsu Ltd | Communication device including vpn accomodation function |
US6725393B1 (en) * | 2000-11-06 | 2004-04-20 | Hewlett-Packard Development Company, L.P. | System, machine, and method for maintenance of mirrored datasets through surrogate writes during storage-area network transients |
US7505426B2 (en) * | 2000-12-29 | 2009-03-17 | Tropos Networks | Multi-channel mesh network |
KR100537746B1 (en) * | 2001-01-10 | 2005-12-19 | 학교법인 한국정보통신학원 | Routing Table Configuration for Protection in Optical Mesh Networks |
US7518981B1 (en) * | 2001-02-23 | 2009-04-14 | Cisco Technology, Inc. | Method and system for a graceful reroute of connections on a link |
US20020131431A1 (en) * | 2001-03-14 | 2002-09-19 | Wank Richard B. | Method and apparatus for a network element to support a communication link in a communication network |
US7050392B2 (en) * | 2001-03-30 | 2006-05-23 | Brocade Communications Systems, Inc. | In-order delivery of frames during topology change |
JP4647835B2 (en) * | 2001-05-17 | 2011-03-09 | 富士通株式会社 | Transmission apparatus and failure avoidance method |
US7200108B2 (en) * | 2001-06-29 | 2007-04-03 | International Business Machines Corporation | Method and apparatus for recovery from faults in a loop network |
US7362707B2 (en) * | 2001-07-23 | 2008-04-22 | Acme Packet, Inc. | System and method for determining flow quality statistics for real-time transport protocol data flows |
US7536546B2 (en) * | 2001-08-28 | 2009-05-19 | Acme Packet, Inc. | System and method for providing encryption for rerouting of real time multi-media flows |
US7031311B2 (en) * | 2001-07-23 | 2006-04-18 | Acme Packet, Inc. | System and method for providing rapid rerouting of real-time multi-media flows |
US8406127B2 (en) * | 2001-10-09 | 2013-03-26 | Lockheed Martin Corporation | Precedence-based routing/re-routing |
US7362709B1 (en) * | 2001-11-02 | 2008-04-22 | Arizona Board Of Regents | Agile digital communication network with rapid rerouting |
KR100411134B1 (en) * | 2001-11-27 | 2003-12-18 | 에스케이 텔레콤주식회사 | MPLS based Multicast Routing Protocol Method |
EP1318648B1 (en) * | 2001-12-07 | 2006-02-08 | Nortel Networks Limited | Fast path recovery method in label switching networks, and network arrangement to carry out the method |
US7088679B2 (en) * | 2001-12-12 | 2006-08-08 | Lucent Technologies Inc. | Method and system for providing failure protection in a ring network that utilizes label switching |
US7075886B2 (en) * | 2001-12-21 | 2006-07-11 | Itt Manufacturing Enterprises, Inc. | Method and apparatus for routing information in satellite communication networks |
US7433966B2 (en) * | 2002-01-02 | 2008-10-07 | Cisco Technology, Inc. | Implicit shared bandwidth protection for fast reroute |
US7512650B2 (en) * | 2002-01-11 | 2009-03-31 | Thomson Licensing | Physical layer recovery in a streaming data delivery system |
US20030137971A1 (en) * | 2002-01-22 | 2003-07-24 | Mark Gibson | Telecommunications system and method |
US7984157B2 (en) * | 2002-02-26 | 2011-07-19 | Citrix Systems, Inc. | Persistent and reliable session securely traversing network components using an encapsulating protocol |
US7483399B2 (en) * | 2002-06-05 | 2009-01-27 | David Zelig | Signaling MPLS over RPR rings |
US8798043B2 (en) * | 2002-06-28 | 2014-08-05 | Brocade Communications Systems, Inc. | Apparatus and method for routing traffic in multi-link switch |
US7792991B2 (en) * | 2002-12-17 | 2010-09-07 | Cisco Technology, Inc. | Method and apparatus for advertising a link cost in a data communications network |
US7707307B2 (en) * | 2003-01-09 | 2010-04-27 | Cisco Technology, Inc. | Method and apparatus for constructing a backup route in a data communications network |
US7496650B1 (en) | 2003-01-09 | 2009-02-24 | Cisco Technology, Inc. | Identifying and suppressing transient routing updates |
US7308506B1 (en) | 2003-01-14 | 2007-12-11 | Cisco Technology, Inc. | Method and apparatus for processing data traffic across a data communication network |
US7869350B1 (en) | 2003-01-15 | 2011-01-11 | Cisco Technology, Inc. | Method and apparatus for determining a data communication network repair strategy |
DE10308615A1 (en) * | 2003-02-27 | 2005-06-02 | Siemens Ag | Method and network node for determining multipath transmission paths in a packet-switched communication network |
US7394756B1 (en) | 2003-03-17 | 2008-07-01 | Sprint Communications Company L.P. | Secure hidden route in a data network |
US7224897B1 (en) * | 2003-04-28 | 2007-05-29 | Lucent Technologies Inc. | Method of preconfiguring optical protection trails in a mesh-connected agile photonic network |
US7447150B1 (en) * | 2003-05-16 | 2008-11-04 | Nortel Networks Limited | Automated path restoration for packet telephony |
US7330440B1 (en) | 2003-05-20 | 2008-02-12 | Cisco Technology, Inc. | Method and apparatus for constructing a transition route in a data communications network |
CN1309221C (en) * | 2003-06-08 | 2007-04-04 | 华为技术有限公司 | User facility double returning method based on multi-protocol label exchange |
US7626925B1 (en) | 2003-06-19 | 2009-12-01 | Cisco Technology, Inc. | Methods for finding a merge point node for MPLS fast re-route |
GB0315745D0 (en) * | 2003-07-04 | 2003-08-13 | Novartis Ag | Organic compounds |
US7864708B1 (en) | 2003-07-15 | 2011-01-04 | Cisco Technology, Inc. | Method and apparatus for forwarding a tunneled packet in a data communications network |
US7466661B1 (en) | 2003-09-22 | 2008-12-16 | Cisco Technology, Inc. | Method and apparatus for establishing adjacency for a restarting router during convergence |
US7580360B2 (en) * | 2003-10-14 | 2009-08-25 | Cisco Technology, Inc. | Method and apparatus for generating routing information in a data communications network |
US7554921B2 (en) * | 2003-10-14 | 2009-06-30 | Cisco Technology, Inc. | Method and apparatus for generating routing information in a data communication network |
US7447207B2 (en) * | 2003-10-27 | 2008-11-04 | Hewlett-Packard Development Company, L.P. | Method of and apparatus for transporting SCSI data over a network |
US7443799B2 (en) | 2003-10-31 | 2008-10-28 | Brocade Communication Systems, Inc. | Load balancing in core-edge configurations |
US7619974B2 (en) * | 2003-10-31 | 2009-11-17 | Brocade Communication Systems, Inc. | Frame traffic balancing across trunk groups |
US7428213B2 (en) * | 2003-11-21 | 2008-09-23 | Cisco Technology, Inc. | Method and apparatus for determining network routing information based on shared risk link group information |
US7366099B2 (en) * | 2003-12-01 | 2008-04-29 | Cisco Technology, Inc. | Method and apparatus for synchronizing a data communications network |
GB2410394B (en) * | 2004-01-22 | 2007-04-04 | Agilent Technologies Inc | Service disruption time determination apparatus and method therefor |
US7643407B2 (en) * | 2004-01-29 | 2010-01-05 | Nortel Networks Limited | Method and apparatus for determining protection transmission unit allocation |
US7710882B1 (en) | 2004-03-03 | 2010-05-04 | Cisco Technology, Inc. | Method and apparatus for computing routing information for a data communications network |
US7551599B2 (en) * | 2004-03-29 | 2009-06-23 | Corrigent Systems Ltd. | Layer-3 network routing with RPR layer-2 visibility |
US7042838B1 (en) * | 2004-05-18 | 2006-05-09 | Cisco Technology, Inc. | Method and apparatus for forwarding data in a data communications network |
US7848240B2 (en) * | 2004-06-01 | 2010-12-07 | Cisco Technology, Inc. | Method and apparatus for forwarding data in a data communications network |
US7577106B1 (en) | 2004-07-12 | 2009-08-18 | Cisco Technology, Inc. | Method and apparatus for managing a transition for a class of data between first and second topologies in a data communications network |
WO2006025296A1 (en) * | 2004-08-31 | 2006-03-09 | Nec Corporation | Failure recovery method, network device, and program |
CN100531191C (en) * | 2004-09-06 | 2009-08-19 | 华为技术有限公司 | Method and system for realizing service in transfer layer of NGN network |
US7630298B2 (en) * | 2004-10-27 | 2009-12-08 | Cisco Technology, Inc. | Method and apparatus for forwarding data in a data communications network |
US8464299B1 (en) | 2004-11-17 | 2013-06-11 | Rockstar Consortium Us Lp | Resource conservation for packet television services |
US7664037B2 (en) * | 2005-01-04 | 2010-02-16 | Intel Corporation | Multichannel mesh network, multichannel mesh router and methods for routing using bottleneck channel identifiers |
US7471633B2 (en) * | 2005-01-04 | 2008-12-30 | Intel Corporation | Multichannel, mesh router and methods for path selection in a multichannel mesh network |
US20060291444A1 (en) * | 2005-06-14 | 2006-12-28 | Alvarez Daniel A | Method and apparatus for automatically selecting an RP |
ATE412291T1 (en) * | 2005-06-24 | 2008-11-15 | Koninkl Philips Electronics Nv | COMMUNICATION NETWORK SYSTEM |
CN100385891C (en) * | 2005-11-17 | 2008-04-30 | 华为技术有限公司 | Method and apparatus for realizing group protection in MPLS network |
US20070127395A1 (en) * | 2005-12-07 | 2007-06-07 | Cisco Technology, Inc. | Preventing transient loops in broadcast/multicast trees during distribution of link state information |
US7817580B2 (en) * | 2005-12-07 | 2010-10-19 | Cisco Technology, Inc. | Preventing transient loops in broadcast/multicast trees during distribution of link state information |
CN100421492C (en) * | 2005-12-26 | 2008-09-24 | 华为技术有限公司 | Method and soft exchange equipment for recoverying double-home service |
US20070153763A1 (en) * | 2005-12-29 | 2007-07-05 | Rampolla Richard A | Route change monitor for communication networks |
US7596088B2 (en) * | 2006-01-24 | 2009-09-29 | Corrigent Systems Ltd. | Route selection with bandwidth sharing optimization over rings |
US8693308B2 (en) | 2006-02-10 | 2014-04-08 | Aviat U.S., Inc. | System and method for resilient wireless packet communications |
JP2007274535A (en) * | 2006-03-31 | 2007-10-18 | Fujitsu Ltd | Loop specifying apparatus and loop specifying method in layer 3 network |
US20070268821A1 (en) * | 2006-05-17 | 2007-11-22 | Corrigent Systems, Ltd. | Rpr representation in ospf-te |
JP2008060755A (en) * | 2006-08-30 | 2008-03-13 | Fujitsu Ltd | Method for controlling standby route |
US8111613B2 (en) * | 2006-10-31 | 2012-02-07 | British Telecommunications Public Limited Company | In-layer ethernet p-cycle protection scheme |
IL179026A (en) * | 2006-11-02 | 2011-04-28 | Eci Telecom Ltd | Method for finding protected path in mesh networks |
JP4773981B2 (en) * | 2007-01-12 | 2011-09-14 | 富士通株式会社 | Communication control program |
US8531941B2 (en) | 2007-07-13 | 2013-09-10 | Cisco Technology, Inc. | Intra-domain and inter-domain bridging over MPLS using MAC distribution via border gateway protocol |
US8264953B2 (en) | 2007-09-06 | 2012-09-11 | Harris Stratex Networks, Inc. | Resilient data communications with physical layer link aggregation, extended failure detection and load balancing |
US7898985B1 (en) * | 2008-04-23 | 2011-03-01 | Juniper Networks, Inc. | Composite next hops for forwarding data in a network switching device |
US8363672B2 (en) * | 2008-05-08 | 2013-01-29 | Gilat Satellite Networks Ltd. | Optimization of internet traffic based on application prioritization |
US8656058B2 (en) * | 2008-09-05 | 2014-02-18 | Lsi Corporation | Back-off retry with priority routing |
CN101729419B (en) * | 2009-12-11 | 2012-07-25 | 烽火通信科技股份有限公司 | Ethernet switching chip data forwarding method and broadband access equipment switching protecting method |
US8503428B2 (en) * | 2010-03-18 | 2013-08-06 | Juniper Networks, Inc. | Customized classification of host bound traffic |
JP5515985B2 (en) * | 2010-04-02 | 2014-06-11 | 富士通株式会社 | Monitoring device, failure section identification method, and failure section identification program |
US8774010B2 (en) | 2010-11-02 | 2014-07-08 | Cisco Technology, Inc. | System and method for providing proactive fault monitoring in a network environment |
US8559341B2 (en) | 2010-11-08 | 2013-10-15 | Cisco Technology, Inc. | System and method for providing a loop free topology in a network environment |
US8982733B2 (en) | 2011-03-04 | 2015-03-17 | Cisco Technology, Inc. | System and method for managing topology changes in a network environment |
US8670326B1 (en) | 2011-03-31 | 2014-03-11 | Cisco Technology, Inc. | System and method for probing multiple paths in a network environment |
US8724517B1 (en) | 2011-06-02 | 2014-05-13 | Cisco Technology, Inc. | System and method for managing network traffic disruption |
US8830875B1 (en) | 2011-06-15 | 2014-09-09 | Cisco Technology, Inc. | System and method for providing a loop free topology in a network environment |
US9094329B2 (en) * | 2011-10-09 | 2015-07-28 | Cisco Technology, Inc. | Avoiding micro-loops in a ring topology of a network |
US8948175B2 (en) * | 2011-11-18 | 2015-02-03 | Ciena Corporation | Selecting a link of a link group based on contents of a concealed header |
US9450846B1 (en) | 2012-10-17 | 2016-09-20 | Cisco Technology, Inc. | System and method for tracking packets in a network environment |
US9013985B2 (en) * | 2012-10-19 | 2015-04-21 | Cisco Technology, Inc. | Protection of a bidirectional label switched path |
CN108111417B (en) | 2013-08-15 | 2022-12-27 | 华为技术有限公司 | Method and device for forwarding MPLS data packet |
US9787594B2 (en) | 2015-01-08 | 2017-10-10 | Coriant Operations, Inc. | Procedures, apparatuses, systems, and computer program products for adaptive tunnel bandwidth by using software defined networking |
CN108337181B (en) * | 2017-01-20 | 2021-05-28 | 深圳市中兴微电子技术有限公司 | Method and device for managing congestion of switching network |
WO2021209784A1 (en) * | 2020-04-13 | 2021-10-21 | Eci Telecom Ltd. | Satisfying service demands in data communication networks |
Family Cites Families (12)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US5173689A (en) * | 1990-06-25 | 1992-12-22 | Nec Corporation | Self-distributed logical channel node failure restoring system |
JPH0498917A (en) * | 1990-08-17 | 1992-03-31 | Hitachi Ltd | Switching method without short break for atm transmission line and its circuit |
US5285441A (en) * | 1992-03-17 | 1994-02-08 | At&T Bell Laboratories | Errorless line protection switching in asynchronous transer mode (ATM) communications systems |
JPH0974412A (en) * | 1995-09-04 | 1997-03-18 | Fujitsu Ltd | Aps system for atm exchange network |
CA2161847A1 (en) | 1995-10-31 | 1997-05-01 | Wayne D. Grover | Method for preconfiguring a network to withstand anticipated failures |
US6167025A (en) * | 1996-09-11 | 2000-12-26 | Telcordia Technologies, Inc. | Methods and apparatus for restoring connections in an ATM network |
GB9625020D0 (en) * | 1996-11-29 | 1997-01-15 | Northern Telecom Ltd | Network restoration |
US6324267B1 (en) * | 1997-01-17 | 2001-11-27 | Scientific-Atlanta, Inc. | Two-tiered authorization and authentication for a cable data delivery system |
US6507561B1 (en) * | 1997-03-12 | 2003-01-14 | Worldcom, Inc. | Telecommunications network distributed restoration method and system |
JP3751755B2 (en) * | 1998-08-06 | 2006-03-01 | 富士通株式会社 | ATM network PVC rerouting method and network management system |
US6456626B1 (en) * | 1998-12-21 | 2002-09-24 | Nortel Networks Limited | Method of virtual circuit reconnection without loss of call session |
US6549513B1 (en) * | 1999-10-12 | 2003-04-15 | Alcatel | Method and apparatus for fast distributed restoration of a communication network |
-
1999
- 1999-08-20 US US09/378,141 patent/US6535481B1/en not_active Expired - Lifetime
-
2000
- 2000-06-02 CA CA002311105A patent/CA2311105C/en not_active Expired - Lifetime
- 2000-06-26 US US09/603,355 patent/US6901048B1/en not_active Expired - Fee Related
- 2000-08-18 EP EP00202894A patent/EP1079570B1/en not_active Expired - Lifetime
- 2000-08-18 DE DE60032073T patent/DE60032073T2/en not_active Expired - Lifetime
-
2003
- 2003-01-27 US US10/351,780 patent/US7486615B2/en not_active Expired - Fee Related
-
2008
- 2008-12-22 US US12/341,603 patent/US7760623B2/en not_active Expired - Fee Related
Also Published As
Publication number | Publication date |
---|---|
DE60032073T2 (en) | 2007-04-12 |
EP1079570B1 (en) | 2006-11-29 |
US6901048B1 (en) | 2005-05-31 |
US20030152025A1 (en) | 2003-08-14 |
DE60032073D1 (en) | 2007-01-11 |
US7486615B2 (en) | 2009-02-03 |
CA2311105A1 (en) | 2001-02-20 |
US20090161537A1 (en) | 2009-06-25 |
EP1079570A2 (en) | 2001-02-28 |
EP1079570A3 (en) | 2002-12-04 |
US7760623B2 (en) | 2010-07-20 |
US6535481B1 (en) | 2003-03-18 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
CA2311105C (en) | Network data routing protection cycles for automatic protection switching | |
US8134917B2 (en) | Automatic protection switching using link-level redundancy supporting multi-protocol label switching | |
US20210176178A1 (en) | Pseudowire protection using a standby pseudowire | |
US8040792B2 (en) | Techniques for determining local repair connections | |
ES2363410T3 (en) | METHOD, DEVICE AND SYSTEM FOR TRAFFIC SWITCHING IN MULTIPROTOCOL SWITCHING TRAFFIC ENGINEERING BY LABEL. | |
US7697417B2 (en) | Methods and devices for re-routing MPLS traffic | |
CN101953124B (en) | Constructing repair paths around multiple non-available links in a data communications network | |
US8665711B2 (en) | Fast restoration for provider edge node and access link failures | |
US20020116669A1 (en) | System and method for fault notification in a data communication network | |
US20080304407A1 (en) | Efficient Protection Mechanisms For Protecting Multicast Traffic in a Ring Topology Network Utilizing Label Switching Protocols | |
US20080285442A1 (en) | Vpls Remote Failure Indication | |
US6848062B1 (en) | Mesh protection service in a communications network | |
US20090292942A1 (en) | Techniques for determining optimized local repair paths | |
JP4297636B2 (en) | Transmission system | |
EP2658177B1 (en) | Method for detecting tunnel faults and traffic engineering node | |
Papán et al. | Overview of IP fast reroute solutions | |
US20060077922A1 (en) | System method & apparatus for routing traffic in a telecommunications network | |
US7061859B2 (en) | Fast protection in ring topologies | |
Lin et al. | Redirection based recovery for MPLS network systems | |
IL191454A (en) | Vpls remote failure indication |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
EEER | Examination request |