Abstract: A method of constructing a backup path in an autonomous system (AS) for failure of a first inter-AS link serving a first set of prefixes is described. The method comprises identifying an alternate inter-AS link serving said plurality of prefixes and constructing a tunnel thereto.

Abstract: A method is disclosed for constructing a backup route from a source node around an adjacent component. The source node derives a first set of nodes reachable from it without traversing the adjacent component and a second set of nodes from which a neighbor node of adjacent components is reachable without traversing the adjacent component. The source node then constructs a backup route via an intermediate node in the intersection of the first and second sets.

Abstract: A method is disclosed for constructing a repair path for multicast data around a non-available component in a data communications network having as components nodes and links therebetween. The method comprises the step performed at a repairing node, of receiving from a notifying node in a network, a notification identifying the notifying node and components through which the notifying node can be reached. The method further comprises the steps of deriving, from the notification, a network repair address for use in the event of non-availability of a component identified in the notification; and constructing a repair path for multicast data for the repair address.

Abstract: A method and apparatus are disclosed for generating routing information in a data communications network. A first network element (such as a router) receives information relating to a second network element, such as another node or a network link. In response, the first network element determines whether the information relating to the second network element indicates a change in the network. When information relating to a second network element indicates a change in the network, the first network element determines a new shortest path through the network from the first network element for each network element in the network. After a delay, the first network element updates routing information for the first network element based on the new shortest path for the first network element. Preferably the delay is proportional to the distance of the first network element from the second network element.