This can be achieved by using the Spanning tree protocol.

Switching loops are largely addressed with spanning tree protocol.

Spanning tree protocol can be used with an EtherChannel.

Configuration BPDU, used by Spanning tree protocol to provide information to all switches.

This hazard can also be avoided by using switches that can detect and deal with loops, for example by implementing the spanning tree protocol.

The feature serves as an alternative to Spanning Tree Protocol (STP).

The first spanning tree protocol was invented in 1985 at the Digital Equipment Corporation by Radia Perlman.

Classic bridges may also interconnect using a spanning tree protocol that disables links so that the resulting local area network is a tree without loops.

The solution is to allow physical loops, but create a loop-free logical topology using the spanning tree protocol (STP) on the network switches.

The spanning tree that the bridges compute using the Spanning Tree Protocol can be determined using the following rules.

It allows rings of Ethernet switches to overcome any single failure with recovery time much faster than achievable with Spanning Tree Protocol.

They are invisible to current IP routers and, like routers, RBridges terminate the bridge spanning tree protocol.

If one of the active connections fails, the spanning tree protocol (STP) is executed again to create a new spanning tree so the network keeps running.

The older IEEE 802.1D spanning tree protocol could be quite slow, with forwarding stopping for 30 seconds while the spanning tree reconverged.

By eliminating any broadcasting or flooding, and by using only the loop-free forwarding paths configured by management, there is no longer any need to use a spanning tree protocol.

The operation of the bridge is simpler (spanning tree protocol is not necessary) and much of the bridging functions are performed by the end systems, particularly the sources, giving rise to its name.

Bridge Protocol Data Units (BPDUs) are frames that contain information about the Spanning tree protocol (STP).

Spanning tree protocols (STP/RSTP/MSTP)

Is not a part of RRCP protocol itself, but is closely associated, being an underlying mechanism for a simplified Spanning tree protocol substitute in RRCP-capable switch controllers.

As beneficial as VTP can be, it does have disadvantages that are normally related to the spanning tree protocol (STP) as a bridging loop propagating throughout the network can occur.

In a network utilising SMLT, it is often no longer necessary to run a spanning tree protocol of any kind since there are no logical bridging loops introduced by the presence of the IST.

In IP multicast the implementation of the multicast concept occurs at the IP routing level, where routers create optimal distribution paths for datagrams sent to a multicast destination address Spanning tree protocol in real-time.

The protocol differs from many others in use as it combines Layer 2 and Layer 3 resilience - effectively doing the jobs of both Spanning tree protocol and the Virtual Router Redundancy Protocol at the same time.

This "Per-VLAN" Multiple Spanning Tree Protocol configures a separate Spanning Tree for each VLAN group and blocks all but one of the possible alternate paths within each Spanning Tree.

An example is the Spanning tree protocol, which creates a graph (or mesh) representation of a data network and figures out which associations between switching nodes need to be broken to turn it into a tree and thus prevent data going around in loops.