Forwarding data in a data communications network

An apparatus for forwarding data in a data communications network having as components nodes and links there between, the apparatus being arranged to forward data to a receiving node via a primary path the apparatus further having a repair capability of computing a repair path around a failure component in the primary path to an address having a repair identifier for the receiving node not via the failure component, the apparatus being arranged to forward data to the receiving node via the repair path upon failure of the failure component if a node in the primary path to the receiving node does not have said repair capability.

CROSS-REFERENCE TO RELATED APPLICATIONS

This application is related to co-pending patent application U.S. Ser. No. 11/064,275, filed Feb. 22, 2005, entitled “Method and Apparatus for Constructing a Repair Path Around a Non-Available Component in a Data Communications Network” of Michael Shand et al.

TECHNICAL FIELD

The present disclosure generally relates to data communications networks. The disclosure relates more specifically to an apparatus and method for forwarding data in a data communications network.

BACKGROUND

In computer networks such as the Internet, packets of data are sent from a source to a destination via a network of elements including links (communication paths such as telephone or optical lines) and nodes (for example, routers or switches directing the packet along one or more of a plurality of links connected to it) according to one of various routing protocols.

One class of routing protocol is a link state protocol. A link state protocol relies on a routing algorithm resident at each node. Each node on the network advertises, throughout the network, links to neighboring nodes and provides a cost associated with each link, which can be based on any appropriate metric such as link bandwidth or delay and is typically expressed as an integer value. A link may have an asymmetric cost, that is, the cost in the direction AB along a link may be different from the cost in a direction BA. Based on the advertised information in the form of a link state packet (LSP) each node constructs a link state database (LSDB), which is a map of the entire network topology, and from that constructs generally a single optimum route to each available node based on an appropriate algorithm such as, for example, a shortest path first (SPF) algorithm. As a result a “spanning tree” (SPT) is constructed, rooted at the node and showing an optimum path including intermediate nodes to each available destination node. The results of the SPF algorithm are stored in a routing information base (RIB) and based on these results the forwarding information base (FIB) or forwarding table is updated to control forwarding of packets appropriately. When there is a network change an LSP representing the change is flooded through the network by each node adjacent the change, each node receiving the LSP sending it to each adjacent node.

As a result, when a data packet for a destination node arrives at a node the node identifies the optimum route to that destination and forwards the packet to the next node along that route. The next node repeats this step and so forth.

In normal forwarding each node decides, irrespective of the node from which it received a packet, the next node to which the packet should be forwarded. In some instances this can give rise to a “loop.” In particular a loop can occur when the databases (and corresponding forwarding information) are temporarily de-synchronized during a routing transition, that is, where because of a change in the network, a new LSP is propagated that induces creating a loop in the RIB or FIB. As an example, if node A sends a packet to node Z via node B, comprising the optimum route according to its SPF, a situation can arise where node B, according to its SPF determines that the best route to node Z is via node A and sends the packet back. This can continue for as long as the loop remains, although usually a node will impose on each packet a maximum hop count, after which the packet will be discarded. Such a loop can be a direct loop between two nodes or an indirect loop around a circuit of nodes.

DETAILED DESCRIPTION

Embodiments are described herein according to the following outline:1.0 General Overview2.0 Structural and Functional Overview3.0 Apparatus and method for forwarding data in a data communications network4.0 Implementation Mechanisms—Hardware Overview5.0 Extensions and Alternatives

1.0 General Overview

In one embodiment, an apparatus for forwarding data in a data communications network having as components nodes and links therebetween, the apparatus being arranged to forward data to a receiving node via a primary path the apparatus further having a repair capability of computing a repair path around a failure component in the primary path to an address having a repair identifier for the receiving node not via the failure component, the apparatus being arranged to forward data to the receiving via the repair path upon failure of the failure component if a node in the primary path to the receiving node does not have said repair capability.

In other aspects, the invention encompasses a computer-implemented method and a computer-readable medium configured according to the foregoing arrangement.

2.0 Structural and Functional Overview

FIG. 1illustrates a network. The network includes a primary node P, reference numeral200, a source node S, and nodes, A, B and C, reference numerals202,204,206,208each connected to node P via respective links210,212,214,216. A further node D, reference numeral218is connected to node B via link220.

In addition to the standard addresses assigned to each node, each interface in the network is assigned an additional repair address. This is termed here the “notvia address” although the term is arbitrary and non-limiting and is adopted purely for convenience. A packet addressed to a notvia address must be delivered to the router with that address, and not via the neighboring router on the interface to which that address is assigned.

For example the interfaces from node P to nodes S, A, B, C by respective links210,212,214,216, may have addresses P ā, Pb, Pband Ps. Similarly the interfaces from nodes A, B, C and S to node P via links212,214,216,210respectively in the opposite direction have addresses Ap, Bp, Cp, Sp.

To repair a failure, a repairing node, for example node S, encapsulates the packet to the notvia address of the node interface on the far side of the failure. The nodes on the repair path then know to which node they must deliver the packet, and which network component they must avoid.

Referring toFIG. 1, assuming that S has a packet for some destination D that it would normally send via P and B, and that S suspects that P has failed, S encapsulates the packet to Bp. The path from S to Bpis, according to the semantic the shortest path from S to B not going via P. If the network contains a path from S to B that does not transit router P, then the packet will be successfully delivered to B. For example the packet may be forwarded along path222to node X,224, and then path226to node D. Because node X has calculated a repair path for Bpit will forward the encapsulated packet correctly. When the packet addressed to Bparrives at B, B removes the encapsulation and forwards the repaired packet towards its final destination, node D.

The approach can be further understood with reference toFIG. 2.FIG. 2illustrates a method of constructing a repair path. In block300node P advertises, using a notification such as an LSP, its adjacencies A, B, C, S and its associated notvia addresses Pā, Pb, Pc, Ps. It will be appreciated that all other nodes, acting as notifying node will also issue similar LSPs. As a result not only can appropriate forwarding tables be constructed, but also notvia addresses are available for each node in the event that it fails or otherwise becomes a non-available node, in which case the notvia address can be used as the repair address. Accordingly, in block302, all participating nodes compute their next hops not only for each normal (non-failed) address but also for each notvia address. As a result each node constructs a repair path around each other node in the network and stores it against the corresponding notvia address.

In the event that node P subsequently fails or otherwise becomes unavailable, in block304, then in block306the neighbor nodes detect or are notified of the failure in any appropriate manner. Where a neighbor node subsequently receives a packet which it would have sent to the failed component as its next hop then, acting as a repairing node, the neighbor node identifies a repair end point or target to which it must tunnel such a packet to reach its subsequent destination in block308. In the example given above, the repairing node is node S, and repair end point is node B for a packet with destination D. In particular this is identified by the respective notvia address Bp. As a result the node S tunnels the packet along the repair path to Bpin block310. In block312each next hop forwards the encapsulated packet towards the notvia address Bp, for example node X inFIG. 1forwards the packet correctly. Because all of the participating nodes have calculated a path to the notvia address using the same repair topology, a packet is forwarded using normal IP forwarding without the requirement for extensions to the forwarding code. In block314the packet arrives at the repair end point which decapsulates it and forwards the original packet towards its destination, again using normal IP forwarding for destination D in the example described.

To allow each enabled node on the network to construct a repair topology for a failed network component (link or node) each node must advertise its notvia addresses as well as the other relevant information stored in its LSP.FIG. 3is a schematic representation of information carried in an LSP.FIG. 3schematically shows the information contained in an LSP issued by node P. In addition to advertisement of each neighbor and its associated metric (e.g. the cost associated with the respective link) further information is provided. For example where the neighbor information is provided in column400and the associated metric in column402, in addition a notvia address for each neighbor is provided in column404. The notvia address is associated with the respective neighbor such that the entry against neighbor A effectively designates Pā. As long as the semantic is recognized by nodes receiving the LSP then the notvia address itself can take the form of a standard IP address shown schematically here as a.a.a.a representing Pāand so forth. It will be seen that, as every node in the network provides similar information, each node can derive repair paths for every notvia address on the network.

As a result, referring once again to the example described with reference toFIG. 1in which node S encapsulates a packet destined for node D to Pbin the event of failure of node P, every node more generally calculates the path it would use in the event of any possible node failure. Each node therefore fails every other router in the network, one at a time, and calculates its own best route to each of the neighbors of that node. In other words, again with reference toFIG. 1, some router X will consider each router in turn to be P, fail P, and then calculate its own route to each of the notvia P addresses advertised by the neighbors of P. i.e. X calculates its route to Sp, Ap, Bpand Cp, in each case, notvia P.

FIG. 4illustrates a forwarding table constructed at a neighbor node to a non-available node. Referring toFIG. 4, illustrating relevant parts of the forwarding table derived at node S, it will be seen that for each address (column500) the next hop (column502) is derived, a notvia address (column504) is designated and a corresponding repair address (column506) is also implemented. For example where the destination is node B and the next hop is calculated as node P then, in addition, the repair address Bpto which the packet will be tunneled is stored together with the corresponding repair next hop. In this case this is the first hop along the path222from node S to node X in the example described above with reference toFIG. 1, indicated as node Z, reference numeral228along link230from node S. In the case of packets destined for node D, the normal next hop is node P and the repair address is Bpas a result of which the repair next hop is once again node Z for packets encapsulated to Bp. In the case of node A as destination address, the next hop is node P and the repair address is Approviding some repair next hop Ω1(not shown). The repair addresses in node S's forwarding table will always be to a neighbor's neighbor, i.e. the repair tunnel endpoint. However it will be seen that where the normal address in column500is a notvia address, for example Cp, then although a next hop is provided as node Y, reference numeral232along link234from node S, a repair address and repair next hop are not provided as described in more detail below. As a result, node S will forward a packet using normal forwarding to a notvia address, when it lies in another node's repair path, but will not instigate a repair tunneled to a notvia address when the incoming packet is already destined for a notvia address.

When using such a notvia repair mechanism to repair a failure in the network whether a link or node, the repair is usually made by the node adjacent to the failed component. In some cases, however, the node adjacent to the failed component may not have the capability to make the repair. For example it may be deficient in hardware support or software. The following approach addresses the preceding issues.

In overview, a method and apparatus for forwarding data in a data communications network according to the approach described herein can be understood with reference toFIG. 5andFIG. 6.FIG. 5illustrates a network for a high level application of approach described herein;FIG. 6illustrates a high level view of an approach for forwarding data.

Referring first toFIG. 5, in the simple network configuration shown a first node P1(reference numeral500) can be, for example, a source node or a forwarding node for a data packet and a second node P2, reference numeral502, can be a receiving node or destination node for the data packet. Connectivity between the provider edges is achieved via nodes W1, X1, Y1, Z1, reference numerals506,508,510,512. In the case, for example, that node Y1is notvia repair capable and node X1is not notvia repair capable then node W1acting as repairing node can create a notvia repair path for failure of a link514between nodes X1and Z1in the event of failure of link514using node Y1. As can be seen in more detail below, the approach can be implemented by any notvia repair capable node allowing a notvia repair to be put in place by one or more alternative nodes to a neighbor node (such a node W1) to a failure even if the neighbor itself does not support initiating a notvia repair. Accordingly packets can be tunneled around the failure by any upstream router provided that it is aware of the failure.

Turning toFIG. 6the steps performed at an apparatus for forwarding data comprising a repair node can be further understood. A repairing node which may be a source node or a node along a path between a source and destination node is arranged to forward data to a receiving node which may be the packet destination or a node on the path to a packet destination via a primary path. However a node between the repairing node and the receiving node in the primary path does not have notvia repair capability, that is, the capability of computing a repair path around a failure component in the primary path to an address having a repair identifier, such as a repair address for the receiving node and not via the failure component.

Accordingly at step600the repairing node monitors the failure component in order to detect a failure. The failure component is typically the node or link adjacent to the receiving node through which data packets would pass on the primary path from the repairing node.

Under normal operation of notvia repairs, the repairing node would not be made aware of the failure until it was required to converge the network as it is not adjacent to the failure (as there must be at least a non-capable node between it and the failure component). However monitoring can be set up in any appropriate manner for example by running a multi-hop bi-directional forwarding detection (BFD) session across the failure component to the receiving node.

At step602, upon detecting failure of the failure component, the monitoring or repairing node can begin tunneling packets for destinations which would have traversed the failure using the appropriate notvia repair address. Because all of the routers in the network will have computed their own repair paths for that notvia address (based on a topology excluding the failure component and any nodes—such as node A—incapable of performing a notvia calculation), the packet will be tunneled to the receiving node at the far side of the failure, decapsulated there and forwarded on normally to the destination even though it was injected into the notvia path by a node not adjacent to the failure.

The repairing node can be any notvia-capable node in the network and may not even be the nearest notvia capable node to the failure as described in more detail below. The repair address can take any form of address having a repair identifier. According to a further aspect, traffic entering the network via a non notvia capable router can be repaired, once an adjacent failure is detected at the router, by forwarding to a notvia capable router which will then inject it into a notvia repair path.

As a result of the arrangement described herein, a node or router with critical traffic can form a fast re-route repair around a downstream component which is not notvia capable.

3.0 Apparatus and Method for Forwarding Data in a Data Communications Network

FIG. 7illustrates a network for describing in more detail the approach ofFIG. 6;FIG. 8illustrates the approach ofFIG. 6in more detail;FIG. 9Aillustrates a forwarding table constructed according to the approach herein at a first repairing node;FIG. 9Billustrates a forwarding table constructed at a second repairing node.

Referring firstly toFIG. 7a network in relation to which the approach described herein can be implemented includes nodes A, B, C, D, reference numerals700,702,704,706, nodes X, Y, Z reference numerals708,710,712and node R reference numeral714. Node A is connected to nodes B, C and X by links720,722and724respectively. Node B is connected to nodes R and Z by links726,728respectively. Node D is connected to node C by link730and node Y is connected to nodes X and Z by links732,734respectively. All links have a cost1such that for data packets with destination node R, the primary route from node D and C is via nodes A and B. In order to protect link720between nodes A and B, node B would advertise its notvia address Ba and nodes A, C, D, X, Y, Z would compute their repair path for Ba in the manner described above with reference toFIG. 1. However in the event that node A does not have notvia repair capability then other nodes with notvia capability can perform proxy notvia repair in the manner described herein. Such nodes can include neighbor nodes such as nodes C and X as well as nodes yet further upstream such as node D.

The approach can be further understood with reference toFIG. 8. At step800, performed at a repairing node such as proxy repair node C or D, a non repair capable node such as node A is detected. For example this can be on the basis of monitoring of capability advertisements of adjacent or other nodes. Normally in notvia schemes this would indicate that the adjacent node was protecting the component using notvia. If, however, it does not indicate that it is protecting the component (for example node B or link AB as failure component) one or more other nodes can perform the notvia function, for example node C or node D.

At step802the repairing node invokes a multi-hop path validation protocol such as a multi-hop BFD session across the non-capable component to the downstream router for example the immediate node, node B. BFD sessions are known to the skilled reader and described for example in the document “draft-ietf-bfd-base,” which is available at the time of this writing in the folder /wg/bfd of the domain “tools.ietf.org” on the Internet, such that detailed description is not required here. The session must use one of the normal addresses of the downstream router, that is, along the primary path, so that failure of link AB will cause the BFD session to fail indicating that repair is required.

At step804the repairing node computes destinations reachable via the failure component, link720as a primary path. Referring toFIG. 7this includes node B itself and nodes R and nodes Z but it will be appreciated that any level of complexity and connectivity of network can implemented in this manner. For example the set of destinations which would normally traverse the failure component can be obtained by recording this information during running of the normal SPF algorithm.

At step806the forwarding tables at the repairing node are updated with the repair address for example the notvia address and next hop per destination.FIG. 9Ashows a forwarding table installed at node C for destination R andFIG. 9Bshows a forwarding table installed for destination R at node D. Referring firstly toFIG. 9A, therefore, for destination R, along the primary path the next hop is node A. The relevant not via repair address is Ba and the repair next hop (assuming appropriate connectivity-not shown) is node X.

Referring toFIG. 9B, at node D the primary path next hop for destination R is node C and the next hop for repair address Ba is node C as well. It will be noted that node A may be non notvia capable in the sense that it can compute notvia forwarding routes but cannot institute a repair (e.g. encapsulating and forwarding a packet to a repair address) itself. In this case the repairing node still needs to compute and instigate a repair path but can include node A in its not via calculations.

Typically the closest router, that is the immediate neighbor of the incapable router which would send traffic over the potentially failing component which is node C in the case of non repair capable node A, is the one which will be required to perform the proxy repair mechanism described herein. However the mechanism herein also works if other routers also perform this action. For example if node C and D both provide proxy repair, acting as repairing nodes for link720, then upon failure of link720both BFD sessions will fail and both nodes C and D will initiate notvia repairs. However the notvia repair provided by node C will result in node D's BFD session beginning to work again and hence node D will withdraw its notvia repair. Indeed in general more than one router will be required to protect a remote component because traffic may arrive at the adjacent node from multiple other routers, (for example in the case of node A, both nodes X—assuming other connectivity and node C).

Referring toFIG. 8, at step808the repairing node monitors for and detects any failure in the protected component, failure component720in the present example, and at step810the repairing node then invokes the appropriate repair for packets destined for a destination reachable by the primary path over the failure component. In particular any such data packets are forwarded to the repair notvia address. Of course the repair can be torn down once the network has reconverged at step812.

It will be appreciated that these steps setout above with reference toFIG. 8can be performed in any appropriate order. For example the BFD session can be invoked only once the destinations reachable via the failure component have been computed to establish whether any such session is required.

According to the method described above, all traffic can be repaired except that entering the network at the incapable router (for example node A) itself. However this traffic can be protected in the manner shown inFIG. 10.FIG. 10illustrates the approach described herein at a non-repair capable node. An example of a non-repair capable router for purposes of description may be node A. At step1000the non-repair capable router detects the relevant failure, for example failure of link720. At step1002the node rebuilds its forwarding table, for example its FIB, to reflect the failure such that its next hop is a repair capable neighbor, preferably the repair capable neighbor furthest downstream in the repair path. That router will then inject the traffic into its notvia repair as normal. This can happen quickly as since it doesn't involve any communication with any other nodes.

The approach described herein can be implemented in relation to link failure or node failure as appropriate. For example in the case where node B comprises the failure component and node A is not repair capable then node C will seek other connectivity (not shown) providing a not via repair path for nodes R and Z.

Alternative repair mechanisms such as loop free alternates (LFA) may be in place LFAs comprise neighbor nodes to a repairing node that have a cost to a destination node that is less than the cost of the neighbor node to the repairing node plus the cost from the repairing node to the destination node. LFAs can be implemented to replace notvia repairs where destinations are served by such alternative repairs. Any notvia repair capable node could additionally perform LFA computations for non-adjacent failures if required.

Although the discussion above is provided in the context of a single routing domain or autonomous system, a similar approach can be implemented across multiple domains using for example border gateway protocol (BGP) using the path vector to identify which destinations require repairing for a given failure component.

Similarly, although the discussion above relates to a notvia repair mechanism where the repair address comprises a notvia repair address, the approach could equally well be implemented in a multitopology routing context where different topologies are constructed and overlaid on the base topology shown using different address spaces for each topology. In that case the repair address would comprise an address in an alternative topology to the base topology and hence having a repair identifier, for example, a repair topology omitting the failure component. Of course the not via repair path itself can be computed in any appropriate manner.

The various steps and approaches discussed herein however can be implemented in any appropriate manner in software, hardware or firmware. Detection of non-repair capable nodes can be performed in any appropriate manner and monitoring of the failure component similarly can be performed using BFD or any other appropriate monitoring approach. Installation and invoking of the repair can be implemented at each node by appropriate modification of the routing and forwarding algorithm and any steps performed at a non-capable router upon detection of failure can be implemented in any appropriate manner.

FIG. 11is a block diagram that illustrates a computer system40upon which the method may be implemented. The method is implemented using one or more computer programs running on a network element such as a router device. Thus, in this embodiment, the computer system140is a router.

Computer system140includes a bus142or other communication mechanism for communicating information, and a processor144coupled with bus142for processing information. Computer system140also includes a main memory146, such as a random access memory (RAM), flash memory, or other dynamic storage device, coupled to bus142for storing information and instructions to be executed by processor144. Main memory146may also be used for storing temporary variables or other intermediate information during execution of instructions to be executed by processor144. Computer system140further includes a read only memory (ROM)148or other static storage device coupled to bus142for storing static information and instructions for processor144. A storage device150, such as a magnetic disk, flash memory or optical disk, is provided and coupled to bus142for storing information and instructions.

A communication interface158may be coupled to bus142for communicating information and command selections to processor144. Interface158is a conventional serial interface such as an RS-232 or RS-422 interface. An external terminal152or other computer system connects to the computer system140and provides commands to it using the interface158. Firmware or software running in the computer system140provides a terminal interface or character-based command interface so that external commands can be given to the computer system.

A switching system156is coupled to bus142and has an input interface and a respective output interface (commonly designated159) to external network elements. The external network elements may include a plurality of additional routers160or a local network coupled to one or more hosts or routers, or a global network such as the Internet having one or more servers. The switching system156switches information traffic arriving on the input interface to output interface159according to pre-determined protocols and conventions that are well known. For example, switching system156, in cooperation with processor144, can determine a destination of a packet of data arriving on the input interface and send it to the correct destination using the output interface. The destinations may include a host, server, other end stations, or other routing and switching devices in a local network or Internet.

The computer system140implements as a router acting as a, repairing node, non-repair capable node or intermediate node the above described method of forwarding data. The implementation is provided by computer system140in response to processor144executing one or more sequences of one or more instructions contained in main memory146. Such instructions may be read into main memory146from another computer-readable medium, such as storage device150. Execution of the sequences of instructions contained in main memory146causes processor144to perform the process steps described herein. One or more processors in a multi-processing arrangement may also be employed to execute the sequences of instructions contained in main memory146. In alternative embodiments, hard-wired circuitry may be used in place of or in combination with software instructions to implement the method. Thus, embodiments are not limited to any specific combination of hardware circuitry and software.

The term “computer-readable medium” as used herein refers to any medium that participates in providing instructions to processor144for execution. Such a medium may take many forms, including but not limited to, non-volatile media, volatile media, and transmission media. Non-volatile media includes, for example, optical or magnetic disks, such as storage device150. Volatile media includes dynamic memory, such as main memory146. Transmission media includes coaxial cables, copper wire and fiber optics, including the wires that comprise bus142. Transmission media can also take the form of wireless links such as acoustic or electromagnetic waves, such as those generated during radio wave and infrared data communications.

Various forms of computer readable media may be involved in carrying one or more sequences of one or more instructions to processor144for execution. For example, the instructions may initially be carried on a magnetic disk of a remote computer. The remote computer can load the instructions into its dynamic memory and send the instructions over a telephone line using a modem. A modem local to computer system140can receive the data on the telephone line and use an infrared transmitter to convert the data to an infrared signal. An infrared detector coupled to bus142can receive the data carried in the infrared signal and place the data on bus142. Bus142carries the data to main memory146, from which processor144retrieves and executes the instructions. The instructions received by main memory146may optionally be stored on storage device150either before or after execution by processor144.

Interface159also provides a two-way data communication coupling to a network link that is connected to a local network. For example, the interface159may be an integrated services digital network (ISDN) card or a modem to provide a data communication connection to a corresponding type of telephone line. As another example, the interface159may be a local area network (LAN) card to provide a data communication connection to a compatible LAN. Wireless links may also be implemented. In any such implementation, the interface159sends and receives electrical, electromagnetic or optical signals that carry digital data streams representing various types of information.

The network link typically provides data communication through one or more networks to other data devices. For example, the network link may provide a connection through a local network to a host computer or to data equipment operated by an Internet Service Provider (ISP). The ISP in turn provides data communication services through the world wide packet data communication network now commonly referred to as the “Internet”. The local network and the Internet both use electrical, electromagnetic or optical signals that carry digital data streams. The signals through the various networks and the signals on the network link and through the interface159, which carry the digital data to and from computer system140, are exemplary forms of carrier waves transporting the information.

Computer system140can send messages and receive data, including program code, through the network(s), network link and interface159. In the Internet example, a server might transmit a requested code for an application program through the Internet, ISP, local network and communication interface158. One such downloaded application provides for the method as described herein.

The received code may be executed by processor144as it is received, and/or stored in storage device150, or other non-volatile storage for later execution. In this manner, computer system140may obtain application code in the form of a carrier wave.

5.0 Extensions and Alternatives

Any appropriate routing protocol and mechanism and forwarding paradigm can be adopted to implement the invention. The method steps set out can be carried out in any appropriate order and aspects from the examples and embodiments described juxtaposed or interchanged as appropriate.

The apparatus described herein can be implemented in any connectionless hop-by-hop network, where each router makes an autonomous routing decision, for example a pure IP network.