1 / 10

Rapid Spanning Tree protocol

Rapid Spanning Tree protocol. Outline. Background knowledge Bridge and switch Spanning Tree Algorithm Spanning Tree Protocol Performance Rapid Spanning Tree Protocol Conclusion Reference. Bridge and switch. Spanning Tree Algorithm. Problem definition

tevin
Download Presentation

Rapid Spanning Tree protocol

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Rapid Spanning Tree protocol

  2. Outline • Background knowledge • Bridge and switch • Spanning Tree Algorithm • Spanning Tree Protocol • Performance • Rapid Spanning Tree Protocol • Conclusion • Reference

  3. Bridge and switch

  4. Spanning Tree Algorithm • Problem definition • Given a connected, undirected graph, a spanning tree of that graph is a subgraph that is a tree and connects all the vertices together.A minimum spanning tree is a spanning tree with weight less than or equal to the weight of every other spanning tree.

  5. Spanning Tree Algorithm cont. • Prim’s algorithm

  6. Spanning Tree Algorithm cont. • Kruskal's algorithm

  7. Spanning Tree Protocol • IEEE 802.1D

  8. Rapid Spanning Tree Protocol • IEEE 802.1W

  9. Conclusion

  10. Reference

More Related