摘要
生成树协议通过生成树算法计算使网络活动拓扑成为树型结构,防止环路引起的网络风暴。IEEE 802.1D生成树协议(STP)的缺陷在于收敛时间长,无法满足高速网络的需求。IEE E802.1w定义的快速生成树协议(RSTP)针对这个缺陷进行了一系列改进,本文详细分析RSTP协议设计的改进方法。
Spanning Tree Protocol makes the structure of network's active topology like a tree by Spanning Tree Algorithm.So it can avoid network storm brought by loops.IEEE 802.1D Spanning Tree Protocol can 't meet the demands of high-speed network because of its slow astringency speed.This paper points out the short-comings of STP and analyzes these improved methods in RSTP in detail.
出处
《微计算机信息》
2011年第1期235-236,287,共3页
Control & Automation
关键词
生成树算法
快速生成树协议
收敛速度
Spanning Tree Algorithm
Rapid Spanning Tree Protocol
Astringency Speed