A Study on the Operations of Spanning Tree Algorithm and Protocol in the VLAN Environment
碩士 === 國立交通大學 === 資訊管理研究所 === 86 === The Spanning Tree Algorithm and Protocol will configure a simplyconnected active topology from the arbitrarily connected componentsof a Bridged Local Area Network into a single spanning tree,such that th...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
1998
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/09633672046122414716 |
| Summary: | 碩士 === 國立交通大學 === 資訊管理研究所 === 86 === The Spanning Tree Algorithm and Protocol will configure a
simplyconnected active topology from the arbitrarily connected
componentsof a Bridged Local Area Network into a single spanning
tree,such that there is at most one data route between any two
end stations,eliminating data loops.This thesis proposes a
Virtual LAN Spanning Tree Algorithm and Protocol.This algorithm
is proposed according to the features of Virtual LAN.With the
operation of this algorithm, all the members belong to thesame
VLAN will be included in an isolated Spanning Tree. And the
spann-ing tree formed for a given VLAN will use as many
connection devicesthat still not participate in any spanning
tree topology before aspossible.
|
|---|