23 results about "Fast reroute" patented technology

A mechanism that allows CE-to-PE traffic to achieve minimal traffic loss at the same rate as PE-to-CE redirection (FRR). The solution relies on a fast-unblocking of the Backup-DF interface based on appearance of redirected packets from the active DF-Elected peer. A slow-path confirmation mechanism is included to further mitigate false-positives, as well as maintaining data plane and control plane in sync.

A method by a network device functioning as a provider edge (PE) in an ethernet virtual private network (EVPN) to prevent transient loops between multi-home peer PEs. The method includes advertising a first EVPN label to one or more PEs that are multi-home peer PEs of the PE, advertising a second EVPN label to one or more PEs that are not multi-home peer PEs of the PE, receiving first traffic for a CE that is encapsulated with the first EVPN label as opposed to the second EVPN label, and discarding the first traffic in response to determining that a link between the PE and the CE is not operational and the first traffic for the CE is encapsulated with the first EVPN label.

The invention discloses a fast rerouting method based on a bidirectional potential energy field. The method comprises the following steps: constructing a forward potential energy field and a reverse potential energy field based on a destination node in a network; generating a forwarding rule of a data packet according to the forward potential energy field and the reverse potential energy field; and in a data packet forwarding process, switching between the forward potential energy field and the reverse potential energy field according to a link state. According to the invention, efficient, stable and robust fault recovery can be realized in a complex network environment.

The application discloses a fast re-routing method based on bidirectional potential energy field, comprising the following steps: constructing a forward potential energy field and a reverse potential energy field based on destination nodes in a network; generating a data packet forwarding rule according to the forward potential energy field and the reverse potential energy field; and switching between the forward potential energy field and the reverse potential energy field according to a link state in a data packet forwarding process. The application can realize efficient, stable and robust fault recovery in a complex network environment.

Techniques are described for quickly rerouting traffic to an application hosted on a first Virtual Private Cloud (VPC) location. In the event of an error in routing traffic to the first VPC portion traffic can be rerouted to a second VPC portion. The first and second VPC portions can be different portions of the same VPC or could be different VPSs. The techniques include steps for calculating a predetermined route to the second private virtual cloud location. The techniques further include steps for monitoring data for detecting an error in the first cloud location. The steps further include detecting a potential error based on the monitored data, and also verifying that the potential error is in fact a valid error. In response to verifying that the error is a valid error, further steps include performing a fast reroute of traffic to the second cloud locations along the predetermined route.

The application discloses a congestion recovery method and device based on fast rerouting, equipment and medium. The method comprises the following steps: acquiring multiple transmission paths between a first end device and a second end device through at least one layer of network equipment; determining a path of to-be-transmitted traffic in the multiple transmission paths by using a five-tuple monitoring technology, and determining state information corresponding to the path of the to-be-transmitted traffic; detecting whether congestion occurs on the path of the to-be-transmitted traffic according to the state information; if the congestion occurs, finding a target path in at least one candidate path by using a color block matching algorithm, and updating the path where the congestion occurs to the target path. The method can detect the path in advance when the congestion occurs, quickly find an optimal path for rerouting operation, and thus reduce the influence of the congestion on application performance.

Embodiments of the present disclosure relate to facilitating fast rerouting in a high-availability network. A system for efficiently determining a set of next-hop switches from a switch is provided. During operation, the system can determine multiple next-hop switches for an Internet Protocol (IP) address prefix. The system can then store a list of identification information in an entry of a forwarding data structure of the switch, the list of identification information indicating multiple next-hop switches corresponding to the IP address prefix. The identification information of the multiple next-hop switches can be stored in a list in a preference order for forwarding services matching the IP address prefix. Upon receiving a packet having a destination IP address matching the IP address prefix, the system can select an entry from the forwarding data structure to determine a next-hop switch for forwarding the packet. The system can then determine the next-hop switch for the packet from the entry based on the preference order.

A method implemented by a network node in an interior gateway protocol (IGP) domain. The method includes transmitting a first message to a second network node in the IGP domain. The first message identifies a backup path to be used by the network node upon detection of a failure in the IGP domain. The method further includes detecting the failure after transmission of the first message to the second network node, and transmitting a second message to the second network node following detection of the failure. The second message notifies the second network node to use a backup port in a source address validation (SAV) table to validate packets received on the backup path.

A method for a network device to act as a Provider Edge (PE) in an Ethernet Virtual Private Network (EVPN) to prevent transient loops between multi-homed peer PEs. The method includes: advertising a first EVPN label to one or more PEs that are multi-homed peer PEs acting as PEs, advertising a second EVPN label to one or more PEs that are multi-homed peer PEs not acting as PEs, receiving a first traffic of a CE encapsulated with the first EVPN label instead of the second EVPN label, and discarding the first traffic in response to determining that a link between the PE and the CE is not operable and the first traffic of the CE is encapsulated with the first EVPN label.

The application discloses a backup path generation method and device, equipment, a storage medium and a program product. Wherein, the network includes a plurality of forwarding devices, the method is applied to the forwarding device, the method comprises: setting one or more constraint condition groups according to a preset target; generating an equivalent link group of the forwarding device in each local direction according to the constraint condition group; generating an equivalent link group index table according to the equivalent link group, and updating the equivalent link group index table according to the state of the equivalent link group; generating a backup path based on a fast rerouting algorithm; updating the backup path according to the equivalent link group index table.

In some aspects, a method for establishing a multicast-only Fast Re-Route (FRR) (MoFRR) path between a source node and a receiving node in a network, the method includes receiving, by a merged receiving node, a plurality of data packets in a data flow comprising an FRR indicator, wherein the merged receiving node is configured to identify an FRR path for data transmission to the source node, extracting, by the merged receiving node, from the FRR indicator, an identification of the source node as a destination of the data transmission, and a first identifier identifying a first data packet as part of a first flow of a MoFRR, and a second identifier identifying a second data packet as part of a second flow of a MoFRR, transmitting, by the receiving node, the first data packet along a primary data path and the second data packet along a secondary data path.

Techniques are described for providing fast reroute for traffic in EVPN-VXLAN. For example, a backup PE device of an Ethernet segment is configured with an additional tunnel endpoint address ("reroute tunnel endpoint address") for a backup path associated with a second split-horizon group that is different than a tunnel endpoint address and first split-horizon group for another path used for normal traffic forwarding. The backup PE device sends the reroute tunnel endpoint address to a primary PE device of the Ethernet segment, which uses the reroute tunnel endpoint address to configure a backup path to the backup PE device over the core network. For example, the primary PE device may install the reroute tunnel endpoint address within its forwarding plane and one or more operations to cause the primary PE device to encapsulate a VXLAN header including the reroute tunnel endpoint address when rerouting the packet along the backup path.

A method implemented by a network node in a BIER domain includes obtaining, by a control plane of the network node, an IP LFA from a FIB or RIB through a first interface, using, by the control plane of the network node, the IP LFA to build a BIFTe when the IP LFA is an expected type, accessing, by the control plane of the network node, a BIER network topology in an LSDB through a second interface, computing an LFA of the expected type, and using the LFA to build the BIFTe when the IP LFA is not of the expected type, updating, by the control plane of the network node, the BIFTe in a data plane of the network node through a third interface; and forwarding, by the data plane of the network node, BIER packets using the BIFTe to avoid a failure.

The application provides a multicast fast rerouting method and device, electronic equipment and a storage medium. In the application, first routing information is extracted from a first routing entry from a network device to a multicast source sending a current multicast flow, and it is determined whether a FRR resource matching the first routing information already exists. If the FRR resource exists, an MFIB table entry for forwarding the current multicast flow is generated based on the existing FRR resource. If the FRR resource does not exist, a FRR resource matching the first routing information is created, and an MFIB table entry for forwarding the current multicast flow is generated based on the created FRR resource. In this way, multiple multicast flows with the same first routing information can reuse the same FRR resource, avoiding table entry redundancy caused by repeated storage of the same backup forwarding information, and improving the carrying capacity of the device for the multicast flow. When a fault occurs, only the state of the primary and backup entry interface identifiers in the shared FRR resource needs to be switched, and all multicast flows sharing the FRR resource can be switched at the same time.

A method implemented by a network node in a Bit Index Explicit Replication (BIER) domain is used to provide fast reroute protection. The method includes copying a bit index routing table (BIRT) of the network node, changing a neighbor node in the copied BIRT to one of a plurality of backup neighbor nodes to generate a backup BIRT, deriving a backup bit index forwarding table (BIFT) from the backup BIRT, and forwarding a packet in accordance with the backup BIFT when the neighbor node has failed.

This invention provides a fast rerouting method for satellite network topology changes, belonging to the field of satellite communication network technology. Based on the Floyd-Warshall algorithm, and addressing the dynamic changes in inter-satellite links in satellite networks, an incremental routing update algorithm is proposed to locally update path information when a new link is established. A decremental routing update algorithm is also proposed, which utilizes the regular characteristics of inter-satellite links to locally update only the affected shortest distance path when inter-orbit or intra-orbit links are interrupted, avoiding global route recalculation. The algorithm of this invention quickly determines alternative paths when satellite network topology changes abruptly. Through an efficient local update mechanism, it significantly reduces the computational load of routing updates and can be effectively integrated with shortest path algorithms to enhance the stability and transmission performance of satellite networks.

A method implemented by a network node in a bit index explicit replication (BIER) domain for providing fast re-routing protection. The method comprises: copying a bit index routing table (BIRT) of the network node; changing a neighbor node in the copied BIRT to one of a plurality of backup neighbor nodes to generate a backup BIRT; deriving a backup bit index forwarding table (BIFT) from the backup BIRT; and forwarding a data packet according to the backup BIFT when the neighbor node fails.

This application discloses a route advertisement method, a packet forwarding method, a device, and a system. A first network device obtains a first VPN route and a second VPN route that have a same route prefix and a same route distinguisher but different VPN identifiers and different next hops. The first network device allocates a third VPN identifier to the first VPN route and the second VPN route, and stores, on a forwarding plane, a first correspondence between the third VPN identifier and a first VPN identifier that is included in the first VPN route and a second correspondence between the third VPN identifier and a second VPN identifier that is included in the second VPN route. The first VPN route and the second VPN route that belong to a same VPN can form fast reroute or load balancing.

Techniques for performing neighbor router identification in the context of multicast RSVP fast reroute. In one set of embodiments, these techniques enable a Merge Point (MP) to correctly identify a Point of Local Repair (PLR) that transmitted a backup RSVP Path message in the scenario where the MP has multiple upstream neighbor routers. In another set of embodiments, these techniques enable a PLR to correctly identify an MP that transmitted a backup RSVP Resv message in the scenario where the PLR has multiple downstream neighbor routers.

A mechanism that allows CE-to-PE traffic to achieve minimal traffic loss at the same rate as PE-to-CE redirection (FRR). The solution relies on a fast-unblocking of the Backup-DF interface based on appearance of redirected packets from the active DF-Elected peer. A slow-path confirmation mechanism is included to further mitigate false-positives, as well as maintaining data plane and control plane in sync.

Techniques for performing neighbor router identification in the context of multicast RSVP fast reroute. In one set of embodiments, these techniques enable a Merge Point (MP) to correctly identify a Point of Local Repair (PLR) that transmitted a backup RSVP Path message in the scenario where the MP has multiple upstream neighbor routers. In another set of embodiments, these techniques enable a PLR to correctly identify an MP that transmitted a backup RSVP Resv message in the scenario where the PLR has multiple downstream neighbor routers.

The invention provides a multicast fast rerouting method based on a node cluster, and the method comprises the steps: enabling a plurality of network nodes to form a cluster before a multicast service is provided; when the nodes in the cluster establish a multicast forwarding tree, the nodes are called bearing nodes and are synchronized with other nodes in the cluster, and the other nodes become backup nodes of the multicast stream in the cluster; and when the upstream node detects that the bearing node has a fault, the downstream node is switched to any backup node in the cluster according to the cluster information, so that the multicast rapid rerouting is completed, and the multicast service is ensured not to be interrupted. Compared with the prior art, the method has the advantages that the multicast forwarding trees in the multicast nodes are completely backed up in a node cluster mode, so that the nodes in the cluster are backup nodes for different multicast streams, the situation that resources are wasted by the backup nodes does not exist, re-routing can be rapidly completed when a fault occurs, and the service life of the multicast forwarding trees is prolonged. Therefore, the stability and the quality of the multicast service are ensured.

In some cases, once Fast Reroute (FRR) has taken place (e.g., for MPLS protection), a further FRR is undesirable, and even detrimental. A mechanism to prevent a further FRR, once such a further FRR is determined to be potentially harmful, is described.