Question: Bridges run Spanning Tree Algorithm (STA) to form a tree topology. In the steady state of STA, only Root Ports and Designated Ports are active;

Bridges run Spanning Tree Algorithm (STA) to form a tree topology. In the steady state of STA, only Root Ports and Designated Ports are active; Other ports are blocked. When topology changes, a bridge may hear inferior configuration of original designated router from its blocked port. Before unblocking this port, it should wait for a certain time. Suppose we have a new protocol "STP-', which simply takes away this feature, i.e. the bridge immediately unblocks this port and start announcing its own configuration. Construct a case where "STP-" results in an infinite propagation of bridge configuration message AND/OR infinite flooding of data packets upon topology change. Your answer should include: The original topology with all information in the steady state: bridge id, root bridge, root The changed topology and specification of the changes. Add additional assumptions The way the data packets AND/OR configuration messages are infinitely looping around. port, designated port. when necessary, e.g. the propagation delay on each link. Show that the bridge network eventually meltdown under your assumptions
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
