11 results about "Fast reroute" patented technology

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.

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.

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.

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.

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.

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.