Ccna3 3.1-07 STP

Cisco 3 Switching STP
Perrine / Brierley
Chapter 7
05/27/15
Page 1
Chapter 7
Spanning Tree Protocol (STP)
Having redundancy in a network is important, and allows the network to be

fault tolerant. That is, when faults occur the networking is not shut
downed.
However, redundant topologies that are based on switches and bridges are
susceptible to:
1.
Broadcast storms
2.
Multiple frame transmissions, and
3.
MAC database instability
NOTE: Cisco interchanges bridges and switches to mean switches
Perrine / Brierley
05/27/15
Page 2
Chapter 7
What is redundancy?
Ideally for business, it is 24/7 uptime. Though this is some what impossible,
so business are looking for 5 nines, 99.999%. Which would be 5.25
minutes of downtime per year!
The goal of redundant topologies is to eliminate network outages that are
caused by a single point of failure.
So if you have redundant switches for reliability, then until the switches
learn the MAC address of all devices, this topology will cause:
Broadcast storms
Multiple frame copies, and
MAC address table instability problems
Perrine / Brierley
05/27/15
Page 3
Chapter 7
So when broadcast occurs, sending of multicasts and broadcast messages

flood the network. The frame is sent out all ports except the one on
which the frame was received.
Perrine / Brierley
05/27/15
Page 4
Chapter 7
Server/host
switch A
switch B
When server/host sends a message such as an ARP,
switch A will broadcast it out to every port.
When switch B gets the ARP, it will broadcast it out every port;
then switch A will broadcast it again out every port;
switch B will then broadcast it out every port; and on, and on.
This is called a broadcast storm.
The switches continue to propagate broadcast traffic, and become so busy

processing the broadcasts that user traffic will eventually not flow.
Perrine / Brierley
05/27/15
Page 5
Chapter 7
Multiple Frame Transmission
Most protocols are designed to ignore or cope with duplicate transmissions.

In general, protocols that make use of a sequence numbering mechanism
assume that many transmissions have failed and that the sequence number
has recycled.
Other protocols attempt to hand the duplicate transmission to the appropriate
upper-layer protocol, with unpredictable results.
Perrine / Brierley
05/27/15
Page 6
Chapter 7
Multiple Frame Transmission
Server/host X
Router Y
segment 1
switch A
switch B
segment 2
When host X sends a unicast frame to router Y, one copy is received over the segment 1, while
switch A receives a copy & puts it into its buffers.
if switch A examines the destination address field in the frame and finds no entry in the
MAC address table for router Y, it floods the frame on all ports except for the originating port.
when switch B receives a copy of the frame through switch A on segment 2, it also forwards a
copy of the frame onto segment 1 if there is not entry in the MAC address table for router Y.
router Y receives a copy of the same frame for the second time!
A loop avoidance solution would eliminate the problem of duplicate transmissions by logically
breaking the loop & preventing one of the four interfaces from transmitting frames during normal
operation.
Perrine / Brierley
05/27/15
Page 7
Chapter 7
MAC Database Instability
Server/host X
Router Y
segment 1
PORT 0
PORT 0
switch A
switch B
PORT 1
PORT 1
segment 2
Switch B initiates a mapping between the MAC address of Host X and its Port 0, which
connects to segment 1 when the first frame arrives.
Sometime later, when the copy of the frame that was transmitted through switch A arrives at port
1 of switch B, switch B must remove the first entry and install one that incorrectly maps the MAC
address of station X to the Port 1 that connects to segment 2.
Depending on the internal architecture of the switch, it might or might not cope well
with rapid changes in its MAC database.
So a loop-avoidance solution would eliminate the problem of the switch not coping well
with the rapid change of the MAC address.
Perrine / Brierley
05/27/15
Page 8
Chapter 7
Spanning Tree Overview
The solution for this problem is STP (Spanning Tree Protocol).

It is a Layer 2 link-management protocol that is used to maintain a loop-free
network.
Digital (Digital Equipment Corporation) originally developed STP. The IEEE 802
committee subsequently revised the Digital spanning tree algorithm and
published it in the IEEE 802.1d specification.
The purpose of STP is to maintain a loop-free network topology. A loop-free
topology is accomplished when the switch or bridge recognizes a loop in the
topology and logically blocks one or more redundant ports automatically.
Remember the states:
1.
Blocking
2.
Listening
3.
Learning
4.
Forwarding
5.
Disabled
Perrine / Brierley
05/27/15
Page 9
Chapter 7
Spanning Tree Overview
Switched networks provide these benefits:

smaller collision domains,
microsegmentation
full duplex operation
But most importantly, the ultimate benefit of the switch is performance.
When a component of the active topology fails, a new loop-free topology must be
identified and incorporated. A recalculation or convergence onto a new loop-free
topology must quickly occur to reduce unavailable time experienced by the end
stations. STP, defined by IEEE 802.1d, is too slow in converging on a new
topology for todays network.
A new standard, IEEE 802.1w (RSTP) ,Rapid STP, has been developed to over
come 802.1d limitations.
Perrine / Brierley
05/27/15
Page 10
Chapter 7
Spanning Tree (STP) - Terms
Root Bridge:
The root bridge is determined by combining the priority of the bridge and the
MAC address. (If two bridges/switches have the same priority value, then the
MAC address is used to determine which one has the lowest ID.)
There is only one (1) root bridge per network
Designated ports:
Ports on a root bridge are called designated ports
Each segment will have one designated port selected
Non-root Bridges:
Other bridges/switches in your network are called non-root bridges
Root port
Is the port with lowest cost (determined by a links bandwidth) to the root
bridge
Perrine / Brierley
05/27/15
Page 11
Chapter 7
segment 1- 100BASET
MAC: 0c00c8111111
Priority: 32768
Root port PORT 0
PORT 0
switch A
switch B
PORT 1
Which switch is the root bridge?
PORT 1
MAC: 0c00c8222222
Priority: 32768
segment 2 10BASET
switch A ( same priority, but lowest MAC address)

Hence PORT 0 & PORT 1 on switch A are the designated
port.
Which switch is/are non-root bridges?
switch B
Which ports are root ports?
PORT 0 of switch B
Because the connection from switch B to the root switch (A) is
from PORT 0 using a 100Mbps link and has the best cost.
Designated ports on other switches?
Each segment has one designated port. Since PORT 0 & PORT 1
of switch A are designated ports (because it is the root bridge)
there are no other designated ports.
STP will block PORT 1 of switch B to make it loop-free.
Perrine / Brierley
05/27/15
Page 12
Chapter 7
Spanning Tree Operation
The following will be true for every switched network:

one root bridge exists per network
one root port exists per non-root bridge
one designated port exists per segment
undesignated ports are unused
Root ports and designated ports are used for Forwarding (F) data traffic.
Undesignated ports discard data traffic. These are called Blocking (B) or
discarding ports.
Every non-root bridge must select one root port.
Perrine / Brierley
05/27/15
Page 13
Chapter 7
Spanning Tree
Switches flood traffic out all ports when to a destination that is not yet known.
Broadcast and multicast traffic is forwarded out every port other than the port on
which the traffic arrived (floods).
This traffic is caught in a loop, because the Layer 2 header has no TTL (time to
live). [Layer 3 devices have TTL].
A physical topology may contain switching or bridging loops necessary for
redundancy and reliability,
Hence, physical loops must be allowed but a loop-free logical

topology must be created.
The loop-free logical topology that is created is called a tree.
Perrine / Brierley
05/27/15
Page 14
Chapter 7
Spanning Tree Algorithm
STP establishes a root node, called the root bridge, and constructs a topology
that has one path for reaching every network node. The resulting tree originates
from the root bridge.
Redundant links that are not part of the shortest path tree are blocked.
A loop-free topology is possible because certain paths are blocked. Data
frames that are received on blocked links are dropped.
STP requires network devices to exchange messages to detect bridging loops.
The messages that switches send that allow the forming of a loop-free logical
topology are called BPDUs (bridge protocol data units).
Perrine / Brierley
05/27/15
Page 15
Chapter 7
The BPDUs contain enough information so that all switches can do the following:
1.
select a single switch that will act as the root of the spanning tree.
2.
calculate the SP (shortest path) from itself to the root switch
3.
for each LAN segment, designate one of the switches as the closest one
to the root. This bridge is called the designated switch. The designated
switch handles all communication from that LAN toward the root bridge.
4.
each non-root switch chooses one of its ports as its root port. This is the
interface that gives the best path to the root switch.
5.
select ports that are part of the spanning tree, the designated ports. Nondesignated ports are blocked.
Perrine / Brierley
05/27/15
Page 16
Chapter 7
When the spanning tree is creating a loop-free logical topology, it always uses the
same 4-step decision sequences. As every BPDU arrives, it is checked against
this 4-step sequence to see if it has a lower value than the existing BPDU that is
saved for that port.
1.
Lowest root BID (bridge ID)
2.
Lowest path cost to root bridge
3.
Lowest sender bridge ID
4.
Lowest port ID
When a bridge first becomes active, all of its ports are sending BPDUs every 2
seconds (default).
Perrine / Brierley
05/27/15
Page 17
Chapter 7
When STP is enabled, every bridge in the network goes through the blocking and
transitory states of listening and learning at power up.
If ports are properly configured, they then stabilize to the forwarding or blocking
state.
Forwarding ports provide the lowest-cost path to the root bridge.
Two transitional states, listening & learning, occur when a bridge recognizes a
change in the network topology.
When the bridge first boots up, it thinks it is the root bridge and transitions to the
listening state.
When a port is in the transitional listening state, it can send & receive BPDUs to
determine the active topology. At this point, no user data is being sent.
Perrine / Brierley
05/27/15
Page 18
Chapter 7
Ports that remain as designated or root ports after 15 seconds (forward delay)
transition to the learning state. When the port is in a learning state, it can populate
its MAC address table with MAC addresses that are heard on its port, but does
not yet forward user frames.
Ports that are not the designated or root ports transition back to the blocking state.
The normal time that it takes for a port to transition from the blocking state to the
forwarding state is 30 to 50 seconds.
The time that it takes for a port to transition from the listening state to the learning
state or from the learning state to the forwarding state is called the forward delay
(default value 15 seconds.)
Perrine / Brierley
05/27/15
Page 19
Chapter 7
Note:
Each segment in a bridged network has one designated port. This port functions
as the single bridge port that both sends and receives traffic to and from that
segment and the root bridge.
The idea behind this is that if only one port handles traffic for each link, all the
loops have been broken.
Note:
When STP is faced with a tie, it goes with the lowest BID.
Perrine / Brierley
05/27/15
Page 20
Chapter 7
Spanning Tree Path Cost
Spanning-tree path cost is an accumulated total path cost based on the bandwidth
of all the links in the path.
With the introduction of 10 Gigabit Ethernet, IEEE had to revise its path cost.
Link Speed
Cost(revised)
Cost(previous)
10 Gbps
1 Gbps
100 Mbps
19
10
10 Mbps
100
100
Lower the cost better the path is.
Perrine / Brierley
05/27/15
Page 21
Chapter 7
Spanning Tree Timers
Timer
Purpose
Default
Hello Time
Time between sending of configuration
2 seconds
BPDUs by the root bridge.

Forward Delay
Duration of listening & learning states
15 seconds
Max Age
Time BPDU stored
20 seconds
Perrine / Brierley
05/27/15
Page 22
Chapter 7
Spanning Tree Convergence
ave
h
s
t
por
e
g
d
d bri
n
a
itch
w
s
the state.
l
l
a
ich ocking
h
w
in
bl
e
e
t
h
a
t
t
a s ing or
s
n
a
rd
e
a
m
w
r
P
ST r the fo
n
i
d
rge to eithe
e
v
n
Co itioned
trans
Perrine / Brierley
05/27/15
Page 23
Chapter 7
Rapid Spanning Tree Protocol
(RSTP)
RSTP (Rapid Spanning Tree Protocol), IEEE 802.1 w is designed to significantly

speed the recalculation of the spanning tree when the network topology changes.
The rapid transition is the most important feature introduced with RSTP. Before
802.1w, the spanning-tree algorithm waited passively for the network to converge
before transitioning a port to the forwarding state
The new RSTP actively confirms that a port can safely transition to forwarding
without relying on a timer configuration.
Perrine / Brierley
05/27/15
Page 24
Chapter 7
(RSTP)
To achieve fast convergence on a port, the protocol relies on two new variables:
Edge port
Link type (point-to-point)
Edge ports are those that are directly connected to end stations.
Though RSTP is only able to achieve rapid transition to forwarding on edge ports
and on point-to-point links.
Perrine / Brierley
05/27/15
Page 25
Chapter 7
Module 7
Spanning Tree Protocol
Perrine / Brierley
05/27/15
Page 26
Chapter 7
Redundancy
Redundancy in a network is needed in case there
is loss of connectivity in one segment.
But redundancy in itself presents problems
loops.
The Spanning-Tree Protocol is used in switched
networks to create a loop free logical topology
from a physical topology that has loops.
Links, ports, and switches that are not part of the
active loop free topology do not participate in the
forwarding of data frames.
Perrine / Brierley
05/27/15
Page 27
Chapter 7
Redundancy
Companies want 100% uptime, but 99.999% (5
nines) is the goal.
Remember the goal is reliability without faults.
Fault tolerance is achieved by redundancy.
Example of having 1 car versus 2 cars 1 is
always available redundancy
So companies should:
eliminate single points of failure and
design alternate routes to a destination
Perrine / Brierley
05/27/15
Page 28
Chapter 7
Reliability and 24x7 network

demands have compelled LAN
designers to construct multiple
paths between user and resource
Perrine / Brierley
05/27/15
Page 29
Chapter 7
Redundant Switched Topologies

Again, if one path fails, the other path or
device can take over.
This is good, but there is a downside that
has to be accounted for:
Broadcast storms
Multiple (or duplicate) frame copies
MAC address table instabilities
Perrine / Brierley
05/27/15
Page 30
Chapter 7
Redundant Paths and

No Spanning Tree. . .
Perrine / Brierley
05/27/15
Page 31
Cisco 3 Switching
(1 ) 0 0 -A 1 s e n d s fra m e to C C -2 3
STP S w i t c h 1 a n d S w i t c h 2 l e a r n a b o u t 0 0 - A 1
0 0 -A 1
Chapter 7
B B -4 4
SAT
P o rt 1
P o rt 2
0 0 -A 1
SAT
P o rt 1
P o rt 2
0 0 -A 1
P o rt 1
P o rt 1
L A N S w itc h 1
L A N S w itc h 2
P o rt 2
Perrine / Brierley
P o rt 2
A A -1 1
05/27/15
C C -2 3
Page 32
(2 ) L A N S w itc h 1 F lo o d s p a c k e t o u t P o r t 2
Chapter 7
s in c e C C -2 3 is n o t k n o w n
0 0 -A 1
B B -4 4
SAT
P o rt 1
P o rt 2
0 0 -A 1
SAT
P o rt 1
P o rt 2
0 0 -A 1
P o rt 1
P o rt 1
L A N S w itc h 1
L A N S w itc h 2
P o rt 2
Perrine / Brierley
P o rt 2
A A -1 1
05/27/15
C C -2 3
Page 33
(3 ) L A N S w itc h 2 le a r n s (in c o r r e c tly ) th a t

Cisco 3 Switching STP ( S o u r c e M A C ) 0 0 - A 1 i s o n P o r t 2
Chapter 7
0 0 -A 1
B B -4 4
SAT
P o rt 1
P o rt 2
0 0 -A 1
SAT
P o rt 1
P o rt 2
0 0 -A 1
P o rt 1
P o rt 1
L A N S w itc h 1
L A N S w itc h 2
P o rt 2
Perrine / Brierley
P o rt 2
A A -1 1
05/27/15
C C -2 3
Page 34
Chapter 7
Or, A Broadcast
Storm. . .
Perrine / Brierley
05/27/15
Page 35
Chapter 7
Broadcast Storms, like ARP requests

1
10BaseT Ports (12)
Switch A
Host A
Hub
00-90-27-76-96-93
10BaseT Ports (12)
Switch B
1 2
100BaseT Ports
Host B
00-90-27-76-5D-FE
Perrine / Brierley
05/27/15
Page 36
Chapter 7
Because it is a Layer 2 broadcast frame, both switches,

Switch A and Switch B, flood the frame out all ports,
including their port As.
10BaseT Ports (12)
Switch A
Host A
Hub
00-90-27-76-96-93
10BaseT Ports (12)
Switch B
1 2
100BaseT Ports
Host B
00-90-27-76-5D-FE
Perrine / Brierley
05/27/15
Page 37
Chapter 7
Both switches receive the same broadcast, but on a

different port. Doing what switches do, both switches
flood the duplicate broadcast frame out their other ports.
10BaseT Ports (12)
Switch A
Duplicate
frame
Duplicate
frame
Host A
Hub
00-90-27-76-96-93
10BaseT Ports (12)
Switch A
1 2
100BaseT Ports
Host B
00-90-27-76-5D-FE
Perrine / Brierley
05/27/15
Page 38
Chapter 7
Here we go again, with the switches flooding the same

broadcast again out its other ports. This results in
duplicate frames, known as a broadcast storm!
10BaseT Ports (12)
Switch A
Host A
Hub
Duplicate
Frame
Duplicate
Frame
00-90-27-76-96-93
10BaseT Ports (12)
Switch B
1 2
100BaseT Ports
Host B
00-90-27-76-5D-FE
Perrine / Brierley
05/27/15
Page 39
Chapter 7
Layer 2 broadcasts not only take up network bandwidth,

but must be processed by each host. This can severely
impact a network, to the point of making it unusable.
10BaseT Ports (12)
Switch A
Host A
Hub
00-90-27-76-96-93
10BaseT Ports (12)
Switch B
1 2
Host B
00-90-27-76-5D-FE
Perrine / Brierley
05/27/15
Page 40
Chapter 7
Redundant Topology
The traffic that switches flood out all ports can be caught
in a loop, because in the Layer 2 header there is no TTL.
(Remember that in Layer 3 the TTL is decremented and
the packet is discarded when the TTL reaches 0)
You need switching (bridging) for reliability, but now the
problem of loops a switched network cannot have loops
if it is to do what it is supposed to do.
Solution? Allow physical loops, but create a loop-free
topology
Perrine / Brierley
05/27/15
Page 41
Chapter 7
Spanning Tree
Protocol
Perrine / Brierley
05/27/15
Page 42
Chapter 7

ast
Broadc
Frame
Standby Link
Switches forward broadcast frames

Prevents loops
Loops can cause broadcast storms and duplicate frames
Allows redundant links
Prunes topology to a minimal spanning tree
Resilient to topology changes and device failures
Main function of the Spanning Tree Protocol (STP) is to allow redundant
switched/bridged paths without suffering the effects of loops in the
network
Perrine / Brierley
05/27/15
Page 43
Chapter 7
Root Bridge
B
C
J
Server
= Forwarding Path
F
Root
Bridge
= Backup Link
Server
G
The Spanning-Tree Protocol specifies an algorithm (Spanning-Tree
Algorithm) that ultimately creates a logical loop-free topology
Perrine / Brierley
05/27/15
Page 44
Chapter 7
The STA is used to calculate a loop-free logical topology.
Spanning-tree frames called bridge protocol data units (BPDUs)

are sent and received by all switches in the network at regular
intervals and are used to determine the spanning tree topology.
These BPDUs are used to determine the shortest path to the root
bridge, and which ports will forward frames as part of the
spanning tree BPDUs sent out every 2 seconds
A separate instance of STP runs within each configured VLAN.
Perrine / Brierley
05/27/15
Page 45
Chapter 7
Spanning Tree
For every switched
network:
One root bridge
One root port per
non root bridge
One designated
port per segment
Unused, nondesignated ports
Perrine / Brierley
05/27/15
Page 46
Chapter 7
3 Steps to Spanning Tree

Step 1: Electing a Root Bridge
Bridge Priority
Bridge ID
Root Bridge
Step 2: Electing Root Ports
Path Cost or Port Cost
Root Path Cost
Root Port
Step 3: Electing Designated Ports
Perrine / Brierley
Path Cost or Port Cost
Root Path Cost

05/27/15
Page 47
Chapter 7
Step 1: Electing a Root Bridge
The first step is for switches to select a

Root Bridge.
The root bridge is the bridge from which

all other paths are decided.
Only one switch can be the root bridge.

Election of a root bridge is decided by:
1. Lowest Bridge Priority
2. Lowest Bridge ID (tie-breaker)
Perrine / Brierley
05/27/15
Page 48
Chapter 7
Bridge Priority
Perrine / Brierley
This is a numerical value.
The switch with the with the lowest bridge

priority is the root bridge.
The switches use BPDUs to accomplish

this.
All switches consider themselves as the

root bridge until they find out otherwise.
All Cisco Catalyst switches have the

default Bridge priority of 32768.
05/27/15
Page 49
Chapter 7
Bridge Priorities
A
AB
10BaseT Ports (12)

B
10BaseT Ports (24)

C
10BaseT Ports (24)
Perrine / Brierley
05/27/15
100BaseT
Ports
AB
100BaseT
Ports
AB
100BaseT
Ports
Page 50
Chapter 7
Switch A: Bridge Priority

Catalyst 1900 - Spanning Tree Configuration - Option 1
----------------------- Information -----------------------------------[V] VLANs assigned to option
1-1005
----------------------- Settings --------------------------------------[B] Bridge priority
32768 (8000 hex)
[M] Max age when operating as root
20 second(s)
[H] Hello time when operating as root
2 second(s)
[F] Forward delay when operating as root
15 second(s)
Perrine / Brierley
05/27/15
Page 51
Chapter 7
In case of a tie, the Bridge ID is used

Bridge ID
Perrine / Brierley
The Bridge ID is the MAC address assigned

to the individual switch.
The lower Bridge ID (MAC address) is the

tiebreaker.
Because MAC addresses are unique, this

ensures that only one bridge will have the
lowest value.
NOTE: There are other tie breakers, if these

values are not unique, but we will not cover
those situations.
05/27/15
Page 52
Chapter 7
Catalyst 1900 Management Console

Copyright (c) Cisco Systems, Inc. 1993-1998
All rights reserved.
Enterprise Edition Software
Ethernet Address:
00-B0-64-26-6D-00
PCA Number:
73-3122-04
PCA Serial Number: FAB03503222
Model Number:
WS-C1912-EN
System Serial Number: FAB0351U08M
Power Supply S/N:
PHI033301VQ
PCB Serial Number: FAB03503222,73-3122-04
Perrine / Brierley
05/27/15
Page 53
Chapter 7
Bridge Priorities and Bridge Ids

Which one is the lowest?
A
Priority: 32768
ID: 00-B0-64-26-6D-00
AB
10BaseT Ports (12)

B
Priority: 32768
100BaseT
Ports
AB
ID: 00-B0-64-58-CB-80
10BaseT Ports (24)

C
Priority: 32768
100BaseT
Ports
AB
ID: 00-B0-64-58-DC-00
10BaseT Ports (24)

Perrine / Brierley
05/27/15
Page 54
Chapter 7
Lowest: A becomes the root bridge

A
Priority: 32768
ID: 00-B0-64-26-6D-00
AB
10BaseT Ports (12)

B
Priority: 32768
100BaseT
Ports
ID: 00-B0-64-58-CB-80
AB
10BaseT Ports (24)

C
Priority: 32768
ID: 00-B0-64-58-DC-00
10BaseT Ports (24)

Perrine / Brierley
05/27/15
AB
Page 55
Chapter 7
Understanding STP States

States initially set, later modified by STP
Blocking
Listening
Learning
Forwarding
Disabled
Server ports can be configured to

immediately enter STP forward mode
Perrine / Brierley
05/27/15
Page 56
Chapter 7
Understanding STP States

Blocking - No frames forwarded, BPDUs
received
Listening - No frames forwarded,
listening for frames
Learning - No frames forwarded, but
learning MAC addresses
50 seconds
from
blocking to
forwarding
Perrine / Brierley
Forwarding Receiving BPDUs,

Forwarding data traffic, receiving data
traffic, learns MAC addresses
Disabled - No frames forwarded, no
BPDUs heard
05/27/15
Page 57
Chapter 7

IEEE 802.1w
Will eventually replace 802.1d
Port states and roles will be clarified
A set of link types will be defined that will allow
going to a forwarding stage quicker
All switches will generate their own BPDUs instead
of relying on the root bridge.
Link types would be:
Point to point
Edge-type
Shared
Perrine / Brierley
Can go to forward state

immediately
05/27/15
Page 58
Chapter 7
Module 7
Perrine / Brierley
05/27/15
Page 59

Ccna3 3.1-07 STP

Hochgeladen von

Dokumentinformationen

Originaltitel

Copyright

Verfügbare Formate

Dieses Dokument teilen

Dokument teilen oder einbetten

Freigabeoptionen

Stufen Sie dieses Dokument als nützlich ein?

Sind diese Inhalte unangemessen?

Copyright:

Verfügbare Formate

Ccna3 3.1-07 STP

Hochgeladen von

Copyright:

Verfügbare Formate

Cisco 3 Switching STP

Cisco 3 Switching STP

Having redundancy in a network is important, and allows the network to be

Multiple frame transmissions, and

MAC database instability

NOTE: Cisco interchanges bridges and switches to mean switches

Cisco 3 Switching STP

Multiple frame copies, and

MAC address table instability problems

Cisco 3 Switching STP

So when broadcast occurs, sending of multicasts and broadcast messages

Cisco 3 Switching STP

When server/host sends a message such as an ARP,

switch A will broadcast it out to every port.

then switch A will broadcast it again out every port;

This is called a broadcast storm.

The switches continue to propagate broadcast traffic, and become so busy

Cisco 3 Switching STP

Most protocols are designed to ignore or cope with duplicate transmissions.

Cisco 3 Switching STP

Cisco 3 Switching STP

Cisco 3 Switching STP

The solution for this problem is STP (Spanning Tree Protocol).

Cisco 3 Switching STP

Switched networks provide these benefits:

Cisco 3 Switching STP

Cisco 3 Switching STP

Root port PORT 0

Which switch is the root bridge?

switch A ( same priority, but lowest MAC address)

Which switch is/are non-root bridges?

Which ports are root ports?

Designated ports on other switches?

STP will block PORT 1 of switch B to make it loop-free.

Cisco 3 Switching STP

The following will be true for every switched network:

Cisco 3 Switching STP

Hence, physical loops must be allowed but a loop-free logical

Cisco 3 Switching STP

Cisco 3 Switching STP

calculate the SP (shortest path) from itself to the root switch

Cisco 3 Switching STP

Lowest root BID (bridge ID)

Lowest path cost to root bridge

Lowest sender bridge ID

Cisco 3 Switching STP

Cisco 3 Switching STP

Cisco 3 Switching STP

Cisco 3 Switching STP

Lower the cost better the path is.

Cisco 3 Switching STP

Time between sending of configuration

BPDUs by the root bridge.

Duration of listening & learning states

Time BPDU stored

Cisco 3 Switching STP

Cisco 3 Switching STP

RSTP (Rapid Spanning Tree Protocol), IEEE 802.1 w is designed to significantly

Cisco 3 Switching STP

Link type (point-to-point)

Cisco 3 Switching STP

Cisco 3 Switching STP

Cisco 3 Switching STP