Recovering and reconciling hierarchical forwarding equivalence class information includes storing routing information in a forwarding information base (FIB) corresponding to a first hierarchy of nodes; storing routing information in a routing table separate from the FIB corresponding to a second hierarchy of nodes; and comparing routing information stored for a candidate node in the first hierarchy of nodes with routing information stored for a first plurality of nodes in the second hierarchy of nodes having a height that is the same as a height of the candidate node. Routing information corresponding to the routing information stored for the candidate node is removed from the FIB when the routing information stored for the candidate node does not match any of the routing information stored among the first plurality of nodes.

Systems and methods for providing multicast group (MCG) membership relative to partition membership in a high performance computing environment. In allowing a subnet manager of a local subnet to be instructed that all ports that are members of the relevant partition should be set up as members for a specific multicast group, the SM can perform a more efficient multicast-routing process. It is also possible to limit the IB client interaction with subnet administration conventionally required to handle join and leave operations. Additionally, subnet manager overhead can be reduced by creating a spanning tree for the routing of multicast packets that includes each of the partition members added to the multicast group, instead of creating a spanning tree after each multicast group join request is received, as conventionally required.

Techniques for bridging communication between multiple networks to facilitate distribution of multicast data are described herein. For example, a node that is able to communicate with its network and an adjacent network may send a subscription message indicating that the node is a member of a multicast group. The subscription message may be forwarded up both networks. The node may then forward, between the networks, data that is destined for members of the multicast group.

In one embodiment, a method comprises causing, by an apparatus, establishment of first and second multicast trees within one or more underlay switching fabrics of one or more fat tree topologies, the first and second multicast trees comprising first and second multicast roots for multicast transmission to leaf network devices in the respective first and second multicast trees; causing, by the apparatus, establishment of an overlay tunnel between the first and second multicast roots, the overlay tunnel independent and distinct from the first and second multicast trees; causing the first multicast root to multicast transmit, via the first multicast tree, a data packet having been transmitted to the first multicast root; and causing the first multicast root to unicast transmit the data packet to the second multicast root via the overlay tunnel, for multicast transmission of the data packet by the second multicast root via the second multicast tree.

In one embodiment, a method comprises identifying a fat tree network topology comprising top-of-fabric (ToF) switching devices, an intermediate layer of intermediate switching devices connected to each of the ToF switching devices, and a layer of leaf network devices; and causing a first leaf network device to initiate establishment of first and second redundant multicast trees for multicasting of data packets, including: causing first and second ToF switching devices to operate as roots of the first and second multicast trees according to first and second attribute types, respectively, causing the first leaf network device to select first and second of the intermediate switching devices as first and second flooding relays belonging to the first and second attribute types, respectively, and causing the first and second flooding relays to limit propagation of registration messages generated by the first leaf network device to the first and second ToF switching devices, respectively.

Described are programmable IO devices configured to perform operations. These operations comprise: determining a set of range-based elements for a network; sorting the set of range-based elements according to a global order among the range-based elements; generating an interval table from the sorted range-based elements; generating an interval binary search tree from the interval table; propagating data stored in subtrees of interior stages of the interval binary search tree to subtrees of a last stage of the interval binary search tree such that the interior stages do not comprise data; converting the interval binary search tree to a Pensando Tree; compressing multiple levels of the Pensando Tree into cache-lines; and assembling the cache-lines in the memory unit such that each stage can compute an address of a next-cache line to be fetched by a next stage.

System and method for supporting scalable bitmap based P_Key table in a high performance computing environment. A method can provide, at least one subnet comprising one or more switches, a plurality of host channel adapters, and a plurality of end nodes. The method can associate the plurality of end nodes with at least one of a plurality of partitions, wherein each of the plurality of partitions are associated with a P_Key value. The method can associate each of the one or more switches with a bitmap based P_Key table of a plurality of bitmap based P_Key tables. The method can associate each of the host channel adapters with a bitmap based P_Key table of the plurality of bitmap based P_Key tables.

Disclosed are examples of systems, apparatus, devices, computer program products, and methods implementing aspects of digital content retrieval using a decentralized content fabric. In some implementations, fabric nodes of an overlay network are provided. A first fabric node is configured to: determine, responsive to a client request for a content object part, that the content object part is not stored locally at the first fabric node; identify a second one or more fabric nodes as a best match; send a network request for the content object part to the second one or more fabric nodes; obtain the content object part from the second one or more fabric nodes; and process the content object part with further content object parts to produce the digital content for the client.

In one embodiment, a technique for load balancing of throughput for multi-PHY networks using decision trees is provided. A first device of a mesh communication network may collect at least one transmission metric indicative of a primary link and a secondary link between the first device and a second device of the mesh communication network. The first device may provide the at least one transmission metric as input to one or more decision trees comprising one or more attributes that are each indicative of a threshold for a corresponding transmission metric. The first device may obtain an output from the decision tree comprising a selection of either the primary link or the secondary link. The first device may send, based on the output from the decision tree, one or more packets to the second device using the selected link.

Disclosed are examples of systems, apparatus, devices, computer program products, and methods implementing aspects of a decentralized system for security and access control associated with digital content. In some implementations, a software stack is executed to provide fabric nodes of an overlay network. A transaction encrypted with a private key of a client can be recorded in a ledger identifying addresses of fabric nodes of the overlay network. The transaction can be identified by a transaction identifier (ID), and the private key can be part of a public/private key pair representing an account of the client on the ledger. A digital contract can be invoked, where the digital contract represents one or more terms of access for digital content stored in the overlay network. Controlled client access to the digital content can be based on an authorization token obtained from the client.