A method for method for managing a computer network is proposed, which comprises: performing data collection configuration for at least one network node of the computer network belonging to a set of one or more network nodes corresponding to a first depth level of a routing tree, the data collection configuration comprising: receiving respective first configuration data from at least one child node in the routing tree of the at least one network node of the computer network, wherein the at least child node corresponds to a second depth level of the routing tree which immediately follows the first depth level in a sequence of depth levels of the routing tree, and generating second configuration data based on the received first configuration data.

Example apparatus and methods for optimized route invalidation using modified no-path Destination Oriented Directed Acyclic Graph Advertisement Object (DAO) signaling are disclosed. In one example method, a node switching its current parent is adapted to send a regular DAO message. Using the changed signaling, a common ancestor node generates a No-Path destination oriented directed acyclic graph advertisement object message (NPDAO) on behalf of the switching node on receiving a refreshed DAO from an alternate path. The common ancestor node reuses a same Path Sequence from the regular DAO based on which the NPDAO gets generated. The common ancestor node detects routing anomaly using next hop mismatch on reception of the DAO to generate the NPDAO on behalf of the target node. The No-Path DAO traverses downward/downstream along the previous path.

A STP n-node VLT system includes a first VLT device with a first virtual port, and a second VLT device with a LAG port, a non-LAG port, and a second virtual port coupled to the first virtual port. A STP engine designates the first VLT device as a root bridge and, in response, designates the first virtual port a designated port and the second virtual port a root port. The STP engine then designates a networking device coupled to the LAG port as the root bridge based on it having a higher priority than the first VLT device. Then STP engine then determines that a non-LAG link between the networking device and the second VLT device has caused the redesignation of the second virtual port as an alternate port and the non-LAG port as a root port, and swaps the designations of the second virtual port and the non-LAG port.

Systems, methods, and computer-readable media for validating routing table information in a network. A network assurance appliance may be configured to retrieve routing table information from a plurality of nodes in a network fabric. The routing table information includes path information from at least one source node to at least one destination node. A graph representation of the routing table information is constructed with the at least one destination node as a sink vertex for the graph representation. The network assurance appliance determines, for each leaf node in the network fabric, whether the leaf node can reach the sink vertex based on the graph representation and determines that there is a misconfiguration of the network fabric based on whether each leaf node in the fabric can reach the sink vertex.

Systems and methods for using InfiniBand routing algorithms for Ethernet fabrics in a high performance computing environment. The method can provide, at a computer comprising one or more microprocessors, a plurality of switches, a plurality of hosts, a topology provider (TP) module, a routing engine (RE) module, and a switch initializer (SI) module. The method can perform a discovery sweep, by the TP, of the plurality of hosts and the plurality of switches and assigns an address to each of the plurality of hosts and the plurality of switches. The method can calculate, by the routing engine, a routing map, based upon a routing scheme, for the plurality of hosts and the plurality of switches, the routing map comprising a plurality of forwarding tables. The method can configure, each of the plurality of switches with a forwarding table of the plurality of forwarding tables calculated by the routing engine.

The method is applied to an SDN network, where the SDN network includes one target computing apparatus and a plurality of openflow switches. The target computing apparatus communicates with the plurality of openflow switches. The method includes: receiving, by the target computing apparatus, a first bridge protocol data unit (BPDU) packet sent by a first openflow switch, where the first BPDU packet carries a device identifier and a port identifier; generating, by the target computing apparatus, a feedback packet based on the first BPDU packet, where the feedback packet includes spanning tree protocol information of a conventional switching device, and carries the port identifier; and sending, by the target computing apparatus, the feedback packet to the first openflow switch based on the device identifier.

A system includes a plurality of communication apparatuses grouped into groups, a delivery apparatus that delivers content to the communication apparatuses that belong to the groups, and a communication control apparatus that performs grouping. The communication control apparatus acquires transmittability of the delivery apparatus, acquires transmittability of the communication apparatuses, and acquires bit rates of the content, and the grouping unit determines total transmittability of the communication apparatuses of each of the groups and a total of the bit rates, and performs grouping such that either higher one of the total transmittability and the total bit rate does not exceed transmittability of the communication apparatuses of a group in a higher hierarchical level.

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.

A wireless sensor network node selection that efficiently manages active nodes using a Tabu heuristic coupled with minimum spanning tree routing protocol (TNS-MST) is presented. Nodal energy consumption is balanced to ensure all nodes are operating at the same energy level. To balance the energy consumption, nodes with high energy depletion are removed from routing by placing on them a Tabu list, which prevents the most used nodes, such as nodes close to a base station, from draining before their neighbors. The nodes in the Tabu lists are dynamically active according to the energy level of neighboring nodes. The Tabu list combined with Minimum Spanning Tree routing protocol, TNS-MST, greatly increases network lifetime by optimally balancing the energy of the sensor nodes.

System and method for supporting scalable representation of switch port status in a high performance computing environment. In accordance with an embodiment, a scalable representation of switch port status can be provided. By adding a scalable representation of switch port status at each switch (both physical and virtual)—instead of getting all switch port changes individually, the scalable representation of switch port status can combine a number of ports that can scale by just using a few bits of information for each port's status.