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,

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, 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
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)
SW-A SW-B MST0: VLANs 100-4094 MST0: VLANs 20-4094 MST1: VLANs 1-99 MST1: VLANs 1-10 MST2: VLANs 11-19
MST Region VLAN-to-instance Region name Revision number mappings
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
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
Multiple Spanning Tree Specified in 802.1s Uses RSTP
Configuring MST
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
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
Root Bridges
s h s Make SW2 the root for MST1 Requirement Make SW3 the root for MST2
Modifying Port Cost and Port Identifiers
s h s Reconfigure MST to ensure MST2 traffic Requirement traverses the link between SW2 Fa0/6 and SW3 Fa0/21
Lower the port cost for MST2
Summary
Summary Review the other modules to make sure you have a good grasp of spanning tree concepts
Summary MST lets you arbitrarily map VLANs to instances
Summary By default, all VLANs map to MST0 (IST)
Summary Switches in an MST region share the same name, revision number, and VLAN-to- instance mapping digest
In the Next Module You’re going to learn how to configure EtherChannels!

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

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

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

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

660 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 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

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 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) 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

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 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 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

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

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 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 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

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

1 Enumeration Cont. How many different ways can we create a graph given a vertex set of size n ?

1 Enumeration Cont. How many different ways can we create a graph given a vertex set of size n ? Cayleys Formula states that with a vertex set of n there are n n 2 possible trees. Another way to think about it: the number of possible trees

476 views • 4 slides

Lecture 9 Data Structures (DAT037) Ramona Enache

Lecture 9 Data Structures (DAT037) Ramona Enache (with slides from Nick Smallbone and Nils Anders Danielsson) Trees (as graphs) Again

398 views • 25 slides

Three Graph Algorithms Shortest Distance Paths Distance/Cost of a path in weighted graph sum of

Three Graph Algorithms Shortest Distance Paths Distance/Cost of a path in weighted graph sum of weights of all edges on the path path A, B, E, cost is 2+3=5 path A, B, C, E, cost is 2+1+4=7 How to find shortest distance path from a node

335 views • 6 slides

Table of Contents I Planning Agents Classical Planning with a Given Horizon Adding Planning to

Table of Contents I Planning Agents Classical Planning with a Given Horizon Adding Planning to the Blocks World Multiple Goal States Complex Goals Example: Igniting the Burner Missionaries and Cannibals Heuristics Concurrent Planning

756 views • 41 slides

SPARC 2 Consultations January-February 2016 1 Outline Introduction to Compute Canada

SPARC 2 Consultations January-February 2016 1 Outline Introduction to Compute Canada SPARC 2 Consultation Context Capital Deployment Plan Services Plan Access and Allocation Policies (RAC, etc.) Discussion 2

906 views • 41 slides

The angular momentum of galaxies and their haloes: a tracer of galaxy evolution Lorenzo Posti

The Role of Gas in Galaxy Dynamics, Valletta, 03/10/17 The angular momentum of galaxies and their haloes: a tracer of galaxy evolution Lorenzo Posti (University of Groningen) with G. Pezzulli (ETH), F . Fraternali (Bologna/Groningen), E. di

529 views • 31 slides

Sparse Regression Codes Sekhar Tatikonda (Yale University) in collaboration with Ramji

Sparse Regression Codes Sekhar Tatikonda (Yale University) in collaboration with Ramji Venkataramanan (University of Cambridge) Antony Joseph (UC-Berkeley) Tuhin Sarkar (IIT-Bombay) Information and Control in Networks October 18, 2012

731 views • 44 slides

Modulated Sparse Regression Codes Kuan Hsieh and Ramji Venkataramanan University of Cambridge, UK

Modulated Sparse Regression Codes Kuan Hsieh and Ramji Venkataramanan University of Cambridge, UK ISIT, June 2020 1/17 Complex AWGN channel communication w 1 , . . . , w n data bits estimated data bits i.i.d. CN (0 , 2 ) m x 1 , . . .

468 views • 36 slides