DocumentCode
3783698
Title
An approach to build stable spanning tree topology
Author
K. Segaric;P. Knezevic;B. Blaskovic
Author_Institution
Coting d.o.o., Zagreb, Croatia
Volume
2
fYear
2001
fDate
6/23/1905 12:00:00 AM
Firstpage
400
Abstract
This paper considers stability problems regarding topology produced by a spanning tree algorithm in transparent bridged networks, and presents an approach to build a stable spanning tree structure that is not dependent on a root bridge. This approach relies on tuning spanning-tree port cost in a way that the produced topology resists possible attacks or newly connected misconfigured bridges. Special care was taken to ensure stability in transition periods, where bridges negotiate about a new root. This approach is completely standards-based and requires only that is possible to tune link costs of switch/bridge ports.
Keywords
"Switches","Bridges","Network topology","Costs","Stability","Protocols","Packet switching","Computer networks","Tree data structures","Postal services"
Publisher
ieee
Conference_Titel
EUROCON´2001, Trends in Communications, International Conference on.
Print_ISBN
0-7803-6490-2
Type
conf
DOI
10.1109/EURCON.2001.938148
Filename
938148
Link To Document