Rapid Spanning Tree Protocol Technoligy For LAN Network



Rapid Spanning Tree Protocol (RSTP) could be a network protocol that ensures a loop-free topology for LAN networks.


Rapid Spanning Tree Protocol (RSTP) as 802.1w.RSTP provides considerably quicker spanning tree convergence once a topology change, introducing new convergence behaviors and bridge port roles to try to to this.RSTP was designed to be backwards-compatible with standard stp.

Performance of the Rapid Spanning Tree Protocol in Ring

Network Topology

RSTP provides faster reconvergence time than the first standard temperature by distinctive sure links as point-to-point and by using protocol handclasp messages instead of mounted timeouts. once a point-to-point link fails, the alternate link will transition to the forwarding state while not anticipating any protocol timers to expire. Consequently, RSTP convergence is some fifty milliseconds for point-to-point links.

Port operation is comparable between standard temperature and RSTP. In both, the state of the port is variable, and determines if the port blocks or forwards traffic. in addition, the role a port plays within the active topology varies, if it’s calculated to be a root port, a delegated port, and so on.

For example, in atmosphere there are not any operational variations between a port within the blocking state and a port within the listening state. each port states discard frames and don’t learn raincoat addresses. the important difference is within the role the spanning tree assigns to the port. you’ll assume that a listening port is either a chosen port or a root port, and is within the method of transitioning to the forwarding state. Once within the forwarding state, there’s no thanks to infer from the port state whether or not the port is root or selected.
This is a weakness of the state-based word of atmosphere. to handle this issue, RSTP decouples the role and therefore the state of a port.

Enhanced RSTP (eRSTP)

RSTP doesn’t support LANs with a bridge diameter greater than 40

Siemens Ruggedcom developed an enhanced version of the RSTP algorithm referred to as eRSTP which is fully compatible with the IEEE 802.1w RSTP protocol while enhancing it in several aspects:

  • eRSTP reduces failover and recovery times to just a few milliseconds (5ms per a pair of bridges involved in the topology change)
  • eRSTP is able to operate in larger LANs with a bridge diameter greater than 20

Analytical Method for Calculating Ring Failover Times

RSTP is a difficult protocol because it permits for any network topology from a hoop to a full mesh. Analytical determination of the failover and recovery performance for an arbitrary network and fault situation may be a non trivial exercise
The worst case ring network failover time just in case of one link failure may be calculated using the subsequent formulae:

TL + (N – 3)*TPA , if N is even

 TL + (N – 2)*TPA , if N is odd

where: N – Number of switches in the ring

TL – Time required by a switch to detect a link failure

TPA – Time required by a pair of switches to perform RSTP Proposal-Agreement handshaking;

equal to the sum of the BPDU processing times in both switches of the pair.

The worst case failover time in case of a root bridge failure can be calculated using the formulae:

TL + (2*N – 5)*TPA , if N is even

 TL + (2*N – 4)*TPA , if N is odd

Derivation of a root bridge failover time

Failure of the root bridge needs electing a brand new root bridge that adds additional complexness compared to the one link failure analysis. Figure below shows the network in steady state before the foundation bridge fails. once the foundation bridge failure, the ring is split into 2 segments. Failure occur between IES-4 andIES-5.Now IES connected once IES-5 can send knowledge in reverse direction to alter communication for HMI.

Leave a comment