A communication method includes a first network device obtaining a first route and a second route from a second network device. A first network segment corresponding to the first route is a subnet segment of a second network segment corresponding to the second route. The second route is an aggregated route, and the first route indicates that the first network segment is unreachable. The first network device switches a next hop of the aggregated route based on the first route.

The disclosed embodiments relate to a system that facilitates communication between virtual private clouds (VPCs) hosted by different cloud service providers. During operation, the system receives a packet from a source at a first router in a first VPC, wherein the first VPC is hosted by a first cloud service provider, and wherein the packet is directed to a destination in a second VPC, which is hosted by a second cloud service provider. If no direct tunnel exists between the first VPC and the second VPC, the system forwards the packet through an intermediate hub to the second VPC, and automatically builds a direct tunnel from the first router in the first VPC to a second router in the second VPC to facilitate subsequent communications between the first and second VPCs.

The present disclosure provides a packet encapsulation method, including: determining a segment routing-traffic engineering (SR-TE) path; generating, according to a segment identifier (SID) of each node in the SR-TE path, an SID list, where each node supports a plurality of unified-SID encapsulation types (UETs) corresponding to SIDs of different lengths, and in the SID list, the SID of at least a node serving as an intermediate node of the SR-TE path is the SID having the non-longest length in the plurality of SIDs corresponding to the node; forming a segment routing header (SRH) from the SID list; and encapsulating an initial packet with the SRH to obtain a final packet. The present disclosure further provides a packet forwarding method, a UET announcement method, an electronic device, and a computer-readable storage medium. The final packet obtained by the packet encapsulation method has a higher load rate.

The present disclosure provides a packet encapsulation method, including: determining a segment routing-traffic engineering (SR-TE) path; generating, according to a segment identifier (SID) of each node in the SR-TE path, an SID list, where each node supports a plurality of unified-SID encapsulation types (UETs) corresponding to SIDs of different lengths, and in the SID list, the SID of at least a node serving as an intermediate node of the SR-TE path is the SID having the non-longest length in the plurality of SIDs corresponding to the node; forming a segment routing header (SRH) from the SID list; and encapsulating an initial packet with the SRH to obtain a final packet. The present disclosure further provides a packet forwarding method, a UET announcement method, an electronic device, and a computer-readable storage medium. The final packet obtained by the packet encapsulation method has a higher load rate.

The disclosed embodiments relate to a system that facilitates communication between virtual private clouds (VPCs) hosted by different cloud service providers. During operation, the system receives a packet from a source at a first router in a first VPC, wherein the first VPC is hosted by a first cloud service provider, and wherein the packet is directed to a destination in a second VPC, which is hosted by a second cloud service provider. If no direct tunnel exists between the first VPC and the second VPC, the system forwards the packet through an intermediate hub to the second VPC, and automatically builds a direct tunnel from the first router in the first VPC to a second router in the second VPC to facilitate subsequent communications between the first and second VPCs.

Disclosed herein are systems, methods, and computer-readable media for network communication within a Lunar and Interplanetary communication system. In one aspect, a length of time of line of sight occlusion associated with an object is determined based on a position of the object within its orbit. A dynamic forwarding table is generated that schedules packet paths among nodes within the network based on the length of time of the line of sight occlusion. A packet path for a packet is determined based on the dynamic forwarding table, where the packet path is based on minimizing the length of time of the line of sight occlusion associated with the object.

Disclosed herein are systems, methods, and computer-readable media for network communication within a Lunar and Interplanetary communication system. In one aspect, a length of time of line of sight occlusion associated with an object is determined based on a position of the object within its orbit. A dynamic forwarding table is generated that schedules packet paths among nodes within the network based on the length of time of the line of sight occlusion. A packet path for a packet is determined based on the dynamic forwarding table, where the packet path is based on minimizing the length of time of the line of sight occlusion associated with the object.

The present invention discloses a clustering routing optimization method based on adaptive evolutionary algorithm for a wireless sensor network, comprising following steps: performing population initialization by initial position and energy information of sensor nodes; calculating fitness values, and implementing iterative operation of elite preservation, adaptive crossover and mutation; after the iteration, selecting a cluster head; routing data packet of the cluster head to a base station. Convergence process of the evolutionary algorithm is improved by nonlinearly adjusting the probability of crossover and mutation; upper and lower bound of crossover and mutation operators are dynamically adjusted by fitness value; adding an incentive factor, adjusting the crossover and mutation probability when the fitness value tends to converge, and running the algorithm again to confirm that a new optimal value is generated. The global search capability and convergence speed of the algorithm are improved by the above method, and avoiding local convergence.

The present invention discloses a clustering routing optimization method based on adaptive evolutionary algorithm for a wireless sensor network, comprising following steps: performing population initialization by initial position and energy information of sensor nodes; calculating fitness values, and implementing iterative operation of elite preservation, adaptive crossover and mutation; after the iteration, selecting a cluster head; routing data packet of the cluster head to a base station. Convergence process of the evolutionary algorithm is improved by nonlinearly adjusting the probability of crossover and mutation; upper and lower bound of crossover and mutation operators are dynamically adjusted by fitness value; adding an incentive factor, adjusting the crossover and mutation probability when the fitness value tends to converge, and running the algorithm again to confirm that a new optimal value is generated. The global search capability and convergence speed of the algorithm are improved by the above method, and avoiding local convergence.

Embodiments of the present disclosure relate to the technical field of communications, and in particular, to a forwarding method, a forwarding system, an electronic device, and a computer-readable storage medium. The forwarding method includes: acquiring a packet to be forwarded, and detecting whether the packet to be forwarded contains a preset indicator, wherein the preset indicator is used for indicating that the packet to be forwarded has a designated forwarding path; when the packet to be forwarded contains the preset indicator, acquiring information of a protocol header following a Bit Indexed Explicit Replication (BIER) header of the packet to be forwarded, wherein the information of the protocol header is at least used for indicating the designated forwarding path; determining a next hop according to the information of the protocol header; and forwarding the packet to be forwarded according to the next hop.