Ccna3 - Chapter 2 - Lan Redundancy

Front 1

Considerations when implementing redundancy

Back 1

• MAC database instability
  
• Broadcast storms
• Multiple frame transmission
  

Front 2

Spanning Tree Algorithm

Back 2

• IEEE 802.1D STP and RSTP use the Spanning Tree Algorithm (STA)
• The STA designates a single switch as the root bridge and uses it as the reference point for all path calculations
  

Front 3

What is BPDU (Bridge Protocol Data Units)

Back 3

• A BPDU is a messaging frame exchanged by switches for STP.
• Each BPDU contains a BID that identifies the switch that sent the BPDU.
  
• The BID contains a priority value, the MAC address of the sending switch, and an optional extended system ID.
  

Front 4

PSVT + Characteristics

Back 4

• very high resources
• fast spanning tree
• optimum load spanning
• use for VANS
• makes network slower

Front 5

5 STP port states

Back 5

1. Processes revieved BPDUS
2. Forward data frames revieved on interface
3. Forward data frames switched to another interface
4. Learn MAC addresses

Front 6

Rapid PVST +

Back 6

• RAPT supports new port type
• no blocking ports. RSTP defines port states as discarding, learning, forwarding

Front 7

Spanning - tree portfast

What does it do?

Back 7

Makes port go faster

Used for end devices such as voip

Pared up with BPDUS guard. Shuts down port of BDPU is used. Error disabled state