cs 3700
play

CS 3700 Networks and Distributed Systems Bridging (From Hub to - PowerPoint PPT Presentation

CS 3700 Networks and Distributed Systems Bridging (From Hub to Switch by Way of Tree) Revised 8/19/15 Just Above the Data Link Layer 2 Bridging How do we connect LANs? Application Function: Presentation Route packets


  1. Complicated Learning Example 11 � <Src=AA, Dest=FF> Bridge 1 Bridge 2 AA 1 Port 1 Port 2 Port 1 Port 2 Hub Hub Hub AA BB CC DD EE FF

  2. Complicated Learning Example 11 � <Src=AA, Dest=FF> Bridge 1 Bridge 2 AA 1 Port 1 Port 2 Port 1 Port 2 Hub Hub Hub AA BB CC DD EE FF

  3. Complicated Learning Example 11 � <Src=AA, Dest=FF> Bridge 1 Bridge 2 AA 1 AA 1 Port 1 Port 2 Port 1 Port 2 Hub Hub Hub AA BB CC DD EE FF

  4. Complicated Learning Example 11 � <Src=AA, Dest=FF> Bridge 1 Bridge 2 AA 1 AA 1 Port 1 Port 2 Port 1 Port 2 Hub Hub Hub AA BB CC DD EE FF

  5. Complicated Learning Example 11 � <Src=AA, Dest=FF> Bridge 1 Bridge 2 AA 1 AA 1 Port 1 Port 2 Port 1 Port 2 Hub Hub Hub AA BB CC DD EE FF

  6. Complicated Learning Example 11 � <Src=AA, Dest=FF> Bridge 1 Bridge 2 � <Src=CC, Dest=AA> AA 1 AA 1 CC 2 CC 1 Port 1 Port 2 Port 1 Port 2 Hub Hub Hub AA BB CC DD EE FF

  7. Complicated Learning Example 11 � <Src=AA, Dest=FF> Bridge 1 Bridge 2 � <Src=CC, Dest=AA> AA 1 AA 1 CC 2 CC 1 Port 1 Port 2 Port 1 Port 2 Hub Hub Hub AA BB CC DD EE FF

  8. Complicated Learning Example 11 � <Src=AA, Dest=FF> Bridge 1 Bridge 2 � <Src=CC, Dest=AA> AA 1 AA 1 CC 2 CC 1 Port 1 Port 2 Port 1 Port 2 Hub Hub Hub AA BB CC DD EE FF

  9. Complicated Learning Example 11 � <Src=AA, Dest=FF> Bridge 1 Bridge 2 � <Src=CC, Dest=AA> AA 1 AA 1 CC 2 CC 1 � <Src=EE, Dest=CC> Port 1 Port 2 Port 1 Port 2 Hub Hub Hub AA BB CC DD EE FF

  10. Complicated Learning Example 11 � <Src=AA, Dest=FF> Bridge 1 Bridge 2 � <Src=CC, Dest=AA> AA 1 AA 1 CC 2 CC 1 � <Src=EE, Dest=CC> EE 2 Port 1 Port 2 Port 1 Port 2 Hub Hub Hub AA BB CC DD EE FF

  11. Complicated Learning Example 11 � <Src=AA, Dest=FF> Bridge 1 Bridge 2 � <Src=CC, Dest=AA> AA 1 AA 1 CC 2 CC 1 � <Src=EE, Dest=CC> EE 2 EE 2 Port 1 Port 2 Port 1 Port 2 Hub Hub Hub AA BB CC DD EE FF

  12. Complicated Learning Example 11 � <Src=AA, Dest=FF> Bridge 1 Bridge 2 � <Src=CC, Dest=AA> AA 1 AA 1 CC 2 CC 1 � <Src=EE, Dest=CC> EE 2 EE 2 Port 1 Port 2 Port 1 Port 2 Hub Hub Hub AA BB CC DD EE FF

  13. The Danger of Loops 12 CC DD � <Src=AA, Dest=DD> Hub Port 2 Port 2 Port 1 Port 1 Hub AA BB

  14. The Danger of Loops 12 CC DD � <Src=AA, Dest=DD> Hub Port 2 Port 2 Port 1 Port 1 Hub AA BB

  15. The Danger of Loops 12 CC DD � <Src=AA, Dest=DD> Hub Port 2 Port 2 AA 1 AA 1 Port 1 Port 1 Hub AA BB

  16. The Danger of Loops 12 CC DD � <Src=AA, Dest=DD> Hub Port 2 Port 2 AA 1 AA 1 Port 1 Port 1 Hub AA BB

  17. The Danger of Loops 12 CC DD � <Src=AA, Dest=DD> Hub Port 2 Port 2 AA 1 AA 1 Port 1 Port 1 Hub AA BB

  18. The Danger of Loops 12 CC DD � <Src=AA, Dest=DD> Hub Port 2 Port 2 AA AA 1 2 AA 1 AA 2 Port 1 Port 1 Hub AA BB

  19. The Danger of Loops 12 CC DD � <Src=AA, Dest=DD> Hub Port 2 Port 2 AA AA 1 2 AA 1 AA 2 Port 1 Port 1 Hub AA BB

  20. The Danger of Loops 12 CC DD � <Src=AA, Dest=DD> Hub Port 2 Port 2 AA AA 2 1 AA 1 AA 1 AA AA 2 1 Port 1 Port 1 Hub AA BB

  21. The Danger of Loops 12 CC DD � <Src=AA, Dest=DD> � This continues to infinity � How do we stop this? Hub Port 2 Port 2 AA AA 1 2 AA 1 AA 1 AA AA 2 1 Port 1 Port 1 Hub AA BB

  22. The Danger of Loops 12 CC DD � <Src=AA, Dest=DD> � This continues to infinity � How do we stop this? Hub � Remove loops from the topology Port 2 Port 2 � Without physically unplugging AA AA 2 1 AA 1 AA 1 AA AA 2 1 cables Port 1 Port 1 � 802.1 uses an algorithm to Hub build and maintain a spanning tree for routing AA BB

  23. Spanning Tree Definition 13 1 2 3 5 4 6 7

  24. Spanning Tree Definition 13 1 1 2 3 5 4 4 6 7

  25. Spanning Tree Definition 13 1 1 2 3 5 5 4 4 6 7

  26. Spanning Tree Definition 13 1 1 2 2 3 5 5 4 4 6 6 7

  27. Spanning Tree Definition 13 1 1 2 2 3 3 5 5 4 4 6 6 7 7

  28. Spanning Tree Definition 13 � A subset of edges in a graph that: � Span all nodes � Do not create any cycles � This structure is a tree 1 1 2 2 3 3 5 5 4 4 6 6 7 7

  29. Spanning Tree Definition 13 � A subset of edges in a graph that: � Span all nodes � Do not create any cycles � This structure is a tree 5 1 1 2 2 3 3 4 6 2 3 5 5 1 4 4 7 6 6 7 7

  30. Spanning Tree Poem 14 Algorhyme I think that I shall never see a graph more lovely than a tree. A tree whose crucial property is loop-free connectivity. A tree that must be sure to span so packet can reach every LAN. First, the root must be selected. By ID, it is elected. Least-cost paths from root are traced. In the tree, these paths are placed. A mesh is made by folks like me, then bridges find a spanning tree. - Radia Perlman

  31. 802.1 Spanning Tree Approach 15 Elect a bridge to be the root of the tree 1. Every bridge finds shortest path to the root 2. Union of these paths becomes the spanning tree 3.

  32. 802.1 Spanning Tree Approach 15 Elect a bridge to be the root of the tree 1. Every bridge finds shortest path to the root 2. Union of these paths becomes the spanning tree 3. � Bridges exchange Configuration Bridge Protocol Data Units (BPDUs) to build the tree � Used to elect the root bridge � Locate the next hop closest to the root, and its port � Select ports to be included in the spanning trees

  33. Definitions 16 � Bridge ID (BID) = <Random Number> � Root Bridge: bridge with the lowest BID in the tree � Path Cost: cost (in hops) from a transmitting bridge to the root � Each port on a bridge has a unique Port ID � Root Port: port that forwards to the root on each bridge � Designated Bridge: the bridge on a LAN that provides the minimal cost path to the root � The designated bridge on each LAN is unique

  34. Determining the Root 17 � Initially, all hosts assume they are the root � Bridges broadcast BPDUs: Root ID Path Cost to Root Bridge ID � Based on received BPDUs, each switch chooses: � A new root (smallest known Root ID) � A new root port (what interface goes towards the root) � A new designated bridge (who is the next hop to root)

  35. Comparing BPDUs 18 BPDU1 BPDU2 R1 Cost1 B1 R2 Cost2 B2 if R1 < R2: use BPDU1 else if R1 == R2 and Cost1 < Cost2: use BPDU1 else if R1 == R2 and Cost1 == Cost 2 and B1 < B2: use BPDU1 else: use BPDU2

  36. Comparing BPDUs 18 BPDU1 BPDU2 R1 Cost1 B1 R2 Cost2 B2 if R1 < R2: use BPDU1 else if R1 == R2 and Cost1 < Cost2: use BPDU1 else if R1 == R2 and Cost1 == Cost 2 and B1 < B2: use BPDU1 else: use BPDU2

  37. Comparing BPDUs 18 BPDU1 BPDU2 R1 Cost1 B1 R2 Cost2 B2 if R1 < R2: use BPDU1 else if R1 == R2 and Cost1 < Cost2: use BPDU1 else if R1 == R2 and Cost1 == Cost 2 and B1 < B2: use BPDU1 else: use BPDU2

  38. Comparing BPDUs 18 BPDU1 BPDU2 R1 Cost1 B1 R2 Cost2 B2 if R1 < R2: use BPDU1 else if R1 == R2 and Cost1 < Cost2: use BPDU1 else if R1 == R2 and Cost1 == Cost 2 and B1 < B2: use BPDU1 else: use BPDU2

  39. Comparing BPDUs 18 BPDU1 BPDU2 R1 Cost1 B1 R2 Cost2 B2 if R1 < R2: use BPDU1 else if R1 == R2 and Cost1 < Cost2: use BPDU1 else if R1 == R2 and Cost1 == Cost 2 and B1 < B2: use BPDU1 else: use BPDU2

  40. Spanning Tree Construction 19 3: 3/0 0: 0/0 12: 12/0 41: 41/0 27: 27/0 68: 68/0 9: 9/0

  41. Spanning Tree Construction 19 3: 3/0 0: 0/0 12: 12/0 12: 0/1 27: 0/1 41: 41/0 27: 27/0 68: 68/0 9: 9/0

  42. Spanning Tree Construction 19 3: 3/0 0: 0/0 12: 12/0 12: 0/1 41: 3/1 27: 0/1 41: 41/0 27: 27/0 68: 68/0 9: 9/0

  43. Spanning Tree Construction 19 3: 3/0 0: 0/0 12: 12/0 12: 0/1 41: 3/1 27: 0/1 41: 41/0 27: 27/0 68: 9/1 68: 68/0 9: 9/0

  44. Spanning Tree Construction 19 3: 3/0 0: 0/0 12: 12/0 12: 0/1 41: 3/1 27: 0/1 41: 41/0 27: 27/0 68: 9/1 68: 3/2 9: 3/2 68: 68/0 9: 9/0

  45. Spanning Tree Construction 19 3: 0/2 3: 3/0 0: 0/0 12: 12/0 12: 0/1 41: 3/1 27: 0/1 41: 41/0 41: 0/2 27: 27/0 68: 3/2 68: 9/1 9: 3/2 68: 68/0 9: 9/0

  46. Spanning Tree Construction 19 3: 3/0 3: 0/2 0: 0/0 12: 12/0 12: 0/1 41: 3/1 27: 0/1 41: 41/0 41: 0/2 27: 27/0 68: 9/1 68: 3/2 68: 0/3 9: 3/2 9: 0/3 68: 68/0 9: 9/0

  47. Spanning Tree Construction 19 3: 3/0 3: 0/2 0: 0/0 12: 12/0 12: 0/1 41: 3/1 27: 0/1 41: 41/0 41: 0/2 27: 27/0 68: 9/1 68: 3/2 68: 0/3 9: 3/2 9: 0/3 68: 68/0 9: 9/0

  48. Designated Bridges 20 � Ultimately, each bridge must decide to enable or disable each port � Reasons to keep a port enabled: You receive no BPDUs on that port 1. ■ Indicates there are no other bridges 0 The port is a root port 2. ■ You need to be able to forward packets to the root of the spanning tree You are the designated bridge for that LAN 3. 9 27 ■ All other bridges on that LAN have a longer path to the root, or their bridge ID is higher than yours

  49. Designated Bridges 20 � Ultimately, each bridge must decide to ? enable or disable each port � Reasons to keep a port enabled: You receive no BPDUs on that port 1. ■ Indicates there are no other bridges 0 The port is a root port 2. ■ You need to be able to forward packets to the root of the spanning tree You are the designated bridge for that LAN 3. 9 27 ■ All other bridges on that LAN have a longer path to the root, or their bridge ID is higher than yours

  50. Designated Bridges 20 � Ultimately, each bridge must decide to ? enable or disable each port On, 1 � Reasons to keep a port enabled: You receive no BPDUs on that port 1. ■ Indicates there are no other bridges 0 The port is a root port 2. ■ You need to be able to forward packets to the root of the spanning tree You are the designated bridge for that LAN 3. 9 27 ■ All other bridges on that LAN have a longer path to the root, or their bridge ID is higher than yours

  51. Designated Bridges 20 � Ultimately, each bridge must decide to ? enable or disable each port On, 1 � Reasons to keep a port enabled: You receive no BPDUs on that port 1. ■ Indicates there are no other bridges 0 The port is a root port 2. ■ You need to be able to forward packets to the root of the spanning tree You are the designated bridge for that LAN 3. ? 9 27 ■ All other bridges on that LAN have a longer path ? to the root, or their bridge ID is higher than yours

  52. Designated Bridges 20 � Ultimately, each bridge must decide to ? enable or disable each port On, 1 � Reasons to keep a port enabled: You receive no BPDUs on that port 1. ■ Indicates there are no other bridges 0 The port is a root port 2. ■ You need to be able to forward packets to the root of the spanning tree You are the designated bridge for that LAN 3. ? 9 27 ■ All other bridges on that LAN have a longer path On, 2 ? On, 2 to the root, or their bridge ID is higher than yours

  53. Designated Bridges 20 � Ultimately, each bridge must decide to ? enable or disable each port On, 1 � Reasons to keep a port enabled: ? ? You receive no BPDUs on that port 1. ■ Indicates there are no other bridges 0 The port is a root port 2. ■ You need to be able to forward packets to the root of the spanning tree You are the designated bridge for that LAN 3. ? 9 27 ■ All other bridges on that LAN have a longer path On, 2 ? On, 2 to the root, or their bridge ID is higher than yours

Download Presentation
Download Policy: The content available on the website is offered to you 'AS IS' for your personal information and use only. It cannot be commercialized, licensed, or distributed on other websites without prior consent from the author. To download a presentation, simply click this link. If you encounter any difficulties during the download process, it's possible that the publisher has removed the file from their server.

Recommend


More recommend