Systems and methods for path record handling in a fabric without host stack cooperation in a high performance computing environment. In a case where the subnet manager has determined homogenous subnet/fabric or semi-homogenous subnet/fabric status for the current topology, but is still receiving path queries, the subnet manager can use the relevant status to avoid any route evaluation and generate path record either only based on the configuration status of the requesting port in the homogenous case, or by comparing the configuration status of both ports in the semi-homogenous case.

Disclosed is a method for electing a root node in a mesh network, comprising the steps of: S1) when it is determined that there is no root node in the mesh network, all devices separately broadcast and transmit real-time signal strengths between the devices and a router; S2) all devices separately perform a first scanning, and each device elects, according to received real-time signal strengths between the other devices and the router and the real-time signal strength between the device and the router, a device having a maximum real-time signal strength as a root node candidate and broadcasts and transmits the same; and S3) all devices separately perform another scanning, and each device elects, according to the received root node candidates respectively elected by the other devices, a root node candidate having a maximum signal strength as a new root node candidate and broadcasts and transmits the same again until a unique root node is elected. According to the present invention, signal strengths and other information of devices may be transferred to one another in an entire mesh network, such that all devices may participate in comparison and voting to elect an optimal root node.

In one embodiment, a method comprises attaching, by a constrained network device in a data network, to a first parent network device in a tree-based storing mode topology in response to receiving a first advertisement message generated by the first parent network device; outputting to the first parent network device a plurality of routes stored in the constrained network device, the routes identifying destinations reachable via the constrained network device; determining, by the constrained network device, that the first parent network device is encountering saturation of stored routes based on the constrained network device receiving a second advertisement message from the first parent network device; and eliminating, by the constrained network device, the saturation encountered by the first parent network device based on moving at least a portion of the routes from the first parent network device to a second parent network device in the tree-based storing mode topology.

Techniques for providing a backup network path using a standby wide area network (WAN) link with reducing monitoring. Packet loss and latency metrics are monitored for network paths in an adaptive private network (APN) connecting a first user and a second user according to control traffic operating at a first control bandwidth for each network path. A determination is made that a first network path uses a standby WAN link, has packet loss and latency metrics indicative of a good quality state, and has at least one characteristic that identifies the first network path as a backup network path. The control traffic is then reduced for the backup network path to a second control bandwidth substantially less than the first control bandwidth. The backup network path is made active when the number of active network paths is less than or equal to a minimum number.

A first information handling system may detect a reboot condition for the first information handling system. The first information handling system may transmit a first notification to a second information handling system, notifying the second information handling system that the first information handling system is going to reboot. The first information handling system may transmit a second notification to a third information handling system, instructing the third information handling system to age out old root information. The first information handling system may then reboot.

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. In addition, the method includes determining paths having common endpoints among a portion of the first messages, identifying a cost for each of the paths having common endpoints, identifying a lowest cost from among the group of common endpoint costs, identifying a selected path associated with the lowest cost. 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.

A novel algorithm for packet classification that is based on a novel search structure for packet classification rules is provided. Addresses from all the containers are merged and maintained in a single Trie. Each entry in the Trie has additional information that can be traced back to the container from where the address originated. This information is used to keep the Trie in sync with the containers when the container definition dynamically changes.

In one embodiment, a device receives data regarding usage of access points in a network by a plurality of clients in the network. The device maintains an access point graph that represents the access points in the network as vertices of the access point graph. The device generates, for each of the plurality of clients, client trajectories as trajectory subgraphs of the access point graph. A particular client trajectory for a particular client comprises a set of edges between a subset of the vertices of the access point graph and represents transitions between access points in the network performed by the particular client. The device identifies a transition pattern from the client trajectories by deconstructing the trajectory subgraphs. The device uses the identified transition pattern to effect a configuration change in the network.

Aspects and examples are disclosed for apparatuses and processes for establishing a communication link between a network using a routing protocol for low power and lossy networks (RPL) and a non-RPL-enabled device. For instance, a communication link establishment method includes establishing, by a routing protocol for low power and lossy networks (RPL) enabled device, a communication link with a non-RPL-enabled device. The method also includes establishing, by the RPL-enabled device, a network connection with an RPL-enabled network. Further, the method includes providing, by the RPL-enabled device, a proxy communication link between the non-RPL-enabled device and the RPL-enabled network. Providing the proxy communication link includes assigning a globally unique address (GUA) to the non-RPL-enabled device, and transmitting, by the RPL-enabled device, a proxy destination advertisement object to the RPL-enabled network where the proxy destination advertisement object comprises the GUA.

In one embodiment, a device configures a plurality of subinterfaces for each of a plurality of physical ports of a software defined network (SDN). The device allocates a fixed amount of bandwidth to each of the subinterfaces. The device forms a plurality of midlays for the SDN by assigning subsets of the plurality of subinterfaces to each of the midlays. The device assigns a network slice to one or more of the midlays, based on a bandwidth requirement of the network slice.