Abstract: A method performed by a network controller for providing network reliability. The method includes employing an Interior Gateway Protocol (IGP) proxy configured to communicate controller information about the network controller to the one or more network elements using IGP (Link-State Advertisement (LSA) or Link State Protocol Data Unit (LSP)) with a Controllers TLV. The method uses the controller information for proper election of a primary controller in the event of a network failure.

Abstract: A Proxy Forwarding node configured to advertise Segment Routing (SR) proxy forwarding capability of the Proxy Forwarding node for neighboring nodes of the Proxy Forwarding node using extensions to interior gateway protocol (IGP) for Proxy Forwarding for enabling an ingress node to the SR Traffic Engineering (SR-TE) path to continue to forward the traffic without modifying a segment list of the SR-TE path that includes a node segment identifier (SID) of a failed neighboring node of the Proxy Forwarding node. When the Proxy Forwarding node receives traffic targeting the failed neighboring node, the Proxy Forwarding node performs SR proxy forwarding for the failed neighboring node by forwarding the traffic towards a destination of the traffic in a direction that avoids the failed neighboring node for a period of time after the IGP has converged.

Abstract: Disclosed herein are various embodiments for constructing an abstract domain topology. In one embodiment, a Path Computation Element (PCE) is configured as a parent PCE to at least one child PCE. Each of the child PCEs is responsible for providing path computational services for a domain. Communication is established between the parent PCE and the at least one child PCE. The parent PCE receives from each of its child PCEs domain connection information corresponding to the domain of each child PCE. The parent PCE builds and maintains an abstract domain topology based on the domain connection information that it receives from its child PCEs. In one embodiment, the domain connection information is communicated from the child PCE to the parent PCE by adding a new notification-type (NT) and notification-value (NV) to a notification object in a Path Computation Element Communication Protocol (PCEP) notification message.

Abstract: Disclosed is a mechanism for implementing link state flooding reduction (LSFR) in an Interior Gateway Protocol (IGP) network. The mechanism includes receiving data indicating connectivity of a plurality of nodes in the network. A flooding topology is built based on the connectivity. This includes selecting one of the nodes as a root node, and building a tree of links connecting the root node to the nodes in the network. The flooding topology is stored in a memory. The flooding topology may not be to the remaining nodes in the network. Link state messages may then be flooded over the flooding topology.

Abstract: A network node (N1) for handling IGP flooding topology (FT) inconsistency by obtaining a new FT and setting a FT flag field (FT field) in a data packet (DP) to indicate whether a link between N1 and a second node (N2) is on the new FT. N1 transmits the DP to N2. N1 receives a second DP from N2 that includes the FT field set by N2 to indicate whether the link between the network node and N2 is on the new FT as determined by N2. N1 sets a FT inconsistency field in a link state packet to indicate an inconsistency in the new FT when the FT field set by N2 and the FT field set by N1 are different for a given time. N1 distributes the LS to at least one node in the network.

Abstract: Disclosed herein are various embodiments for constructing an abstract domain topology. In one embodiment, a Path Computation Element (PCE) is configured as a parent PCE to at least one child PCE. Each of the child PCEs is responsible for providing path computational services for a domain. Communication is established between the parent PCE and the at least one child PCE. The parent PCE receives from each of its child PCEs domain connection information corresponding to the domain of each child PCE. The parent PCE builds and maintains an abstract domain topology based on the domain connection information that it receives from its child PCEs. In one embodiment, the domain connection information is communicated from the child PCE to the parent PCE by adding a new notification-type (NT) and notification-value (NV) to a notification object in a Path Computation Element Communication Protocol (PCEP) notification message.

Abstract: Methods of computing a flooding topology (FT) for a network are presented. The methods include a process for computing a FT that includes all nodes in the network and a process for ensuring that all nodes in the FT have at least two links in the FT. Some of the methods minimize a number of links of the nodes in the FT. Some of the methods also constrain some of the nodes in the FT to a maximum number of links. Some of the methods compute a first FT for nodes whose maximum number of links in the FT equal their number of links in the network, then compute a second FT for remaining nodes in the network, then combines the two FTs to compute a complete FT for the network.

Abstract: Various systems and methods for migrating a zone to a pseudo node are described herein including a method performed by a zone edge node. In an embodiment, the method includes receiving, by the zone edge node, an execution request to initiate migration from the zone to the pseudo node. The method also includes sending, by the zone edge node, at least one Hello packet to a zone external node adjacent to the zone edge node for requesting the zone external node to create an adjacency between the pseudo node and the zone external node on the zone external node. The method further includes creating, by the zone edge node, the adjacency between the pseudo node and the zone external node on the zone edge node.

Abstract: Disclosed is a mechanism for implementing link state flooding reduction (LSFR) in an Interior Gateway Protocol (IGP) network. The mechanism includes receiving data indicating connectivity of a plurality of nodes in the network. A flooding topology is built based on the connectivity. This includes selecting one of the nodes as a root node, and building a tree of links connecting the root node to the nodes in the network. The flooding topology is stored in a memory. The flooding topology may not be to the remaining nodes in the network. Link state messages may then be flooded over the flooding topology.

Abstract: A network node (N1) for handling IGP flooding topology (FT) inconsistency by obtaining a new FT and setting a FT flag field (FT field) in a data packet (DP) to indicate whether a link between N1 and a second node (N2) is on the new FT. N1 transmits the DP to N2. N1 receives a second DP from N2 that includes the FT field set by N2 to indicate whether the link between the network node and N2 is on the new FT as determined by N2. N1 sets a FT inconsistency field in a link state packet to indicate an inconsistency in the new FT when the FT field set by N2 and the FT field set by N1 are different for a given time. N1 distributes the LS to at least one node in the network.

Abstract: A method for establishing a temporal label switched path (T-LSP) implemented in a node in a network. The method includes receiving a path request including a time interval and a set of constraints; obtaining traffic engineering information from a first database; computing, by the node, a path satisfying the time interval and the set of constraints based on the traffic engineering information obtained; storing the time interval and the set of constraints in a second database; and instructing an ingress node of the temporal LSP to signal the temporal LSP in the network along the path computed at a start of the time interval identified in the path request and to tear down the temporal LSP at an end of the time interval identified in the path request.

Abstract: A method for establishing a temporal label switched path (T-LSP) implemented in a node in a network. The method includes receiving a path request including a time interval and a set of constraints; obtaining traffic engineering information from a first database; computing, by the node, a path satisfying the time interval and the set of constraints based on the traffic engineering information obtained; storing the time interval and the set of constraints in a second database; and instructing an ingress node of the temporal LSP to signal the temporal LSP in the network along the path computed at a start of the time interval identified in the path request and to tear down the temporal LSP at an end of the time interval identified in the path request.

Abstract: A method for extending Border Gateway Protocol (BGP) to change multiple route attributes at a time. The method includes receiving a BGP wide community container that includes an indication that multiple route attributes can be changed at a time, a one or more route conditions, and actions to perform on the multiple route attributes when the one or more route conditions are met. The method determines whether the route conditions are satisfied. The method performs the actions specified in the BGP wide community container on the multiple route attributes when the one or more route conditions are satisfied.

Abstract: A method performed by a controller configured to implement Border Gateway Protocol (BGP) in a communications system, comprising establishing a controller BGP (cBGP) peer session with a network element (NE), receiving a message for communication through the cBGP session from the NE, determining whether the message is permitted to be communicated through the cBGP session based on whether the message carries routing information; transmitting the message to the NE through the cBGP session when the message is permitted to be communicated through the cBGP session, and receiving a response message of the first type from the NE through the cBGP session.

Abstract: A method for controlling a network that includes encoding, by a central controller, control instructions using an extended Border Gateway Protocol-Link State (BGP-LS) protocol. The central controller is a BGP-LS supported node. The method transmits, by the central controller, the control instructions to nodes in the network that are identified as intended recipients of the control instructions by the central controller and that have established a BGP session with the central controller.

Abstract: A method for encoding messages of a flooding topology and backup paths of the flooding topology. The method includes monitoring a status of a network, and detecting at least one network failure. The network failure is one of a link failure, a node failure, or both. A backup path for each of the links and nodes on a flooding topology is computed. The backup paths for a link are encoded in a link backup path (LBP) data structure. The LBP data structure for the link is encoded in a LBP type-length-value (TLV). The encoded LBP-TLV comprising the encoded LBP data structure for the link is encoded in a backup paths opaque link state advertisement (LSA). The flooding topology is flooded with the backup paths opaque LSA.

Abstract: A parallel flooding topology repair method performed by a node for repairing a flooding topology. The parallel flooding topology repair method detects a failed link and/or a failed node on a flooding topology, determines whether the failed link and/or failed node results in a flooding topology split, and repair the flooding topology by performing a local flooding topology repair process when the flooding topology is split.

Abstract: The disclosure relates to recovering from a failure in a network. A flooding topology, represented by links between nodes in the network, is computed. Alternative connections for the links and the nodes on the flooding topology are also computed. A change in the flooding topology is detected, where the change indicates the failure in the network and results in a split of the flooding topology. A link state message is flooded to each of the nodes in a remaining part of the flooding topology and to the alternative connections, such that the link state message identifies the failure in the network. The failure in the network is resolved by connecting the split flooding topology using the remaining part of the flooding topology and the alternative connections as identified in the link state message.

Abstract: A method of protecting against two or more board failures at the same time by providing an elastic consistency platform (ECP) of high availability (HA) in multiple board environments is described. The ECP is provided between transmission control protocol (TCP) and an application using TCP on each board, including providing input and output buffers to store data between a producer and a consumer. The ECP is used to generate a warning when an amount of data unsynchronized in an output buffer of the ECP on any board reaches a programmable limit.

Abstract: An autonomous system (AS) comprising a topology transparent zone (TTZ) comprising a plurality of TTZ nodes, wherein the plurality of TTZ nodes includes an edge node and an internal node, wherein each of the plurality of TTZ nodes is configured to connect to another TTZ node via an internal link, and a plurality of neighboring external nodes connected to the TTZ edge nodes via a plurality of external links, wherein no link state advertisements (LSAs) describing the internal links are distributed to the neighboring external nodes.