Objective: The STP is designed to a map-redundant topology without causing any loop in
the network, as “loops” can create broadcasting storms which, in turn, degrade the performance of
the network. However, STP improves the performance of a network’s traffic regulation.
Spanning Tree Protocol: STP makes a network redundant, in a tree form (In a normal network,
many loops exist. So, STP blocks some ports which create loops. Broadcast Protocol Data Unit
(BPDU) is a packet which is sent by every node in the network. In this algorithm we have one root
bridge which is selected according to the smallest bridge ID.
Algorithm: Root failure is a main challenge for both, STP and RSTP. In the first step of the root selection
process, the node having the smallest vector (MAC address + priority) is selected as the root
node of the tree. At the time of the root selection process, every node broadcasts its ID to every other
node, and, at the same time, every node piggybacks its ID in the broadcast, by which every node
updates its database while a numbering can be assigned to every node.
Result and Conclusion: As a result if root node failure, STP –M takes less time than STP and
RSTP. STP-M, observed that every node already knows the next root node of the tree. It reduces
message overhead in the network. On the basis of the results, we observe that STP-M improves the
performance of the network.