Abstract: A method implemented by a network controller in a network, comprising receiving, by a temporal label switched path (T-LSP) manager of the network controller, a request for creating a temporal LSP in a scheduled time interval; computing, by a temporal path computation element (T-PCE) of the network controller, a shortest path in a network satisfying a constraint for the label switched path (LSP) in the scheduled time interval; reserving, in a temporal traffic engineering database (T-TED) of the network controller, resources on each link the LSP traverses for the scheduled time interval; and initiating, at a beginning of the scheduled time interval by the T-LSP manager, setup of the LSP in the network through sending a LSP creation request to a path computation client (PCC) on an ingress node of the LSP.

Abstract: A first network element comprising a memory comprising instructions executable by a processor and a processor coupled to the memory and configured to execute the instructions. Executing the instructions causes the processor to receive, from a second network element during a border gateway protocol communication session, a communications capabilities message indicating capabilities of the second network element, receive, from the second network element, an advertisement message indicating connections and accesses of a second domain controlled by the second network element, receive a request to route data between a source located in a first domain and a destination, transmit a first request message to the second network element to cause the second network element to compute a path segment through the second domain, and transmit a second request message to create a segment of an end-to-end tunnel between the source and the destination crossing the first domain and the second domain.

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 method of determining a plurality of shortest paths in a network from a source node to respective destination nodes comprises: accessing, by one or more processors, for each of the plurality of shortest paths, a path constraint; generating, by the one or more processors, a shortest path tree (SPT) and a candidate list, wherein each candidate of the candidate list comprises a working node, a minimum cost for a path to the working node from the source node, a maximum available bandwidth for the path to the working node from the source node, and a previous hop node; and determining, by the one or more processors, the plurality of shortest paths in the network from the source node to the respective destination nodes based on the SPT, each determined shortest path meeting the path constraint.

Abstract: A network element (NE) is configured to act as a parent controller. The NE receives connection and access point messages from a plurality of child controllers each child controller controlling one or more network domains. The connection and access point messages indicate inter-domain links and access points for the network domains. The NE receives requests to compute a path from a source to a destination traversing one or more of the network domains. The NE computes the path from the source to the destination via the network domains, and transmits a create tunnel segment message to the child controllers controlling network domains along the path. The create tunnel messages instruct the child controllers to create one or more tunnel segments to forward communications from the source to the destination along the path.

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: A method of avoiding routing interruption during transition to a topology transparent zone (TTZ) is described. The method includes virtualizing a path from an edge router to another edge router within the TTZ in a first direction without removing original links, wherein the original links are links from the edge router to its neighboring routers within the TTZ, receiving, by the edge router within the TTZ, a router link state advertisement (LSA) from the another edge router within the TTZ while the original links remain in place, wherein the LSA comprises a path from the another edge router to the edge router in a second direction different from the first direction, and removing, by the edge router within the TTZ, the original links after the LSA has been received from the another edge router and the virtualization of the path is complete.

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 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 parent PCE controller comprising a memory comprising instructions executable by a processor and a processor coupled to the memory and configured to execute the instructions. Executing the instructions causes the processor to establish a parent-child relationship with at least a first child PCE controller controlling a first domain and a second child PCE controller controlling a second domain, receive a request to create an E2E tunnel from a source to a destination crossing the first domain and the second domain, compute a shortest path from the source to the destination through the first domain and the second domain, transmit a request message to the first child PCE controller for creating a first tunnel segment of the E2E tunnel through the first domain, and transmit a request message to the second child PCE controller for creating a second tunnel segment of the E2E tunnel through the second domain.

Abstract: A method implemented by a temporal tunnel service (TTS) controller, comprising computing a path in a network for a temporal label switched path (LSP), wherein the path satisfies a network constraint in a time interval comprising a predetermined start time and a predetermined end time, reserving, at a current time prior to the predetermined start time, a network resource along the path computed for the temporal LSP, wherein the network resource is reserved for the temporal LSP to carry traffic in the time interval, and creating the temporal LSP in the network by sending a route configuration instruction to each node along the path of the temporal LSP.

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: 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: A method of avoiding routing interruption during transition to a topology transparent zone (TTZ) is described. The method includes virtualizing a path from an edge router to another edge router within the TTZ in a first direction without removing original links, wherein the original links are links from the edge router to its neighboring routers within the TTZ, receiving, by the edge router within the TTZ, a router link state advertisement (LSA) from the another edge router within the TTZ while the original links remain in place, wherein the LSA comprises a path from the another edge router to the edge router in a second direction different from the first direction, and removing, by the edge router within the TTZ, the original links after the LSA has been received from the another edge router and the virtualization of the path is complete.

Abstract: A first router in a first AS, the first router comprises: a processor configured to: obtain information about a broadcast link connecting the first router to a second router in a second AS, and generate a link state message comprising the information; and a transmitter coupled to the processor and configured to transmit the link state message to a third router, wherein the third router is in the first AS and is adjacent to the first router. A method comprises: receiving a first link state message from a first router; receiving a second link state message from a second router; receiving a third link state message from a third router; determining which of the first router, the second router, and the third router are ASBRs connected to a broadcast link based on information in the first link state message, the second link state message, and the third 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: 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 method implemented in a parent controller including receiving a request to compute a shortest end-to-end (E2E) path from source to destination through network domains managed by child controllers, receiving path segments and costs computed by the child controllers, wherein the path segments identify in-edge nodes, out-edge nodes, and inter-domain links, generating a candidate list using the path segments and costs received from the child controllers, constructing a shortest path tree (SPT) from the source to the destination through the network domains by repeatedly removing one of the out-edge nodes corresponding to the path segment in the candidate list having a lowest cost and adding the one of the out-edge nodes to the SPT until the destination is reached, determining the shortest E2E path based on the SPT, and transmitting tunnel creation messages to the child controllers to create a tunnel along the shortest E2E path.

Abstract: A system comprising a plurality of path computation elements (PCEs) configured to communicate with an ingress node, jointly compute a core tree for an inter-domain point-to-multipoint (P2MP) tree across a plurality of network domains, and independently compute a plurality of sub-trees in at least some of the network domains, wherein the core tree connects the ingress node to a boundary node (BN) in each one of the network domains that have a destination node and each sub-tree connects the BN to a plurality of destination nodes in one of the network domains that have a destination node.