ICND2 Chapter 02 Flashcards
(62 cards)
Three classes of Problems caused by not using STP in Redundant LANs
Broadcast storms MAC table instability Multiple frame transmission
STP: All the root switch’s ports Blocking/Forwarding
Forwarding
STP: Each nonroot switch’s root port Blocking/Forwarding
Forwarding
STP: Each LAN’s designated port Blocking/Forwarding
Forwarding
STP: All the other working ports Blocking/Forwarding
Blocking
Fields in the STP Hello BPDU: Root Bridge ID
The bridge ID believed to be the root
Fields in the STP Hello BPDU: Sender’s bridge ID
The bridge ID of the bridge/switch sending this BPDU
Fields in the STP Hello BPDU: Cost to each root
The STP cost between this switch and the current root
Fields in the STP Hello BPDU: Timer values on the root switch
Hello Timer; Max Age timer; Forward Delay timer
Default Port Costs According to IEEE: 10 Mbps
100; 100
Default Port Costs According to IEEE: 100 Mbps
10; 19
Default Port Costs According to IEEE: 1 Gbps
1; 4
Default Port Costs According to IEEE: 10 Gbps
1; 2
STP Timer: Hello
Time between Hello’s; 2 second default
STP Timer: Max Age
How long any switch should wait after last Hello; 10 x Hello default
STP Timer: Forward Delay
Listen State = Forward Delay; Learning State = Forward Delay; 15 second default
IEEE 802.1D Spanning –Tree State Blocking: Forwards Data Frames
No
IEEE 802.1D Spanning –Tree State Blocking: Learns MACs Based on Received Frames
No
IEEE 802.1D Spanning –Tree State Blocking: Transitory or Stable State
Stable
IEEE 802.1D Spanning –Tree State Listening: Forwards Data Frames
No
IEEE 802.1D Spanning –Tree State Listening: Learns MACs Based on Received Frames
No
IEEE 802.1D Spanning –Tree State Listening: Transitory or Stable State
Transitory
IEEE 802.1D Spanning –Tree State Learning: Forwards Data Frames
No
IEEE 802.1D Spanning –Tree State Learning: Learns MACs Based on Received Frames
Yes
