Embodiments of this application disclose a collective communication method, apparatus, and system. The method includes: A first network device receives a first packet; the first network device receives at least one second packet; and the first network device sends a third packet based on the first packet and the at least one second packet. When no connection is established between the first network device and a terminal device, the first network device may aggregate and distribute collective communication packets by using a connection between the first terminal device and another terminal device.

Embodiments of this application disclose a collective communication method, apparatus, and system. The method includes: A first network device receives a first packet; the first network device receives at least one second packet; and the first network device sends a third packet based on the first packet and the at least one second packet. When no connection is established between the first network device and a terminal device, the first network device may aggregate and distribute collective communication packets by using a connection between the first terminal device and another terminal device.

Systems and methods are disclosed for identifying a set of internal edges on a representation of a network that satisfy a set of demands on the network. The disclosed systems and methods perform a multi-step process of selecting the internal edges. In a first step, an initial set of internal edges can be selected using a clique graph (or in another suitable manner). In a second step, a second set of internal edges can be selected using stream graph(s) (or in another suitable manner). The second set of internal edges can be used when determining network paths that satisfy the demands. When the representation of the network has a cut of two, the disclosed systems and methods can identify a set of internal edges providing a degree of protection against link failure.

A method for establishing a communication through multiple distinct communication paths deployed over different network operators includes collecting location information of network nodes of available distinct paths between a source node and destination node, comparing location information of the network nodes to identify possibly co-located network nodes, determining path segment lengths of consecutive path segments between the nodes of each path, estimating whether path segments of the paths intersect based on locations of the network nodes and the path segment lengths, selecting multiple paths that do not include intersecting path segments and/or co-located network nodes, and establishing communication between the source node and destination node over both selected paths.

Various example embodiments for supporting load balancing in packet switched networks are presented herein. Various example embodiments for supporting load balancing in packet switched networks may be configured to support load balancing in packet switched networks based on use of disjoint trees. Various example embodiments for supporting load balancing in packet switched networks may be configured to support load balancing in packet switched networks based on use of maximally disjoint trees. Various example embodiments for supporting load balancing in packet switched networks based on use of maximally disjoint trees may be configured to support load balancing in packet switched networks using per-flow load balancing, per-packet load balancing, randomized load balancing (RLB), or the like, as well as various combinations thereof.

A method includes: establishing, by a first network device, a first BMP session with a second network device, and establishing a second BMP session with a third network device; receiving a first BGP route set sent by the second network device, where the first BGP route set includes a BGP route sent by the second network device to the third network device; receiving a second BGP route set sent by the third network device, where the second BGP route set includes the BGP route received by the third network device from the second network device; and when detecting that the second BGP route set includes a first BGP route but the first BGP route set does not include the first BGP route, determining the first BGP route as an unavailable route.

A method includes: establishing, by a first network device, a first BMP session with a second network device, and establishing a second BMP session with a third network device; receiving a first BGP route set sent by the second network device, where the first BGP route set includes a BGP route sent by the second network device to the third network device; receiving a second BGP route set sent by the third network device, where the second BGP route set includes the BGP route received by the third network device from the second network device; and when detecting that the second BGP route set includes a first BGP route but the first BGP route set does not include the first BGP route, determining the first BGP route as an unavailable route.

In general, techniques are described for enabling a network of network devices (or “nodes”) to provide redundant multicast streams from redundant multicast sources to an egress network node. In some examples, the egress network node (or a controller for the network) computes maximally redundant trees (MRTs) from the egress network node to a virtual proxy node virtually added to the network topology by the egress network node for redundant multicast sources of redundant multicast streams.

A system, and corresponding method, is described for finding the optimal or the best set of routes from a master to each of its connected slaves, for all the masters and slaves using a Network-on-Chip (NoC). More precisely, some embodiments of the invention apply to a class of NoCs that utilize a two-dimensional mesh topology, wherein a set of switches are arranged on a two-dimensional grid. Masters (initiators or sources) inject data packets or traffic into the NoC. Slaves (targets or destinations) service the data packets or traffic traveling through the NoC. The NoC includes switches and links. Additionally, the optimal routes defined by the system includes moving the traffic in a way that avoids deadlock scenarios.

A system, and corresponding method, is described for finding the optimal or the best set of routes from a master to each of its connected slaves, for all the masters and slaves using a Network-on-Chip (NoC). More precisely, some embodiments of the invention apply to a class of NoCs that utilize a two-dimensional mesh topology, wherein a set of switches are arranged on a two-dimensional grid. Masters (initiators or sources) inject data packets or traffic into the NoC. Slaves (targets or destinations) service the data packets or traffic traveling through the NoC. The NoC includes switches and links. Additionally, the optimal routes defined by the system includes moving the traffic in a way that avoids deadlock scenarios.