Computing repair path information
AssigneeCisco Technology, Inc.
InventorsStewart Frederick Bryant, Ian Michael Charles Shand
Life of this patent
Estimating the term…
Abstract
An apparatus and method is described for computing repair path information around a failure component in a data communications network having a components nodes and links therebetween. Where, according to a routing protocol, a node sends to a neighbor node a metric indicative of reachability of a destination node, the protocol requiring differentiated action by the node if the route to the destination node includes the neighbor node, the apparatus is arranged to compute a repair path to the destination node via candidate nodes comprising only neighbor nodes to the apparatus not requiring differentiated action relative to the apparatus.
Claims22
An apparatus for computing repair path information around a failure component in a data communication network having as components nodes and links there between, the apparatus comprising:
- A processor and one or more storage media encoded with logic for execution and which when executed is configured to:
- perform a routing protocol including sending to a neighbor node a metric indicative of reachability of a destination node, and performing differentiated action if the route to the destination node includes the neighbor node, wherein the differentiated action comprises a split horizon or a split horizon with poisoned reverse;
- compute a repair path to the destination node via candidate nodes comprising only neighbor nodes to the apparatus requiring that not require the differentiated action relative to the apparatus and not comprising neighbor nodes that require the differentiated action relative to the apparatus;
- and
- store the repair path for use in routing data around the failure component.
An apparatus for computing repair path information around a failure component in a data communication network having as components nodes and links there between, the apparatus comprising:
- means for performing a routing protocol including sending to a neighbor node a metric indicative of reachability of a destination node, and performing differentiated action if the route to the destination node includes the neighbor node, wherein the differentiated action comprises a split horizon or a split horizon with poisoned reverse;
- means for computing a repair path to the destination node via candidate nodes comprising only neighbor nodes to the apparatus that not require the differentiated action relative to the apparatus and not comprising neighbor nodes that require the differentiated action relative to the apparatus;
- and
- means for storing the repair path for use in routing data around the failure component.
A method of computing repair path information around a failure component in a data communications network having as components nodes and links between the nodes, wherein one or more of the nodes execute a routing protocol wherein a node sends to a neighbor node a metric indicative of reachability of a destination node, and wherein the node performs differentiated action if the route to the destination node includes the neighbor node, the method comprising:
- a processor identifying as candidate nodes for a repair path to a destination node only neighbor nodes not requiring differentiated action, wherein the differentiated action comprises a split horizon or a split horizon with poisoned reverse;
- the processor computing a repair path via an identified candidate node;
- the processor storing the repair path for use in routing data around the failure component.
A computer readable storage medium comprising one or more sequences of instructions for computing repair path information around a failure component in a data communications network having as components nodes and links between the nodes, wherein one or more of the nodes execute a routing protocol wherein a node sends to a neighbor node a metric indicative of reachability of a destination node, and wherein the node performs differentiated action if the route to the destination node includes the neighbor node, and which instructions, when executed by one or more processors, cause the one or more processors to perform the steps of:
- identifying as candidate nodes for a repair path to a destination node only neighbor nodes not requiring differentiated action, wherein the differentiated action comprises a split horizon or a split horizon with poisoned reverse;
- computing a repair path via an identified candidate node;
- storing the repair path for use in routing data around the failure component.
Dependencies are inferred from the claim text.