Abstract: A method performed by a network node. The method includes detecting a loss of connection at an incoming interface to an upstream neighbor of the network node, where the network node is in a multicast communication network that includes a multicast tree to provide connectivity from a common source node to one or more multicast recipient nodes. The multicast communication network further includes a set of one or more secondary paths to provide redundancy to the multicast tree, and sending a notification packet downstream toward the one or more multicast recipient nodes when the network node cannot re-route the multicast data traffic to allow the multicast data traffic to be received by the multicast recipient nodes, wherein the notification packet causes one or more downstream nodes to switch multicast reception to one or more of the set of one or more secondary paths to re-route the multicast data traffic.

Abstract: A method is implemented by a network element for determining a next hop of a backup path for a fast reroute process to be utilized in response to a network event invalidating a primary path to a destination node. The method reduces computational requirements of the network element by reducing a number of paths to be evaluated without affecting selection of the backup path. The method selects a neighbor node P of a source node S to calculate a shortest path tree (SPT) for P for use in identifying backup paths for S. The SPT is calculated for P, pruning paths from the SPT that traverse S or that fail an LFA condition. P is selected for the next hop of the backup path for a destination node X where the SPT of P provides an LFA path from S to the destination node X.

Abstract: A system and method for chaining one or more services in a service provider network. A service chaining policy and associated Service Path Identifier (SPID) are determined at an ingress node with respect to a particular data packet flow. If the service chaining policy involves one or more service nodes to be traversed by the data packet flow, each service node's EIDs and RLOCs are determined. A sequential data exchange process with the service nodes is effectuated using encapsulation of data packets based on the EIDs and RLOCs for obtaining services in accordance with the order of services set forth in the chaining policy.

Abstract: An upstream activation mechanism provides enhancements to PIM-SM based fast re-route in a multicast communication network, where secondary paths provides redundancy to a multicast tree and are on standby to reduce bandwidth usage when there is no failure in the network. Upon receiving an indication of a loss of connection to the primary path of the multicast tree network, a network node that has a failure-free secondary path to a common source node of the multicast tree sends an activation packet upstream toward the common source node via the failure-free secondary path. The activation packet causes one or more upstream nodes to unblock their respective outgoing interfaces to thereby activate transmission of the multicast data traffic on the failure-free secondary path.

Abstract: A method is disclosed that is implemented by a router for executing an internet protocol fast reroute process in response to a network event invalidating a current route to a destination node without degrading forwarding plane functionality or performance caused by indirect forwarding information base lookups. The method comprises a set steps including receiving or generating the network event by the router, the network event associated with a network event identifier and looking up the network event identifier in an event table to determine routes that are affected by the network event. The method further includes determining whether a route with a fast reroute forwarding object is affected by the network event in the routing information base and overwriting a current next hop forwarding object using a backup next hop forwarding object in the forwarding information base.

Abstract: A method forward Ethernet frames at a node in a network supporting an implementation of shortest path bridging (SPB) protocol is disclosed. The method starts with a shortest path computation for the node (referred to as the computing node). The shortest path computation selects at least a shortest path to each destination node in the network, where a neighboring node on the shortest path to reach each node is recorded. Then it computes a downstream loop-free alternate (LFA) node for a destination node, where the LFA node is downstream of the computing node but not on the selected shortest path to the destination node from the computing node. Then when connectivity to the neighboring node on the computed shortest path is detected to be abnormal, the node forwards an Ethernet frame with a destination media access control (MAC) address corresponding to the destination node through the LFA node.

Abstract: A failure detection mechanism provides enhancements to PIM-SM based fast re-route techniques. A network node upon detecting a loss of connection determines whether it can re-route multicast data traffic. If the network node does not have a failure-free secondary path, it can originate a notification packet and send it to the downstream parts of a multicast tree. The notification packet can trigger one or more downstream nodes to switch-over to redundant secondary paths to re-route the multicast data traffic.

Abstract: An upstream activation mechanism provides enhancements to PIM-SM based fast re-route in a multicast communication network, where secondary paths provides redundancy to a multicast tree and are on standby to reduce bandwidth usage when there is no failure in the network. Upon receiving an indication of a loss of connection to the primary path of the multicast tree network, a network node that has a failure-free secondary path to a common source node of the multicast tree sends an activation packet upstream toward the common source node via the failure-free secondary path. The activation packet causes one or more upstream nodes to unblock their respective outgoing interfaces to thereby activate transmission of the multicast data traffic on the failure-free secondary path.

Abstract: A failure detection mechanism provides enhancements to PIM-SM based fast re-route techniques. A network node upon detecting a loss of connection determines whether it can re-route multicast data traffic. If the network node does not have a failure-free secondary path, it can originate a notification packet and send it to the downstream parts of a multicast tree. The notification packet can trigger one or more downstream nodes to switch-over to redundant secondary paths to re-route the multicast data traffic.