RRSTP: A Spanning Tree Protocol for Obviating Count-to-Infinity from Switched Ethernet Networks

This paper proposes a highly reliable and rapidly converging spanning tree protocol named asReliable Rapid Spanning Tree Protocol. The need of this spanning tree protocol is felt becausereliability of switched Ethernet networks is heavily dependent upon that of spanning tree protocol.But current standard spanning tree protocol – Rapid Spanning Tree Protocol – is well known forits susceptibility to classical count-to-infinity problem. Because of this problem the protocol hasextremely variable and unexpectedly high convergence time even in small networks. As a resultnetwork wide congestion, frame loss and frame delay may occur. Even forwarding loops may beinduced into the network under certain circumstances. It is expected that the new protocol –RRSTP – will significantly increase the dependability of switched Ethernet networks by providingguaranteed protection against the count-to-infinity problem.