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

Abstract: A method is disclosed for sharing a transport connection in a host having two or more processors that exchange limited inter-processor communications. Ranges of transport sequence numbers are assigned to the processors of the host, and a range assigned to a particular processor does not overlap with any other range assigned to any other processor. An outbound message is sent over the transport connection from a processor of the host, where the message includes a transport sequence number selected from the range assigned to that processor. An inbound message is received at a designated processor of the host that is configured to receive all inbound messages sent to the host over the transport connection.

Abstract: A method is disclosed of managing a network component change in a data communications network having as components nodes and links defining a pre-change topology. A transitioning node forwards all data assigned to the pre-change topology via the pre-change topology. The transitioning node defines a post-change topology. The transitioning node transitions from the pre-change to the post-change topology. Data assigned to the pre-change topology is assigned to the post-change topology, and the transitioning node forwards the data via the post-change topology.

Abstract: A method of forwarding data in a data communications network having a plurality of nodes comprises the steps, performed at a repairing node, of computing the repair path around a network component to a target node and forwarding data along the repair path. The computing step comprises the step of computing an intermediate node reachable by the repairing node and from which the target node can be reached. The forwarding step includes the step of constructing a Multi-Protocol Label Switching (MPLS) packet for forwarding to the intermediate node.

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.