A method for detecting communication loop in an ad hoc network is provided. The method may comprise: receiving, at a node of the ad hoc network, a message comprising a commutative value, wherein the node is associated with a node identifier and the commutative value pertains to node identifiers associated with one or more nodes along a path the message has been traversed along regardless of the order of the nodes; and determining, with aid of one or more processors, presence of a loop based on whether the commutative value is identical to a previously obtained commutative value.

A network interface card installed in a chassis switch, which includes a switch device and a controller, is provided. The switch device includes a plurality of ports coupled to other network interface cards in the chassis switch, and each of the other network interface cards is a fabric card or a line card. The controller is configured to perform different acts according to the card type of the network interface card, wherein the acts constitute a specific process of path planning which may prevent loops from occurring in the communication paths of control packet delivery between multiple network interface cards in the chassis switch.

Systems, methods, and non-transitory computer-readable storage media for detecting network loops. In some embodiments, a system can identify a network path having multiple hops associated with respective nodes which are configured in a forwarding mode. The system can traverse the network path to identify, for each node from the respective nodes, a respective next hop. Based on the respective next hop for each node, the system can determine whether two or more nodes from the respective nodes have a same respective next hop. When the two or more nodes have the same respective next hop, the system can determine that the network path has a network loop.

Systems, methods, and non-transitory computer-readable storage media for detecting network loops. In some embodiments, a system can identify a port that is in a blocking state. The blocking state can be for dropping one or more types of packets and preventing the port from forwarding the one or more types of packets. The system can determine a number of packets transmitted through the port by a hardware layer on the system and a number of control packets transmitted through the port by a software layer on the system. The system can determine whether the number of packets is greater than the number of control packets. When the number of packets is greater than the number of control packets, the system can determine that the blocking state has failed to prevent the port from forwarding the one or more types of packets.

This disclosure is directed to a method, system, and device for disabling links within a computer network based on a loop link priority parameter. The method includes detecting a loop in a network in a network communication device having multiple interfaces associated with different priorities. The device may transmit a first network packet as a loop check packet outbound from the network communication device via a first interface port. The device may then receive a second network packet (which may be the first outbound packet returning inappropriately to the device) as an inbound network communication via a second interface port. If the device identifies return of a sent loop check packet, it may disable one of the first interface port or the second interface port based on a comparison of loop link priority parameters to remove the loop in the network.

Embodiments of the invention relate to virtual link aggregation. One embodiment includes forming one or more virtual links using physical links connecting a first networking element, a second networking element and a third networking element. A first trigger status indication is used for blocking network traffic for avoiding traffic loops occurring over the one or more virtual links.

Methods, devices and computer readable storage media for performing bit indexed explicit replication (BIER) are disclosed. One embodiment of a method includes receiving, at an ingress node of a network, a data packet comprising a multicast group identifier. This embodiment also includes obtaining, from a group membership table, a bit mask corresponding to the multicast group identifier. The bit mask comprises a plurality of bit positions, and each bit position corresponds to a respective egress node of the network. The embodiment also includes encapsulating the data packet with the bit mask and forwarding the encapsulated data packet using the bit mask.

Example methods, apparatuses, and systems for transmitting data in a wireless local area network mesh network are described herein. One example method includes receiving, by a first mesh station, a first data frame sent by a second mesh station, where a transmitter address of the first data frame is a MAC address of the second mesh station, and wherein the first and second mesh stations belong to different mesh gates. The first mesh station determines that the first data frame is one of a broadcast data frame, a multicast data frame, or an unknown unicast data frame and, further, that the first mesh station and the second mesh station belong to different mesh gates. In response to these determinations, the first data frame is discarded. The examples methods can be applied to a wireless mesh network including multiple mesh gates.

The problem of routing micro-loops in networks having a CLOS topology, such as data center CLOS networks employing the exterior border gateway protocol (eBGP) for example, is solved by: (a) receiving, on an interface of one of the nodes, a datagram, the datagram including destination information; (b) determining a next hop and an egress interface using (1) an identifier of the interface on which the datagram was received, (2) the destination information of the received datagram, and (3) stored forwarding information such that a routing micro-loop is avoided without discarding the datagram; and (c) forwarding the datagram via the egress interface. For example, this problem may be solved by (a) receiving, on an interface a node of the CLOS network, a datagram, the datagram including destination information; (b) looking up, using the destination information of the received datagram and stored forwarding information, a next hop egress interface on the node; (c) determining whether or not the next hop egress interface on the node is the same as the interface on which the datagram was received; and (d) responsive to a determination that the next hop egress interface on the node is the same as the interface on which the datagram was received, (1) replacing the next hop egress interface with a safe multipath next hop egress interface, and (2) forwarding the datagram via the safe multipath next hop egress interface, and otherwise, responsive to a determination that the next hop egress interface on the node is not the same at the interface on which the datagram was received, simply forwarding the datagram via the next hop egress interface.

Systems, methods, and computer-readable storage media for detecting network loops. A system can identify, for each virtual tunnel endpoint (VTEP) from multiple VTEPs in a network, respective media access control address data including the respective local interface media access control addresses of the respective VTEP and respective media access control addresses learned by the respective VTEP. The system can determine whether the VTEPs are running spanning tree protocol (STP), and whether a media access control address learned by a first VTEP matches a respective local interface media access control address of a second VTEP. The system can detect a loop when the media access control address learned by the first VTEP matches the respective local interface media access control address of the second VTEP. The system can also detect a loop when the VTEPs are running STP and the first and second VTEPs see the same STP root bridge.