© UNIVERSITY of NEW HAMPSHIRE INTEROPERABILITY LABORATORY The Multiple Spanning Tree Protocol 802.1Q - 2003.

Slides:



Advertisements
Similar presentations
Communication Networks Recitation 3 Bridges & Spanning trees.
Advertisements

Part 2: Preventing Loops in the Network
Packet Switching COM1337/3501 Textbook: Computer Networks: A Systems Approach, L. Peterson, B. Davie, Morgan Kaufmann Chapter 3.
Connecting LANs: Section Figure 15.1 Five categories of connecting devices.
Chapter 9 Local Area Network Technology
SPANNING TREE PROTOCOL (STP) VARIANTS Rapid Spanning Tree Protocol (RSTP) -The reason behind the word «rapid» Multiple Spanning Tree Protocol (MSTP)
Oct 12, 2004CS573: Network Protocols and Standards1 Virtual LANs Network Protocols and Standards Autumn
© 2009 Cisco Systems, Inc. All rights reserved. SWITCH v1.0—3-1 Implementing Spanning Tree Spanning Tree Protocol Enhancements.
Institute of Technology, Sligo Dept of Computing Semester 3, version Semester 3 Chapter 3 VLANs.
Sept 14, 2004CS573: Network Protocols and Standards1 Spanning Tree Algorithm Network Protocols and Standards Autumn
Jan 10, 2008CS573: Network Protocols and Standards1 Virtual LANs Network Protocols and Standards Winter
© UNIVERSITY of NEW HAMPSHIRE INTEROPERABILITY LABORATORY IEEE 802.1ad Provider Bridges Henry He UNH-IOL Bridge Functions Consortium.
1 25\10\2010 Unit-V Connecting LANs Unit – 5 Connecting DevicesConnecting Devices Backbone NetworksBackbone Networks Virtual LANsVirtual LANs.
MUSE Winter School 2006 BE M Traffic Engineering in Ethernet-based Access Networks MUSE Winter School BB Europe Geneva December 11.
© 2006 Cisco Systems, Inc. All rights reserved. ICND v2.3—1-1 Configuring Catalyst Switch Operations Introducing Spanning Tree Protocol.
© 2008 Cisco Systems, Inc. All rights reserved.Cisco ConfidentialPresentation_ID 1 Chapter 2: LAN Redundancy Scaling Networks.
STP Part II PVST (Per Vlan Spanning Tree): A Vlan field is added to the BPDU header along with Priority & Mac. Priority is 32768, Mac Address is MAC or.
Transparent Bridging. Chapter Goals Understand transparent bridge processes of learning, filtering, forwarding, and flooding. Explain the purpose of the.
IEEE 802.1q - VLANs Nick Poorman.
© 2008 Cisco Systems, Inc. All rights reserved.Cisco ConfidentialPresentation_ID 1 Chapter 2: LAN Redundancy Scaling Networks.
1 © 2004, Cisco Systems, Inc. All rights reserved. CCNA 3 v3.1 Module 7 Spanning Tree Protocol.
© 2008 Cisco Systems, Inc. All rights reserved.Cisco ConfidentialPresentation_ID 1 Lecture 12: LAN Redundancy Switched Networks Assistant Professor Pongpisit.
TRansparent Interconnection of Lots of Links (TRILL) March 11 th 2010 David Bond University of New Hampshire: InterOperability.
CSC 336 Data Communications and Networking Lecture 7d: Interconnecting LAN Dr. Cheer-Sun Yang Spring 2001.
1 © 2003, Cisco Systems, Inc. All rights reserved. CCNA 3 v3.0 Module 7 Spanning-Tree Protocol Cisco Networking Academy.
CCNA Guide to Cisco Networking Fundamentals Fourth Edition
© 2006 Cisco Systems, Inc. All rights reserved.Cisco PublicITE I Chapter 6 1 Implement Spanning Tree Protocols LAN Switching and Wireless – Chapter 5.
Saeed Darvish Pazoki – MCSE, CCNA Abstracted From: Cisco Press – ICND 2 – Chapter 2 Spanning tree Protocol 1.
© 2006 Cisco Systems, Inc. All rights reserved.Cisco Public 1 Version 4.0 Implement Spanning Tree Protocols LAN Switching and Wireless – Chapter 5.
© 2006 Cisco Systems, Inc. All rights reserved.Cisco PublicITE I Chapter 6 1 Implement Spanning Tree Protocols LAN Switching and Wireless – Chapter 5 Part.
CN2668 Routers and Switches (V2) Kemtis Kunanuraksapong MSIS with Distinction MCTS, MCDST, MCP, A+
Author: Bill Buchanan. Transparent bridge Author: Bill Buchanan CAM.
1 Spanning Tree Algorithm Advanced Computer Networks.
March, 2004Dr. Paul Chen1 Wireless LAN MSTP Dr. Paul Chen
© 2006 Cisco Systems, Inc. All rights reserved.Cisco PublicITE I Chapter 6 1 LAN Switching and Wireless Implement Spanning Tree Protocols (STP) Chapter.
Steffen/Stettler, , 4-SpanningTree.pptx 1 Computernetze 1 (CN1) 4 Spanning Tree Protokoll 802.1D-2004 Prof. Dr. Andreas Steffen Institute for.
15.1 Chapter 15 Connecting LANs, Backbone Networks, and Virtual LANs Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or.
Switching Topic 6 Rapid spanning tree protocol. Agenda RSTP features – Port states – Port roles – BPDU format – Edge ports and link types – Proposals.
1 © 2003, Cisco Systems, Inc. All rights reserved. CCNA 3 v3.0 Module 7 Spanning Tree Protocol.
McGraw-Hill©The McGraw-Hill Companies, Inc., 2004 Chapter 16 Connecting LANs, Backbone Networks, and Virtual LANs.
1 Version 3.0 Module 7 Spanning Tree Protocol. 2 Version 3.0 Redundancy Redundancy in a network is needed in case there is loss of connectivity in one.
CCNP 3: Chapter 3 Implementing Spanning Tree. Overview Basics of implementing STP Election of Root Bridge and Backup Enhancing STP RSTP MSTP EtherChannels.
Spanning Tree protocol
Topic 5 Spanning tree protocol
1 VLANs Relates to Lab 6. Short module on basics of VLAN switching.
CO5023 LAN Redundancy.
Chapter 16 Connecting LANs, Backbone Networks, and Virtual LANs
© 2006 Cisco Systems, Inc. All rights reserved.Cisco PublicITE I Chapter 6 1 Implement Spanning Tree Protocols (STP) LAN Switching and Wireless – Chapter.
Chapter-5 STP. Introduction Examine a redundant design In a hierarchical design, redundancy is achieved at the distribution and core layers through additional.
Instructor Materials Chapter 3: STP
Implement Spanning Tree Protocols
Spanning Tree Protocol
Transparent Bridging.
Spanning Tree Algorithm
Implement Spanning Tree Protocols
VLANs: Virtual Local Area Networks
Lecture#10: LAN Redundancy
Configuring Catalyst Switch Operations
Spanning Tree Protocol
Implement Spanning Tree Protocols
© 2002, Cisco Systems, Inc. All rights reserved.
Spanning Tree Protocol
NT2640 Unit 9 Activity 1 Handout
Chapter 16 Connecting LANs, Backbone Networks, and Virtual LANs
CCNA Routing and Switching Scaling Networks v6.0
Spanning Tree Protocol (STP)
Cisco networking CNET-448
LAN switching and Bridges
Implement Spanning Tree Protocols
Presentation transcript:

© UNIVERSITY of NEW HAMPSHIRE INTEROPERABILITY LABORATORY The Multiple Spanning Tree Protocol 802.1Q

U NIVERSITY of N EW H AMPSHIRE I NTER O PERABILITY L ABORATORY UNH-IOL Bridge Functions Consortium Presentation Outline Abbreviations Definitions Protocol Design Goals Forming MST Regions MSTP Provides… Pieces of the topology CIST Port Roles MSTI Port Roles Abbreviations Definitions Protocol Design Goals Forming MST Regions MSTP Provides… Pieces of the topology CIST Port Roles MSTI Port Roles Things to note Advantages of MSTP Disadvantages Configuration BPDU frame format Examples of use Things to note Advantages of MSTP Disadvantages Configuration BPDU frame format Examples of use

U NIVERSITY of N EW H AMPSHIRE I NTER O PERABILITY L ABORATORY UNH-IOL Bridge Functions Consortium AbbreviationsAbbreviations ST – Spanning Tree RST – Rapid Spanning Tree MST – Multiple Spanning Tree MSTP – Multiple Spanning Tree protocol BPDU – Bridge Protocol Data Unit –Types: ST BPDU, TCN BPDU, RST BPDU, MST BPDU Configuration BPDU  ST BPDU (terminology change) ST – Spanning Tree RST – Rapid Spanning Tree MST – Multiple Spanning Tree MSTP – Multiple Spanning Tree protocol BPDU – Bridge Protocol Data Unit –Types: ST BPDU, TCN BPDU, RST BPDU, MST BPDU Configuration BPDU  ST BPDU (terminology change)

U NIVERSITY of N EW H AMPSHIRE I NTER O PERABILITY L ABORATORY UNH-IOL Bridge Functions Consortium DefinitionsDefinitions Common and Internal Spanning Tree (CIST) –“The single Spanning Tree calculated by STP and RSTP together with the logical continuation of that connectivity through MST Bridges and regions, calculated by MSTP to ensure that all LANs in the Bridged Local Area Network are simply and fully connected.” 1 Common Spanning Tree (CST) –“The single Spanning Tree calculated by STP and RSTP, and by MSTP to connect MST Regions.” 2 Common and Internal Spanning Tree (CIST) –“The single Spanning Tree calculated by STP and RSTP together with the logical continuation of that connectivity through MST Bridges and regions, calculated by MSTP to ensure that all LANs in the Bridged Local Area Network are simply and fully connected.” 1 Common Spanning Tree (CST) –“The single Spanning Tree calculated by STP and RSTP, and by MSTP to connect MST Regions.” 2 1 – IEEE Std 802.1Q™-2003 sub-clause – IEEE Std 802.1Q™-2003 sub-clause – IEEE Std 802.1Q™-2003 sub-clause – IEEE Std 802.1Q™-2003 sub-clause 3.3

U NIVERSITY of N EW H AMPSHIRE I NTER O PERABILITY L ABORATORY UNH-IOL Bridge Functions Consortium Definitions (cont.) CIST (layman’s terms) –A single topology connecting all Bridges (STP, RSTP, MSTP) via one active topology. CIST differs from CST, because it includes the “logical…connectivity through MST Bridges and regions”. CST (layman’s terms) –The topology connecting all STP/RSTP Bridges and MSTP regions. –In the context of CIST, MST Regions are treated as a single RSTP Bridge. CIST (layman’s terms) –A single topology connecting all Bridges (STP, RSTP, MSTP) via one active topology. CIST differs from CST, because it includes the “logical…connectivity through MST Bridges and regions”. CST (layman’s terms) –The topology connecting all STP/RSTP Bridges and MSTP regions. –In the context of CIST, MST Regions are treated as a single RSTP Bridge.

U NIVERSITY of N EW H AMPSHIRE I NTER O PERABILITY L ABORATORY UNH-IOL Bridge Functions Consortium Definitions (cont.) Multiple Spanning Tree Instance (MSTI) –“One of a number of Spanning Trees calculated by MSTP within an MST Region, to provide a simply and fully connected active topology for frames classified as belonging to a VLAN that is mapped to the MSTI by the MST Configuration Table used by the MST Bridges of that MST Region.”1 –64 distinct MST topologies (MSTIs) are calculated and maintained by MSTP, however, not all topologies are actively used to carry traffic, as the VLANs may not all be in use. Multiple Spanning Tree Instance (MSTI) –“One of a number of Spanning Trees calculated by MSTP within an MST Region, to provide a simply and fully connected active topology for frames classified as belonging to a VLAN that is mapped to the MSTI by the MST Configuration Table used by the MST Bridges of that MST Region.”1 –64 distinct MST topologies (MSTIs) are calculated and maintained by MSTP, however, not all topologies are actively used to carry traffic, as the VLANs may not all be in use. 1 – IEEE Std 802.1Q™-2003 sub-clause 3.19

U NIVERSITY of N EW H AMPSHIRE I NTER O PERABILITY L ABORATORY UNH-IOL Bridge Functions Consortium Definitions (cont.) MST Configuration Identifier –A parameter used to determine if a set of Bridges belongs to a single region. Consists of several values: Configuration ID Format Selector – value of “0” indicates use of following fields as defined in IEEE 802.1Q™ Configuration Name – “A variable length test string endoded within a fixed field of 32 octets” 1, used to identify a MST region with a human readable name. Revision Level – unsigned number in 2 octet field Configuration Digest – 16 field resulting from HMAC-MD5 encoding of the MSTI column of a MSTI to VID table. “the MST Configuration Table is considered to contain 4096 consecutive two octet elements, where each element of the table (with the exception of the first and last) contains an MSTID value encoded as a binary number, with the first octet being most significant.” 2 MST Configuration Identifier –A parameter used to determine if a set of Bridges belongs to a single region. Consists of several values: Configuration ID Format Selector – value of “0” indicates use of following fields as defined in IEEE 802.1Q™ Configuration Name – “A variable length test string endoded within a fixed field of 32 octets” 1, used to identify a MST region with a human readable name. Revision Level – unsigned number in 2 octet field Configuration Digest – 16 field resulting from HMAC-MD5 encoding of the MSTI column of a MSTI to VID table. “the MST Configuration Table is considered to contain 4096 consecutive two octet elements, where each element of the table (with the exception of the first and last) contains an MSTID value encoded as a binary number, with the first octet being most significant.” 2 1 – IEEE Std 802.1Q™-2003 sub-clause – IEEE Std 802.1Q™-2003 sub-clause – IEEE Std 802.1Q™-2003 sub-clause – IEEE Std 802.1Q™-2003 sub-clause 13.7

U NIVERSITY of N EW H AMPSHIRE I NTER O PERABILITY L ABORATORY UNH-IOL Bridge Functions Consortium Definitions (cont.) CIST Regional Root – –“The one Bridge in each Region whose minimum cost path to the Root is not through another Bridge using the same MST Configuration Identifier…” 1 CIST Regional Root – –“The one Bridge in each Region whose minimum cost path to the Root is not through another Bridge using the same MST Configuration Identifier…” 1 1 – IEEE Std 802.1Q™-2003 sub-clause 3.19

U NIVERSITY of N EW H AMPSHIRE I NTER O PERABILITY L ABORATORY UNH-IOL Bridge Functions Consortium Protocol Design Goals Produce a single spanning tree active topology for any given VLAN, ensuring that there is only one data path between any two end stations for frames associated to said VLAN. Provide fault tolerance by automatically reconfiguring topology after Bridge or data path failures. Achieve stable topology in minimal amount of time. Predictable/reproducible active topology that may be selected by management actions. Operate transparent to end stations. Minimal overhead used by Bridges to establish topology. Frames for different VLANs may follow different paths. Provide simple and full connectivity even in administrative errors of VLAN to spanning tree allocation. Minimal required memory requirements and device configuration. Produce a single spanning tree active topology for any given VLAN, ensuring that there is only one data path between any two end stations for frames associated to said VLAN. Provide fault tolerance by automatically reconfiguring topology after Bridge or data path failures. Achieve stable topology in minimal amount of time. Predictable/reproducible active topology that may be selected by management actions. Operate transparent to end stations. Minimal overhead used by Bridges to establish topology. Frames for different VLANs may follow different paths. Provide simple and full connectivity even in administrative errors of VLAN to spanning tree allocation. Minimal required memory requirements and device configuration.

U NIVERSITY of N EW H AMPSHIRE I NTER O PERABILITY L ABORATORY UNH-IOL Bridge Functions Consortium Forming MST Regions Requirements for forming MST Regions to realize performance improvements: –Consistent means of associating VIDs to MSTIs. –Agreement on Config. Name and Revision Level. –Assessment of data distribution in network. –Performance goals regarding quality of service for communication sets within MST Region. –Assign parameter values to Bridges within MST Region to realize performance goals. Requirements for forming MST Regions to realize performance improvements: –Consistent means of associating VIDs to MSTIs. –Agreement on Config. Name and Revision Level. –Assessment of data distribution in network. –Performance goals regarding quality of service for communication sets within MST Region. –Assign parameter values to Bridges within MST Region to realize performance goals.

U NIVERSITY of N EW H AMPSHIRE I NTER O PERABILITY L ABORATORY UNH-IOL Bridge Functions Consortium MSTP provides… MST Configuration Identifier CIST priority vector MSTI priority vector Distributed spanning tree algorithm (CIST/MSTI) CIST/MSTI Port Roles MST Configuration Identifier CIST priority vector MSTI priority vector Distributed spanning tree algorithm (CIST/MSTI) CIST/MSTI Port Roles

U NIVERSITY of N EW H AMPSHIRE I NTER O PERABILITY L ABORATORY UNH-IOL Bridge Functions Consortium Pieces of the topology –One Bridge selected as CIST Root of network. –Minimum path cost to CIST Root calculated for all Bridges and LANs. –CIST Regional Root –MSTI Regional Root –Minimum path cost to MSTI Regional Root calculated for all Bridges and LANs. –One Bridge selected as CIST Root of network. –Minimum path cost to CIST Root calculated for all Bridges and LANs. –CIST Regional Root –MSTI Regional Root –Minimum path cost to MSTI Regional Root calculated for all Bridges and LANs.

U NIVERSITY of N EW H AMPSHIRE I NTER O PERABILITY L ABORATORY UNH-IOL Bridge Functions Consortium CIST Port Roles Root Port –“Provides the minimum cost path from the Bridge to the CIST Root (if the Bridge is not the CIST Root) through the Regional Root (if the Bridge is not a Regional Root).” 1 Designated Port –“Provides the least cost path from the attached LAN through the Bridge to the CIST Root.” 2 Alternate or Backup Ports –“Provide connectivity if other Bridges, Bridge Ports, or LANs fail or are removed.” 3 Root Port –“Provides the minimum cost path from the Bridge to the CIST Root (if the Bridge is not the CIST Root) through the Regional Root (if the Bridge is not a Regional Root).” 1 Designated Port –“Provides the least cost path from the attached LAN through the Bridge to the CIST Root.” 2 Alternate or Backup Ports –“Provide connectivity if other Bridges, Bridge Ports, or LANs fail or are removed.” 3

U NIVERSITY of N EW H AMPSHIRE I NTER O PERABILITY L ABORATORY UNH-IOL Bridge Functions Consortium Things to note Paths within a region are always preferred to paths outside a region.

U NIVERSITY of N EW H AMPSHIRE I NTER O PERABILITY L ABORATORY UNH-IOL Bridge Functions Consortium AdvantagesAdvantages Transparent operation with legacy STP and RSTP implementations. Eliminates the need for having a separate RSTP spanning tree for each VLAN. –Saves processing and memory consumption on the device. –Much easier control when a large number of VLANs are used. Built on the RSTP protocol. Transparent operation with legacy STP and RSTP implementations. Eliminates the need for having a separate RSTP spanning tree for each VLAN. –Saves processing and memory consumption on the device. –Much easier control when a large number of VLANs are used. Built on the RSTP protocol.

U NIVERSITY of N EW H AMPSHIRE I NTER O PERABILITY L ABORATORY UNH-IOL Bridge Functions Consortium DesignDesign The design of the multiple spanning tree protocol is based on RSTP and extended to allow for different VLANs to travel along separate “instances” of spanning tree while allowing compatibility with legacy STP devices. An MST Instance may have a different root bridge than the CIST. The design of the multiple spanning tree protocol is based on RSTP and extended to allow for different VLANs to travel along separate “instances” of spanning tree while allowing compatibility with legacy STP devices. An MST Instance may have a different root bridge than the CIST.

U NIVERSITY of N EW H AMPSHIRE I NTER O PERABILITY L ABORATORY UNH-IOL Bridge Functions Consortium Design (cont.) Port priority and path cost are treated the same as classic STP but MSTP allows a port to have a different priority and path cost for the CIST and any MST instance. –Because of this and the fact that bridge priorities may be different depending on the instance, frames may travel a different paths in the active topology depending on what instance they are assigned to. Port priority and path cost are treated the same as classic STP but MSTP allows a port to have a different priority and path cost for the CIST and any MST instance. –Because of this and the fact that bridge priorities may be different depending on the instance, frames may travel a different paths in the active topology depending on what instance they are assigned to.

U NIVERSITY of N EW H AMPSHIRE I NTER O PERABILITY L ABORATORY UNH-IOL Bridge Functions Consortium ExampleExample Bridge Partner 1 Bridge Partner 2Bridge Partner 3 Bridge Partner 4 MSTI 1 MSTI 2 MSTI 1 In this example traffic moving from bridge partner (BP) 1 to bridge partner 3 travels in different paths depending on what MSTI it belongs to. In this case the port connecting BP 1 with BP 2 may have a lower priority than the port connecting BP1 with BP 4 for instance 2. For instance 1 the port with the better priority is connect to BP4 so traffic assigned to that instance will move through BP4 to get to BP3.

U NIVERSITY of N EW H AMPSHIRE I NTER O PERABILITY L ABORATORY UNH-IOL Bridge Functions Consortium QuestionsQuestions –13.3 part d, #4: is this an exclusive statement –13.3 part e, #2: is this done for all MST Bridges in the LAN? –13.3 part d, #4: is this an exclusive statement –13.3 part e, #2: is this done for all MST Bridges in the LAN?