Aspects of the subject disclosure may include, for example, embodiments and a method. The method includes iteratively providing messages to each Node Processor. Each Node Processor represents a node of a group of nodes. The iteratively providing of the messages comprises providing first messages. Each first message includes a cost associated with a path of nodes visited by each first message. A selected path is obtained from each node having a lowest cost of a group of common endpoint costs for paths having common endpoints. A next group of messages includes the selected path. The iteratively providing of the messages results in selected paths. Also, the method include determining a target path from a remaining path. Other embodiments are disclosed.

The present invention generally relates to high performance computers and datacenter environments. A self-supporting communication network includes multiple nodes, which are arranged in a polyhedral cluster, which can also be described by a networking topology. The nodes are configured to convey data traffic between source hosts and respective destination hosts by routing packets among the nodes in the shortest possible time, and with a substantially greater number of nearest network connections, for the given level of network load and contention. A routing algorithm describes this traffic. Polyhedral clusters may be close-packed into a lattice, creating a scalable exascale computer, which self-supporting, thus requiring no external racks or exoskeleton. Various configurations of close-packed lattices of polyhedral clusters may enhance different compute workloads. The cluster may also disassemble and reassemble, without requiring an extensive data center environment. The close-packing of polyhedral compute clusters enables new connections among peripheral nodes, creating dual and quad connections, scaling the connectivity and processing of its same processors. Memory is also shared among clusters, creating an enhanced distributed memory machine, or, a massively parallel shared memory system. Additionally, power, cooling, and data infrastructure are also distributed across the polyhedral topology, improving their performance, and reducing maintenance requirements. In embodiments of the present invention, conventional switches can be connected into a polyhedral topology whereby improving their performance over rectilinear configurations. The present invention offers improved performance for big data analysis, nearest neighbor computing, and deep learning workloads. The present embodiments offer improved connectivity over many topologies such as Fat Tree, Dragonfly, and others which employ radix switches with a fixed number of ports, by enabling modular network components connect in a scalable, self-supporting lattice, creating a virtually limitless network.

A device, method, and computer readable storage medium for routing in a computational grid arranged in a fat-tree, including performing preprocessing, performing base path routing to determine rules for routing in switches based on stored switch level, switch group, links between switches, links between switches and hosts, and fat-tree type, and performing run-time processing, including detecting a path fault, and determining at least one redundant path for the path fault. The base path routing determines a first routing rule that specifies a certain destination in every switch. The run-time processing further performs searching for a first match between a packet and a source-destination pair, and when the first match is not found, performs searching for a second match between the packet and the first routing rule that specifies the certain destination. By using routing rules that specific a destination, the routing in a computational grid can significantly scale up.

The present disclosure provides a protection assistance device of multiple circuit breakers in a low-voltage system, in which protection assistance in both directions from the upper side to the lower side or from the lower side to the upper side is possible, and the number of wires for protection assistance between multiple upper/lower circuit breakers can be minimized. The protection assistance device includes at least one upper low-voltage circuit breaker; at least one middle low-voltage circuit breaker; at least one lower low-voltage circuit breaker; and a communication line which makes a communication connection between the low-voltage circuit breakers, wherein the low-voltage circuit breakers comprise a control unit for, when a trip operation of automatically breaking a circuit is performed, transmitting a communication packet for reporting a trip operation state to at least one predetermined circuit breaker among the circuit breakers through the communication line.

A method includes receiving, by a first network device, messages from a plurality of network devices in a network, each of the messages indicating a level value of a respective sending network device in a network topology, determining, by the first network device and based on the respective levels indicated by the messages, a level value of the first network device in the network topology, determining, by the first network device and based on the determined level value, a mechanism by which to forward network traffic to one or more of the plurality of network devices, and forwarding the network traffic according to the determined mechanism.

In one embodiment, a method is performed. A spine node in communication with a network may determine a subtree of a shadow cone of the spine node. The subtree may comprise a plurality of nodes and a plurality of links connecting pairs of the nodes. The spine node may determine a disaggregated route to a first leaf node to which a disaggregated prefix may be attached. The disaggregated route may be propagated to the plurality of the nodes of the subtree.

A routing system for providing multicast access control includes a plurality of routers including a multicast source router and a plurality of multicast receiver routers, the plurality of routers providing a multicast service, wherein the routers are configured to enforce multicast access control policies for the multicast service including a receiver access policy that controls which multicast receivers are allowed to receive packets from the multicast service and a sender access policy that controls which multicast sources are allowed to send packets to the multicast service for distribution to the multicast receivers.

In order to facilitate efficient and scalable lookup of current hop limits of transmitted packets, a communications device embeds hop limit values along with other connection parameters in a connection data structure. To transmit a packet for a particular connection, the communications device retrieves the data structure for the particular connection and applies the hop limit value embedded in the data structure to the packet for transmission. To keep track of the hop limits being embedded in different data structures of different connections, the communications device use a binary search in which each node of the search tree correspond to a different connection. The communications device maintains one such search tree per communications interface.

System and method for supporting scalable representation of link stability and availability in a high performance computing environment. A method can provide at attribute at each node in a subnet, wherein the attribute provides a single location at each node for a subnet manager to query the stability and availability of each link connected to the queried node. The attribute can be populated and maintained by a subnet management agent residing at the node.

Systems and methods for unicast traffic across multiple subnets in a high performance computing environment. In accordance with an embodiment, a local inter-subnet manager (ISM) can allocate at least one router port in the local subnet for receiving traffic for a relevant end node belonging to an inter-subnet partition (ISP) for each remote subnet that also comprises end nodes sharing a same ISP membership, and can also set up address mappings for the relevant GID(s) (e.g., GID or GUID to LID mapping).