multiple spanning tree mst
play

Multiple Spanning Tree (MST) Ben Piper AUTHOR, CCNP ENTERPRISE - PowerPoint PPT Presentation

Nov 14, 2022 •429 likes •719 views

Multiple Spanning Tree (MST) Ben Piper AUTHOR, CCNP ENTERPRISE CERTIFICATION STUDY GUIDE: EXAM 350-401 benpiper.com PVST+ vs. MST PVST+ MST One instance per VLAN VLANs can be arbitrarily mapped to instances 1 VLAN = 1 instance VLANs 1, 5,

  1. Multiple Spanning Tree (MST) Ben Piper AUTHOR, CCNP ENTERPRISE CERTIFICATION STUDY GUIDE: EXAM 350-401 benpiper.com

  2. PVST+ vs. MST PVST+ MST One instance per VLAN VLANs can be arbitrarily mapped to instances 1 VLAN = 1 instance VLANs 1, 5, 7 = 1 instance 2000 VLANs = 2000 instances VLANs 2, 200, 2000 = 1 instance Can’t change VLAN-to-instance You define the VLAN-to-instance relationship mappings

  3. PVST+ vs. MST PVST+ MST A default instance for VLAN 1 MST0 is the default instance for all always exists VLANs (1-4094) MST0 is also called the Internal Spanning Tree (IST)

  4. SW-A SW-B MST0: VLANs 100-4094 MST0: VLANs 20-4094 MST1: VLANs 1-99 MST1: VLANs 1-10 MST2: VLANs 11-19

  5. MST Region VLAN-to-instance Region name Revision number mappings

  6. Region Region SW-A SW-B Name: (null) Name: (null) Revision: 0 Revision: 0 MST0: VLANs 100-4094 MST0: VLANs 20-4094 MST1: VLANs 1-99 MST1: VLANs 1-10 MST2: VLANs 11-19

  7. Region SW-A SW-B Name: Pluralsight Name: Pluralsight Revision: 0 Revision: 0 MST0: VLANs 20-4094 MST0: VLANs 20-4094 MST1: VLANs 1-10 MST1: VLANs 1-10 MST2: VLANs 11-19 MST2: VLANs 11-19

  8. Multiple Spanning Tree Specified in 802.1s Uses RSTP

  9. Configuring MST

  10. s h s Enable MST on switches SW1, SW2, SW3, and SW4 as follows: Requirement - Use the region name “Pluralsight” - Map VLANs 1-199 to MST1 - Map VLANs 200-400 to MST2

  11. MST BPDU MSTID 1 Priority 32768 Root 001d.45cf.e800 0xAC36177F50283CD 4B83821D8AB26DE62 MSTID 2 Priority 24576 Root 0015.f9fb.1e80 Name Revision Hash of VLAN- Instance to-instance topology mappings information

  13. Root Bridges

  14. s h s Make SW2 the root for MST1 Requirement Make SW3 the root for MST2

  18. Modifying Port Cost and Port Identifiers

  19. s h s Reconfigure MST to ensure MST2 traffic Requirement traverses the link between SW2 Fa0/6 and SW3 Fa0/21

  20. Lower the port cost for MST2

  22. Summary

  23. Summary Review the other modules to make sure you have a good grasp of spanning tree concepts

  24. Summary MST lets you arbitrarily map VLANs to instances

  25. Summary By default, all VLANs map to MST0 (IST)

  26. Summary Switches in an MST region share the same name, revision number, and VLAN-to- instance mapping digest

  28. In the Next Module You’re going to learn how to configure EtherChannels!

Recommend

Constructing a spanning tree Toni Kylml toni.kylmala@tkk.fi 1 Constructing a spanning tree

Constructing a spanning tree Toni Kylml toni.kylmala@tkk.fi 1 Constructing a spanning tree

T-79.4001 Seminar on Theoretical Computer Science Spring 2007 Distributed Computation Constructing a spanning tree Toni Kylml toni.kylmala@tkk.fi 1 Constructing a spanning tree Spanning tree To construct a spanning tree we must get

467 views • 18 slides
Minimum Spanning Tree spanning tree of minimum total weight e.g., connect all the

Minimum Spanning Tree spanning tree of minimum total weight e.g., connect all the

M INIMUM S PANNING T REE Prim-Jarnik algorithm Kruskal algorithm 1500 SEA MSN PVD 1000 800 SFO 800 LGA 400 1800 STL 1200 LAX LAX 1500 400 1500 DFW 1000 MIA Minimum Spanning Tree 1 Minimum Spanning Tree spanning

797 views • 10 slides
Minimum Spanning Tree (undirected graph) 2 Path tree vs. spanning tree We have constructed

Minimum Spanning Tree (undirected graph) 2 Path tree vs. spanning tree We have constructed

1 Minimum Spanning Tree (undirected graph) 2 Path tree vs. spanning tree We have constructed trees in graphs for shortest path to anywhere else (from vertex is the root) Minimum spanning trees instead want to connect every node with the

628 views • 18 slides
Minimum Spanning Tree (undirected graph) 2 Path tree vs. spanning tree We have constructed

Minimum Spanning Tree (undirected graph) 2 Path tree vs. spanning tree We have constructed

1 Minimum Spanning Tree (undirected graph) 2 Path tree vs. spanning tree We have constructed trees in graphs for shortest path to anywhere else (from vertex is the root) Minimum spanning trees instead want to connect every node with the

661 views • 51 slides
Diffusing Computation Using Spanning Tree Construction for Solving Leader Election Root is

Diffusing Computation Using Spanning Tree Construction for Solving Leader Election Root is

Diffusing Computation Using Spanning Tree Construction for Solving Leader Election Root is the leader In the presence of faults, There may be multiple trees Multiple leaders After recovery There is a unique tree

551 views • 22 slides
A Prins's algorithm repeatedly adds the minimum one endpoint in T weight edge w PRIM G YE E

A Prins's algorithm repeatedly adds the minimum one endpoint in T weight edge w PRIM G YE E

Minimum Spanning Trees Kent by Quanrud f EE Kkk G EYE Undirected graph Input f mn Ff IR E edge weights w A spanning tree G is tree in a containing all of V leg n t edges compute the Goal minimum weight abbr MST spanning tree

561 views • 31 slides
Minimum-Cost Spanning Tree weighted connected undirected graph spanning tree cost of

Minimum-Cost Spanning Tree weighted connected undirected graph spanning tree cost of

Minimum-Cost Spanning Tree weighted connected undirected graph spanning tree cost of spanning tree is sum of edge costs find spanning tree that has minimum cost Example 8 10 14 1 3 5 7 3 7 12 6 4 2 2 4 6 8 9

384 views • 11 slides
Minimal Spanning Trees Spanning Tree Assume you have an undirected graph G = (V,E)

Minimal Spanning Trees Spanning Tree Assume you have an undirected graph G = (V,E)

Minimal Spanning Trees Spanning Tree Assume you have an undirected graph G = (V,E) Spanning tree of graph G is tree T = (V,E T E, R) Tree has same set of nodes All tree edges are graph edges Root of tree is R

257 views • 25 slides
The Road Ahead Multiple access protocols Ethernets CSMA/CD Bridging Spanning

The Road Ahead Multiple access protocols Ethernets CSMA/CD Bridging Spanning

CS 640: Introduction to Computer Networks Aditya Akella Lecture 6 - Ethernet, Multiple Access and Bridging The Road Ahead Multiple access protocols Ethernets CSMA/CD Bridging Spanning tree protocol Multiple Access

517 views • 12 slides
Minimum Spanning Tree Minimum spanning tree. Given a connected graph G = (V, E) with real -valued

Minimum Spanning Tree Minimum spanning tree. Given a connected graph G = (V, E) with real -valued

Minimum Spanning Tree Minimum spanning tree. Given a connected graph G = (V, E) with real -valued edge weights c e , an MST is a subset of the edges T E such that T is a spanning tree whose sum of edge weights is minimized. 24 4 4 23 9

369 views • 18 slides
Minimum Spanning Tree 11/26/2003 9:54 AM Minimum Spanning Trees 2704 BOS 867 849 PVD ORD

Minimum Spanning Tree 11/26/2003 9:54 AM Minimum Spanning Trees 2704 BOS 867 849 PVD ORD

Minimum Spanning Tree 11/26/2003 9:54 AM Minimum Spanning Trees 2704 BOS 867 849 PVD ORD 187 740 144 1846 JFK 621 184 1258 802 SFO BWI 1391 1464 337 1090 DFW 946 LAX 1235 1121 MIA 2342 Minimum Spanning Trees v1.3 1

532 views • 12 slides
Minimum Spanning Trees and Kruskal's Algorithm Steve Tanimoto Winter 2016 This lecture material

Minimum Spanning Trees and Kruskal's Algorithm Steve Tanimoto Winter 2016 This lecture material

2/5/2016 Minimum Spanning Trees The minimum-spanning-tree problem Given a weighted undirected graph, compute a spanning tree of minimum weight CSE373: Data Structures and Algorithms Minimum Spanning Trees and Kruskal's Algorithm Steve

87 views • 4 slides
Outline and Reading Minimum Spanning Trees ( 12.7.3) Minimum Spanning Tree n Definitions n A

Outline and Reading Minimum Spanning Trees ( 12.7.3) Minimum Spanning Tree n Definitions n A

Minimum Spanning Tree 7/8/03 12:53 Outline and Reading Minimum Spanning Trees ( 12.7.3) Minimum Spanning Tree n Definitions n A crucial fact Prim-Jarniks Algorithm ( 12.7.3.2) Kruskals Algorithm ( 12.7.3.1) 7/8/03 12:53 Minimum

238 views • 5 slides
Minimum Spanning Tree Todays announcements: PA3 due 29 Nov 23:59 Final Exam, 10 Dec

Minimum Spanning Tree Todays announcements: PA3 due 29 Nov 23:59 Final Exam, 10 Dec

Minimum Spanning Tree Todays announcements: PA3 due 29 Nov 23:59 Final Exam, 10 Dec 12:00, OSBO A Todays Plan: Kruskals algorithm Spanning tree: a subgraph of a connected graph G that contains all vertices of G (spans G )

337 views • 6 slides
Minimum Spanning Tree Given a connected graph, we often want the cheapest way to connect all the

Minimum Spanning Tree Given a connected graph, we often want the cheapest way to connect all the

Minimum Spanning Tree Given a connected graph, we often want the cheapest way to connect all the nodes together, and this is obtainable by a minimum cost spanning tree. A spanning tree is a tree that contains all the nodes in the graph. The

384 views • 11 slides
Minimum spanning tree Minimum spanning tree Given. Undirected graph G with positive edge weights

Minimum spanning tree Minimum spanning tree Given. Undirected graph G with positive edge weights

BBM 202 - ALGORITHMS T ODAY Minimum Spanning Trees Greedy algorithm D EPT . OF C OMPUTER E NGINEERING Edge-weighted graph API Kruskal's algorithm Prim's algorithm Context M INIMUM S PANNING T REES Apr. 5, 2016

1.02k views • 39 slides
Minimum Spanning Trees Shortest Paths Cormen et. al. VI 23,24 Minimum Spanning Tree Given a set

Minimum Spanning Trees Shortest Paths Cormen et. al. VI 23,24 Minimum Spanning Tree Given a set

Minimum Spanning Trees Shortest Paths Cormen et. al. VI 23,24 Minimum Spanning Tree Given a set of locations, with positive distances to each other, we want to create a sub-graph that connects all nodes to each other with the minimum sum of

356 views • 21 slides
Minimal Spanning Tree JohnsonBaughs Algorithms , Section 7.3 (page 284) find Minimal

Minimal Spanning Tree JohnsonBaughs Algorithms , Section 7.3 (page 284) find Minimal

Minimal Spanning Tree JohnsonBaughs Algorithms , Section 7.3 (page 284) find Minimal Spanning Tree (MST) with Prims algorithm : Six cities We want to construct a set of interconnecting roads such 1 Foxville 2 Steger that one can

216 views • 9 slides
Bounded Degree Spanning Tree using Iterative Relaxation Barna Saha March 11, 2015 Bounded

Bounded Degree Spanning Tree using Iterative Relaxation Barna Saha March 11, 2015 Bounded

Bounded Degree Spanning Tree using Iterative Relaxation Barna Saha March 11, 2015 Bounded Degree Spanning Tree Iterative Minimum Spanning Tree Algorithm Iterative Algorithm for Degree Bounded Spanning Tree Primal Dual Methods for Algorithm

873 views • 45 slides
Combinatorial Spanning Tree Models for Knot Homologies Adam Simon Levine Brandeis University

Combinatorial Spanning Tree Models for Knot Homologies Adam Simon Levine Brandeis University

Combinatorial Spanning Tree Models for Knot Homologies Adam Simon Levine Brandeis University Knots in Washington XXXIII Joint work with John Baldwin (Princeton University) Adam Simon Levine Spanning Tree Models Spanning tree models for knot

816 views • 54 slides
Bad News on Combinatorial Lower Bounds for the Extension Complexity of the Spanning Tree

Bad News on Combinatorial Lower Bounds for the Extension Complexity of the Spanning Tree

Bad News on Combinatorial Lower Bounds for the Extension Complexity of the Spanning Tree Polytope Kaveh Khoshkhah Dirk Oliver Theis Aussois Combinatorial Optimization Workshop Jan 9-13, 2017 Outline Extended Formulations for Spanning

1.64k views • 150 slides
Shared Spanning Trees GOAL Continue operating without loops in any physical connection

Shared Spanning Trees GOAL Continue operating without loops in any physical connection

Shared Spanning Trees GOAL Continue operating without loops in any physical connection topology including shared spanning tree switches, 802.1Q mono spanning tree switches, and others. Shared Spanning Trees January 27, 1999 1/11 IEEE

126 views • 11 slides
Spanning Trees Spanning Trees g Trees: CSE 680 Not Trees: Prof. Roger Crawfis Not Has

Spanning Trees Spanning Trees g Trees: CSE 680 Not Trees: Prof. Roger Crawfis Not Has

Tree Introduction to Algorithms Introduction to Algorithms We call an undirected graph a tree if the graph We call an undirected graph a tree if the graph is connected and contains no cycles . Spanning Trees Spanning Trees g Trees:

186 views • 17 slides
Undirected connected weighted graph ( G , W ) Input: An MST of G Output: A&DS Lecture 11 1

Undirected connected weighted graph ( G , W ) Input: An MST of G Output: A&DS Lecture 11 1

Minimum Spanning Trees ( G , W ) undirected connected weighted graph Definition 11.1 A minimum spanning tree (MST) of G is a connected spanning subgraph T of G of minimum weight. The minimum spanning tree problem : Undirected connected weighted

304 views • 28 slides

More recommend