Future Wei Technologies, Inc.

Huawei Technologies Co., Limited

Huaimo Chen

Ming Li

Renwei Li

Qianglin Quintin Zhao

Hua Autumn Liu

Dean Cheng

Linda Dunbar

Katherine Zhao

Xuesong Dong

Zhenbin Li

Raveendra Torvi

Zhibo Hu

Randall R Stewart

Donald Eggleston Eastlake, Iii

Bisong Tao

Hongtao Yin

Yang Yu

Weiqian Dai

Veerendranatha Reddy Vallem

Anil Kumar S N

Kaippallimalil Mathew John

Haoyu Song

Charles E Perkins

Steve Yao

Iii Donald E Eastlake

A method implemented by a network node in a Bit Index Explicit Replication (BIER) domain is used to provide fast egress protection. The method includes receiving a type length value (TLV) structure that identifies a backup egress node for a destination network node and includes an entry that indicates whether a primary egress node and the backup egress node transmit a packet to a same customer edge (CE) or to different customer edges (CEs), generating an egress protection bit index forwarding table (EP-BIFT) including the backup egress node and the entry that indicates whether the primary egress node and the backup egress node transmit the packet to the same CE or to different CEs, and forwarding the packet in accordance with the EP-BIFT when the primary egress node has failed.

Bit index explicit replication egress protection

A method and apparatus for optimizing network delivery of fifth generation (5G) edge application services by weighting network latency along with a load, capacity, and preference of an application server to determine where to transmit a new flow of packets. By using the weighted approach, network traffic can be equalized among multiple instances (e.g., applications) with the same address.

Optimizing network delivery of 5G edge application services

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.

Framework for temporal label switched path tunnel services

A method implemented by a first controller in a network comprising a cluster of controllers including the first controller and a second controller, the method comprises transmitting, to a network element (NE), a first BGP message comprising a first controllers network layer reachability information (NLRI), the first controllers NLRI carrying a position of the first controller relative to other controllers in the cluster of controllers, receiving, from the NE, a second BGP message comprising a second controllers NLRI, the second controllers NLRI carrying a position of the second controller relative to the other controllers in the cluster of controllers, and determining the primary controller from the cluster of controllers based on the position of the first controller and the position of the second controller, with the primary controller being responsible for controlling the network.

System and method for Border Gateway Protocol (BGP) controlled network reliability

A method used by an egress router is disclosed. The egress router obtains a capacity index of an application server attached to the egress router. The egress router further obtains a load index describing a load measurement between the egress router and the application server during a certain time period. The egress router encodes the capacity index and the load index into a packet. The egress router transmits the packet to one or more routers in an Internet protocol (IP) network.

Network protocol extension for 5G edge computing services

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.

System and methods for computing flooding topology

Disclosed is a mechanism implemented by an ingress node in a network. The mechanism comprises receiving a packet in Multiprotocol Label Switching (MPLS) format. A first segment list is pushed onto the packet. The first segment list describes a segment routing point to multipoint (SR P2MP) path as a list of multicast segment identifiers (SIDs) each comprising a multicast adjacency label. The packet is transmitted from a downstream interface along the SR P2MP path.

Segment routing MPLS point to multipoint path

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.

Interior gateway protocol (IGP) for segment routing (SR) proxy segment identifiers (SIDs)

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.

System and method for implementing controller border gateway protocol (cBGP)

A method implemented by a first node in a segment routing (SR) network domain includes receiving, from a second node of another network domain, a packet that is to pass through the SR network domain in accordance with segment identifiers (SIDs). The method also includes obtaining compressed SIDs corresponding to some of the SIDs. The method includes generating, by the first node, a segment routing header (SRH) having a list of segments and a segment left (SL) field. The method finally includes adding the SRH to the packet, and forwarding the packet with the SRH to a third node in the SR network domain.

Mixing segments with different sizes for segment routing

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.

Interior gateway protocol flood minimization

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.

Source routing tunnel ingress protection

A method implemented by a network node in a Bit Index Explicit Replication Traffic/Tree Engineering (BIER-TE) domain is used to avoid duplicate packets. The method includes generating an improved bit index forwarding table (BIFT) containing a forwarding entry for a local area network (LAN)-connected adjacency from the network node to a pseudo node; and a secondary BIFT including a forwarding entry for a forward connected adjacency from the pseudo node to each of the pseudo node's next hop nodes except the network node; sending a packet containing a point to multipoint (P2MP) path with a bit position for the LAN-connected adjacency to the pseudo node according to the forwarding entry for the LAN-connected adjacency in the improved BIFT; and sending the packet to each of the pseudo node's next hop nodes on the P2MP path based on the secondary BIFT.

Bit index explicit replication traffic engineering for broadcast link

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.

System and method to reduce flooding topology size

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.

Growing community of inventors

Bolton, MA, United States of America

Huaimo Chen