Table of Contents
EECS 122, Lecture 8
Bridges
Extended LANs
The "no-frills" Bridge
The "learning" Bridge
Learning Strategy
Example
Example
Example
Example
Example
Example
Example
Example
Example
Example
Example
Example
Example
Example
Example
Example
Example
Example
Example
Example
Example
Example
Example
Example
Example
Example
Example
Example
Example
Example
Example
Example
Ouch! Loops Hurt
Loop Avoidance
Spanning Tree
Spanning Tree Computation
Computation Outline
Configuration Messages
Election 1
Election 2
Calculating Root, Cost, and Port
Calculating Designated Bridge
Choosing Ports on the ST
Example [Perlman, p 58]
Example (chooses 41 as root)
Example (becomes designated bridge for 1,2)
Example (becomes designated bridge for 1,2)
Example (root bridge 15)
Station Cache
Station Cache Timeout
Spanning Tree Recalculation
Spanning Tree Recalculation
Topology Change
Failures
A Small Snag…
Spanning Tree Recalculation
Temporary Loops
Limiting Temporary Loops
Why is this?
Why is this? [2]
Bridge Limitations
|
Author: kfall
Email: kfall@cs.berkeley.edu
Home Page: http://www-inst.eecs.berkeley.edu/~ee122
|