Basic HTML version of Foils prepared Dec. 6 98

Foil 9 Transparent Bridging (3)

From Introduction to Network Security Lectures at Xi'an Jaotong University -- Sept 1998. by Roman Markowski
1 Spanning Tree Algorithm
  • developed by Digital
  • preserves the benefits of loops
  • eliminates "bridging loop problem"
  • IEEE 802.1d (final specification, not compatible with initial Digital solution)
  • there are 5 possible states considered by a bridge
    • disabled; blocking; listening; learning; forwarding
  • terminology
    • unique bridge identifier; port identifier; root bridge; path cost; root port; root path cost; designated bridge and port
in Table To:

© Northeast Parallel Architectures Center, Syracuse University, npac@npac.syr.edu

If you have any comments about this server, send e-mail to webmaster@npac.syr.edu.

Page produced by wwwfoil on Sun Dec 6 1998