Documenti di Didattica
Documenti di Professioni
Documenti di Cultura
Most of the industries depend on the performance of the Ethernet networks. What would happen if the network failures? Reasons of the failure?
Cable redundancy is tried by configuring the network in either ring or parallel branches.
Redundancy networks.
Disadvantages of the Redundancy networks. -- Broadcast storms -- Multi frame copies -- MAC address table instability -- Loops
The solution is to allow physical loops but to create a logical loop free topology.
The idea of connecting networks in redundant way is ? The only disadvantage is Loops, how it would be if we can disable the loops??
a loop.
STP provides path redundancy while preventing undesired active loops in a N/W.
STP allows only one active path at a time between any two network devices (this prevents the loops) but establishes the redundant links as a backup if the initial link fails.
STP Algorithm
STP establishes a root node called root bridge. STP constructs a topology that has one path to reach every network node. Resulting tree originates from the root bridge. Redundant links that are not part of the shortest path tree are blocked. As certain paths are blocked loop free topology is possible. Basically links that will cause a loop are put into a blocking state. BPDU continue to be received on blocked ports.
STA chooses a reference point called root bridge and then determines the available paths to that reference point. If more than one path exists, STA picks up the best path and blocks the rest. Loop free topology calculations makes extensive use of two components. Bridge ID Path cost
STP Loop free topology Convergence sequence. Step 1: Elect one root bridge Step 2: Elect root ports Step 3: Elect designated ports
Bridge ID
BID is used identify each bridge.
BID is used to elect the root bridge, lowest BID is the root bridge.
Path Cost
Bridges use the concept of cost to evaluate how close they are to other bridges.
Example
Example:
STP always go through the 4 step sequence to elect designated ports. Non designated ports will be blocked to avoid loops.
Loop free topology is re configured again whenever there is topology change in the network or any failure. If one network segment in the Spanning-Tree Protocol becomes unreachable, or if Spanning-Tree Protocol costs change, the spanning-tree algorithm reconfigures the spanning-tree topology and reestablishes the link by activating the standby path. While re configuring loop free topology STA uses port states.
Blocked state
Data frames are discarded and no addresses are learned. It may take up to 20 seconds to change from this state. If there are no other shorter paths to the root bridge will change to the listening state.
Listening state
Path that is not the least cost path to the root bridge goes back to the blocked state. Listening period is called the forward delay and lasts for 15 seconds. In this state user data is not being processed and MAC addresses are not being learned but BPDU are processed.
Learning state
User data is not learned, but MAC addresses are learned from any traffic that is seen. Learning state lasts for 15 seconds and is also called the forward delay. BPDUs are still processed.
Forwarding state
A switch port is allowed to transition to the forwarding state only if no redundant links are detected and if the port has the best path to the root bridge as the root port or designated port.
User data is forwarded and MAC addresses continue to be learned. BPDUs are still processed.