1. 1 Spanning Tree Protocol EE 122: Intro to Communication Networks Fall 2007 (WF 4-5:30 in Cory 277) Vern Paxson TAs: Lisa Fowler, Daniel Killebrew & Jorge Ortiz http://inst.eecs.berkeley.edu/~ee122/ Slides by Lisa Fowler

2. 2 Overview Networks need redundancy –Provide redundant paths between end stations to enable the Bridged LAN to continue to provide the Service in the event of component failure (of bridge or segment) Loops can cause major problems –Ethernet does not provide any notion like TTL in order to eventually remove looping frames Reduce bridge topology to a single spanning tree –Trees have no cycles  loop-free –Automatically reconfigure the spanning tree in a reproducible and predictable manner

3. 3 Bridge 1 Bridge 5 Bridge 2 Bridge 4 Bridge 3 LAN A LAN B LAN C LAN D Network Diagram

4. 4 Bridge 1 Bridge 5 Bridge 2 Bridge 4 Bridge 3 A B C D Each bridge has a unique Bridge ID = unique device ID + priority number Within each bridge, each port has a unique ID 1 2 1 2 1 2 3 1 1 2 2 Spanning Tree Protocol Required Elements

5. 5 Assign a cost to the segments between any two bridges (can be custom, unlike in lecture, where we used uniform cost) Bridge 1 Bridge 5 Bridge 2 Bridge 4 Bridge 3 A B C D 1 2 1 2 1 2 3 1 1 2 2 Bridge 1 Bridge 5 Bridge 2 Bridge 4 Bridge 3 cBcB cCcC cDcD cDcD cDcD cCcC cCcC cAcA cAcA cAcA Spanning Tree Protocol Required Elements

6. 6 1 2 1 2 1 2 3 1 1 2 2 1.Elect a root bridge a)Compare Bridge ID (compare priority number then compare unique ID) 2.Each bridge selects a root port: the port with the least cost path to the root Bridge 1 Bridge 5 Bridge 2 Bridge 4 Bridge 3 A B C D Bridge 1 Bridge 5 Bridge 2 Bridge 4 Bridge 3 cBcB cCcC cDcD cDcD cDcD cCcC cCcC cAcA cAcA cAcA Costs c A - 100 c B - 19 c C - 4 c D - 100 Bridge 1 Spanning Tree Protocol

7. 7 1 2 1 2 1 2 3 1 1 2 2 2.Each bridge selects a root port: the port with the least cost path to the root a)Break ties by picking neighbor w/ lowest ID Bridge 1 Bridge 5 Bridge 2 Bridge 4 Bridge 3 A B C D Bridge 1 Bridge 5 Bridge 2 Bridge 4 Bridge 3 cBcB cCcC cDcD cCcC cAcA Bridge 1 Costs c A - 100 c B - 19 c C - 4 c D - 100 Bridge Root Port 1 21 33 42 51 Spanning Tree Protocol

8. 8 1 2 1 2 1 2 3 1 1 2 2 3.All bridges on the network segment collectively determine least cost path from network segment to root a)The port that connects the network segment to the bridge that provides this path is called the designated port Bridge 1 Bridge 5 Bridge 2 Bridge 4 Bridge 3 A B C D Bridge 1 Bridge 5 Bridge 2 Bridge 4 Bridge 3 cBcB cCcC cDcD cAcA Costs c A - 100 c B - 19 c C - 4 c D - 100 Bridge 1 Bridge Root Port Desgn. Port 1 21 33 42 51 Bridge Root Port Desgn. Port 11,2 212 33 42 51 Spanning Tree Protocol

9. 9 Bridge Root Port Desgn. Port 11,2 212 33 42 51 Bridge Root Port Desgn. Port 11,2 212 332 42 51 1 2 1 2 1 2 3 1 1 2 2 a)The port that connects the network segment to the bridge that provides this path is called the designated port i.Break ties by picking bridge w/ lowest ID Bridge 1 Bridge 5 Bridge 2 Bridge 4 Bridge 3 A B C D Bridge 1 Bridge 5 Bridge 2 Bridge 4 Bridge 3 cBcB cCcC cDcD cAcA Costs c A - 100 c B - 19 c C - 4 c D - 100 Bridge 1 Spanning Tree Protocol

10. 10 Bridge 1 Bridge 5 Bridge 2 Bridge 4 Bridge 3 A B C D 4.If there’s still a tie for any of the above, pick the lowest port # 1 2 1 2 1 2 3 1 1 2 2 Bridge Root Port Desgn. Port 11,2 212 33 42 51 Bridge Root Port Desgn. Port 11,2 212 332 42 51 Costs c A - 100 c B - 19 c C - 4 c D - 100 Spanning Tree Protocol

11. 11 Bridge 1 Bridge 5 Bridge 2 Bridge 4 Bridge 3 A B C D 5.Now any time frames require broadcasting, a bridge only accepts them from a designated or a root port … 6.… and only floods to other root or designated ports 1 2 1 2 1 2 3 1 1 2 2 Bridge Root Port Desgn. Port 11,2 212 33 42 51 Bridge Root Port Desgn. Port 11,2 212 332 42 51 Costs c A - 100 c B - 19 c C - 4 c D - 100 Spanning Tree Protocol