A method and network device for root selection, where the method includes: obtaining link costs of links connecting a plurality of nodes in the network; selecting a weighting parameter based at least partly on the link costs; calculating node costs corresponding to each of the plurality of the nodes based on the link costs and the weighting parameter; and selecting a node as the root node based on the node costs, wherein the root node is selected from the plurality of nodes.

Disclosed is a mechanism for implementing link state flooding reduction (LSFR) in an Interior Gateway Protocol (IGP) network. The mechanism includes receiving data indicating connectivity of a plurality of nodes in the network. A flooding topology is built based on the connectivity. This includes selecting one of the nodes as a root node, and building a tree of links connecting the root node to the nodes in the network. The flooding topology is stored in a memory. The flooding topology may not be to the remaining nodes in the network. Link state messages may then be flooded over the flooding topology.

A method for setting up forwarding tables is described. A USAT part for a node is received. The USAT part includes glow definitions and a FGPL. Each glow describes network traffic flows and role instructions for the flows. Each FGP describes a role for the switching node; a validity rule; and relevant network topology. The method also includes determining a selected active FGP in the FGPL using the validity rule for the FGP, a network state and the ordering of the FGPs; initializing the glows, requesting a role identification to perform based on the selected FGP, determining the role instructions and instructing the TMS to update tables accordingly; and storing entries in software tables based on glows and the role instructions for the identified role, dynamically resolving conflicts among entries, and granting table updates to hardware tables. The tables include a software table for each hardware memory for forwarding packets.

A wireless mesh network is described. It uses a plurality of Wi-Fi nodes organized in a tree shape. The nodes include one or more root access point (RAP) nodes having a wired connection to an external network and one or more mesh access point (MAP) nodes. A MAP node is in a data communication with the external network through an associated RAP node either directly or by another MAP node in a data communication with the external network through its associated RAP node. A MAP node automatically connects to the associated parent node by selecting a single associated parent node from one or more potential parent nodes that are within a direct wireless communication range of the MAP node and establishing a parent-child relationship with the associated parent node.

A control method for a spanning tree protocol (STP) of an EasyMesh network, wherein the STP includes a plurality of stations, includes assigning a bridge identification (ID) to each of the plurality of stations to classify the plurality of stations into a plurality of network layers; assigning a first station of the plurality of stations as a root bridge; determining a root port of each of the plurality of stations and a corresponding path cost to the root bridge; and blocking a designated port of a lower station of the plurality of stations at a lower layer of the EasyMesh network, when a network loop is detected.

A particular fat tree network node stores default routing information indicating that the particular fat tree network node can reach a plurality of parent fat tree network nodes of the particular fat tree network node. The particular fat tree network node obtains, from a first parent fat tree network node of the plurality of parent fat tree network nodes, a negative disaggregation advertisement indicating that the first parent fat tree network node cannot reach a specific destination. The particular fat tree network node determines whether the first parent fat tree network node is the only parent fat tree network node of the plurality of parent fat tree network nodes that cannot reach the specific destination. If so, the particular fat tree network node installs supplemental routing information indicating that every parent fat tree network node except the first parent fat tree network node can reach the specific destination.

Disclosed is a mechanism for implementing link state flooding reduction (LSFR) in an Interior Gateway Protocol (IGP) network. The mechanism includes receiving data indicating connectivity of a plurality of nodes in the network. A flooding topology is built based on the connectivity. This includes selecting one of the nodes as a root node, and building a tree of links connecting the root node to the nodes in the network. The flooding topology is stored in a memory. The flooding topology may not be to the remaining nodes in the network. Link state messages may then be flooded over the flooding topology.

A control method for a spanning tree protocol (STP) of an EasyMesh network, wherein the STP includes a plurality of stations, includes assigning a bridge identification (ID) to each of the plurality of stations to classify the plurality of stations into a plurality of network layers; assigning a first station of the plurality of stations as a root bridge; determining a root port of each of the plurality of stations and a corresponding path cost to the root bridge; and blocking a designated port of a lower station of the plurality of stations at a lower layer of the EasyMesh network, when a network loop is detected.

In multicast management, topology information identifying multicast distribution paths is maintained at a router serving as a root of a multicast distribution tree and/or as a first hop router. The router can detect congestion or failures based on messages from other routers. The router can request another router to change the multicast distribution paths as needed to load-balance the traffic, avoid congestion or failure, or eliminate duplicate traffic. In some embodiments, ECMP Redirect functionality is expanded to ECMP paths of arbitrary number of hops. Other features are also provided.

A particular fat tree network node stores default routing information indicating that the particular fat tree network node can reach a plurality of parent fat tree network nodes of the particular fat tree network node. The particular fat tree network node obtains, from a first parent fat tree network node of the plurality of parent fat tree network nodes, a negative disaggregation advertisement indicating that the first parent fat tree network node cannot reach a specific destination. The particular fat tree network node determines whether the first parent fat tree network node is the only parent fat tree network node of the plurality of parent fat tree network nodes that cannot reach the specific destination. If so, the particular fat tree network node installs supplemental routing information indicating that every parent fat tree network node except the first parent fat tree network node can reach the specific destination.