Foundry Networks, Inc.

Brocade Communications Systems, Inc.

Mohammad Hanif

Lisa Hong Nguyen

Ivy Hsu

Minjie Dai

Sandeep G Bhat

Dilip Kumar

Sundeep Kumar Singh

Sriniwas Polavarapu

Techniques for reducing the latency in performing a failover from a protected connection to its backup connection when a network event is detected affecting the protected connection. In an MPLS network, techniques are provided for failing a protected LSP to a backup LSP in a fast and efficient manner. In one embodiment, the faster failover is facilitated by storing protected LSPs and their backup LSPs information in the data plane, such as locally on a linecard.

Techniques for performing a failover from a protected connection to a backup connection

Techniques for configuring a local repair connection for a protected connection including determining a path for the local repair connection. The path traversed by a local repair connection starts at a node in the path associated with the protected connection and ends at a merge point node in the path associated with the protected connection that is downstream from the start node. In one embodiment, the merge point node may even be more than two hops downstream from the start node in the path associated with the protected connection. The local repair path may include zero or more nodes that are not included in the path associated with the protected connection. Techniques are also described for optimizing the path associated with a local repair connection.

Techniques for determining local repair connections

Techniques for finding an optimized local repair path that may be used to signal a local repair connection for a protected connection. The optimized local repair path starts at a node in the path associated with the protected connection and ends at a merge point node in the path associated with the protected connection that is downstream from the start node. Various techniques may be used for finding an optimized local repair path.

Techniques for determining optimized local repair paths

Techniques for computing a path for a local repair connection to be used to protect a connection traversing an original path from an ingress node to an egress node. The computed path originates at a node (start node) in the original path and terminates at another node (end node) in the original path that is downstream from the start node. A Constraint Shortest Path First (CSPF) algorithm may be used to compute the path. The computed path is such that it satisfies one or more constraints and does not traverse a path from a first node in the original path to a second node in the original path, wherein the first and second nodes are upstream from the start node in the original path and the second node is downstream from the first node in the original path. A local repair connection may then be signaled using the computed path.

Techniques for determining local repair paths using CSPF

Techniques for dynamically establishing and configuring a liveliness detection session for a local repair connection of a connection. In one set of embodiments, a signaling message is received at a node configured to maintain a local repair connection for a connection. A configuration parameter is identified in the signaling message, where the configuration parameter pertains to a liveliness detection mechanism or protocol. A liveliness detection session is then established for the local repair connection based on the configuration parameter.

Growing community of inventors

Pleasanton, CA, United States of America

Mohammad Hanif