Abstract: A network node including a processor coupled to a memory. The processor is configured to receive instructions from the memory which, when executed by the processor, cause the network node to receive a path computation request, calculate a first path from a first ingress node to an egress node, calculate a second path from a second ingress node to a destination node, transmit a first message comprising the first path to the first ingress node, and transmit a second message comprising the second path to the second ingress node.

Abstract: The disclosure relates to path computation and setup of one or more nodes in a network. Connectivity information is received at a local node of the nodes in the network, and a processor of the local node computes a flooding topology based on the received connectivity information, where the flooding topology is represented by links between nodes in the network. The links are encoded between the local node and remote nodes and between remote nodes on the flooding topology, and a link state message is flooded to the remote nodes from the local node in the network, where the link state message includes each of the encoded links in the flooding topology.

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, performed by a network node, for enabling Interior Gateway Protocol (IGP) fast convergence, the method includes determining that there is a significant change in link state information, the significant change is at least one of a link down, a link up, and a link metric change. The method further includes originating a link state packet comprising a flag that is set to indicate the significant change in the link state information; and distributing the link state packet.

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: According to one aspect of the present disclosure, a system includes an active network element having circuitry for executing a primary application and a transmission control protocol (TCP) module, multiple standby network elements having circuitry for executing a secondary copy of the primary application and a secondary TCP module, and a network connection coupled to one or more of the active and standby network elements, wherein the active network element and standby network elements are coupled to transfer data and acknowledgments via their respective TCP modules, and wherein the standby network elements are reconfigurable to communicate via the network connection to a peer regardless of the failure of one or two of the network elements.

Abstract: A network node that provides egress fault protection for a primary egress node. The network node may receive a service label associated with an application from a primary egress node of a primary label switched path (LSP). The network node may use the service label to add a forwarding entry into a forwarding table associated with the primary egress node. Following a fault in the primary egress node, the network node may receive a data packet comprising an LSP label and the service label from a partial backup LSP. The network node may use the LSP label to locate the forwarding table associated with the primary egress node. The service label may be used to deliver the data packet to a destination node according to the forwarding table associated with the primary egress node.

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 and apparatus are provided for stitching and/or nesting label-switched path (LSP) segments for creating an end-to-end (E2E) LSP without running a Resource Reservation Protocol-Traffic Engineering (RSVP-TE) session over an inter-domain link. The present disclosure is applicable to various types of domains including, but not limited to, autonomous system (AS) domains and area domains. Advantages of the disclosed embodiments include providing an easy and efficient method for creating E2E LSP, simplifying network operations, and reducing the cost of network Operations, Administration, and Maintenance (OAM).

Abstract: According to one aspect of the present disclosure, a system includes an active network element having circuitry for executing a primary application and a transmission control protocol (TCP) module, multiple standby network elements having circuitry for executing a secondary copy of the primary application and a secondary TCP module, and a network connection coupled to one or more of the active and standby network elements, wherein the active network element and standby network elements are coupled to transfer data and acknowledgments via their respective TCP modules, and wherein the standby network elements are reconfigurable to communicate via the network connection to a peer regardless of the failure of one or two of the network elements.

Abstract: A network node that provides egress fault protection for a primary egress node. The network node may receive a service label associated with an application from a primary egress node of a primary label switched path (LSP). The network node may use the service label to add a forwarding entry into a forwarding table associated with the primary egress node. Following a fault in the primary egress node, the network node may receive a data packet comprising an LSP label and the service label from a partial backup LSP. The network node may use the LSP label to locate the forwarding table associated with the primary egress node. The service label may be used to deliver the data packet to a destination node according to the forwarding table associated with the primary egress node.

Abstract: A computer-implemented method of routing protection is provided comprising: receiving, by one or more processors of an active network element from a remote peer device, a plurality of data packets; sending, by the one or more processors of the active network element to a plurality of standby network elements, a multicast data packet comprising combined data of the plurality of data packets; receiving, by the one or more processors of the active network element from at least one of the standby network elements, an acknowledgment of receipt of the multicast data packet; and in response to the receipt of the acknowledgment, sending, by the one or more processors of the active network element to the remote peer device, an acknowledgment of receipt of the plurality of data packets.

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: A T-SDN controller including a T-LSP manager, a temporal path element, a T-TED, a T-LDB, a T-LSPDB, and a network interface. The T-LSP receives a path request including time intervals and a set of constraints. The temporal path element obtains traffic engineering information and computes a path satisfying time intervals and a set of constraints. The T-TED reserves bandwidth corresponding to the path during the time intervals upon request by the T-LSP manager. The T-LDB reserves labels for the links during the time intervals upon request by the T-LSP manager. The T-LSPDB stores the time intervals, the set of constraints, the labels, and the bandwidth. The network interface permits the T-LSP manager to communicate with the nodes in the network to establish a temporal LSP along the path as computed.

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: The system and method of the present disclosure relates to technology for a network system supporting multiple topology transparent zones (TTZs) on an edge node. TTZs have a topology including TTZ nodes consisting of edge nodes and internal nodes connected together by internal links. The edge nodes may also be connected to external nodes outside of the TTZ. The edge node is responsible for generating and distributing link state advertisements (LSAs) to generate virtual paths from the edge node to other edge nodes in each of the TTZs. Each TTZ sharing the edge node and each external node neighboring one of the other edge nodes of the TTZs is virtualized by distribution of the LSAs. However, the internal topology of each TTZ is concealed from each of the other TTZs sharing the edge node and from any neighboring external node connected to one of the other edge nodes.

Abstract: A network element (NE) in a zone routing network includes a memory, receiver, processor, and transmitter. The memory stores a routing information base (RIB) identifying a first next-hop node for a first path in the network to reach a network controller of the network via a first communication node in the network. The first communication node is directly associated with the network controller. The receiver receives a first label-switched path (LSP) creation request message requesting creation of a first LSP through the network. The first LSP creation request message indicates an ingress node of the first LSP. The processor determines that the NE corresponds to the ingress node of the first LSP. The transmitter sends a first LSP creation response message towards the network controller via the first communication node according to the first path to indicate a creation status of the first LSP.

Abstract: A method implemented by a network element (NE) configured as a temporal tunnel service (TTS) controller, comprising computing, via a processor of the NE, a path in a network for a temporal label switched path (LSP), wherein the path satisfies a constraint in a scheduled time interval comprising a predetermined start time and a predetermined end time, reserving, at a current time prior to the predetermined start time via the processor, a first network resource on a link along the path computed for the temporal LSP, wherein the first network resource is reserved for the temporal LSP to carry traffic in the scheduled time interval, and sending, at the predetermined start time via a transmitter of the NE, a LSP creation request to a node associated with the temporal LSP to request creation of the temporal LSP along the path in the network.

Abstract: An apparatus comprising a receiver configured to receive a first path computation request (PCReq) message from a path computation client (PCC) requesting path computation for a label switched path (LSP) in a network, wherein the PCReq message indicates a time interval scheduled for the LSP to carry traffic, a processor coupled to the receiver and configured to compute a path in the network for the LSP by determining that the path satisfies a network constraint in the scheduled time interval, and reserve a network resource on a link along the path computed for the LSP, wherein the network resource is reserved in advance for the scheduled time interval, and a transmitter coupled to the processor and configured to send a path computation response (PCRep) message to the PCC indicating the path computed for the LSP in the scheduled time interval.