Difference between revisions of "CCNP 3 Implementing Spanning Tree"

From Teknologisk videncenter
Jump to: navigation, search
m (→‎Examining the RSTP BPDU)
m (→‎Examining the RSTP BPDU)
Line 60: Line 60:
 
{|
 
{|
 
|[[Image:ScreenShot366.jpg|800px|left|thumb|Image text]]
 
|[[Image:ScreenShot366.jpg|800px|left|thumb|Image text]]
 +
|}
 +
==Identifying the RSTP Proposal and Agreement Process==
 +
{|
 +
|[[Image:ScreenShot367.jpg|800px|left|thumb|RSTP Proposals]]
 +
|-
 +
|
 +
#Switch A has a path to the root via switch B and switch C. A new link is then created between the root and switch A, and both ports are in designated blocking state until they receive a BPDU from their counterpart. When a designated port is in a discarding or learning state (and only in this case), it sets the proposal bit on the BPDUs it sends out. This is what happens for port P0 of the root bridge.
 +
#Switch A sees that the proposal BPDU has a superior path cost. It blocks all non-edge designated ports other than the one over which the proposal-agreement process are occurring. This operation is called sync and prevents switches below A from causing a loop during the proposal-agreement process. Edge ports do not have to be blocked and remain unchanged during sync.
 +
#Bridge A sends an agreement that allows the root bridge to put root port P0 in forwarding state. Port P1 becomes the root port for A.
 
|}
 
|}

Revision as of 19:11, 6 September 2010

Describing STP

Identifying Traffic Loops

Switching loop
Prevent briding loops

Describing the 802.1D Spanning Tree Protocol

802.1D

Describing the Root Bridge

Root Bridge
Extended System ID
Prority Field

Describing Port Roles

Port Roles
Port Roles
Root Port Election
STP Path Cost
STP Topology

Explaining Enhancements to STP

STP Enhancments

Implementing RSTP

Describing the Rapid Spanning Tree Protocol

RSTP

Describing RSTP Port States

RSTP Port States
RSTP Port States
RSTP Port States

Describing RSTP Port Roles

Image text
Image text

Explaining Edge Ports

Image text

Examining the RSTP BPDU

Image text

Identifying the RSTP Proposal and Agreement Process

RSTP Proposals
  1. Switch A has a path to the root via switch B and switch C. A new link is then created between the root and switch A, and both ports are in designated blocking state until they receive a BPDU from their counterpart. When a designated port is in a discarding or learning state (and only in this case), it sets the proposal bit on the BPDUs it sends out. This is what happens for port P0 of the root bridge.
  2. Switch A sees that the proposal BPDU has a superior path cost. It blocks all non-edge designated ports other than the one over which the proposal-agreement process are occurring. This operation is called sync and prevents switches below A from causing a loop during the proposal-agreement process. Edge ports do not have to be blocked and remain unchanged during sync.
  3. Bridge A sends an agreement that allows the root bridge to put root port P0 in forwarding state. Port P1 becomes the root port for A.
Retrieved from "http://mars.merhot.dk/w/index.php?title=CCNP_3_Implementing_Spanning_Tree&oldid=13825"