Method and apparatus for constructing a transition route in a data communications network
AssigneeCisco Technology, Inc.
InventorsStewart Frederick Bryant, Ian Michael Charles Shand
Life of this patent
Estimating the term…
Abstract
A method is described of constructing a transition route in a data communication network having as components nodes and links. Upon receipt of a transition notification identifying a first component a non-neighboring node constructs a transition route around the first component.
Claims32
A method of constructing a transition route in a data communications network having as components nodes and links defining a network topology, around a first component comprising the steps of:
- receiving a transition notification identifying the first component;
- and
- constructing a transition route around the first component from a non-neighboring node thereof to a target node, in which a first set of nodes reachable from the non-neighboring node without traversing the first component is derived from the topology, a second set of nodes from which the target node is reachable without traversing the first component is derived from the topology and the transition route is constructed from the non-neighboring node to the target node including an intermediate node in an intersection of the first and second sets of nodes.
An apparatus for constructing a transition route in a data communications network having as components nodes and links defining a network topology, around a first component comprising:
- means for receiving a transition notification identifying the first component;
- and
- means for constructing a transition route around the first component from a non-neighboring node thereof to a target node, in which a first set of nodes reachable from the non-neighboring node without traversing the first component is derived from the topology, a second set of nodes from which the target node is reachable without traversing the first component is derived from the topology and the transition route is constructed from the non-neighboring node to the target node including an intermediate node in an intersection of the first and second sets of nodes.
Dependencies are inferred from the claim text.