快速生成树协议在交换芯片BCM53202M上的实现-电子与通信工程专业论文.docxVIP

II II Abstract Implementation of Rapid Spanning Tree Protocol on the switch chip BCM53202M Implementation of Rapid Spanning Tree Protocol on the Switch Chip BCM53202M Abstract With the rapid development of computer networks, people have higher requirements of the reliability of network. In order to reduce the damage caused by network failure, redundant links are usually added in the network. But redundant links will form network loops, which make broadcast packets circulate and increase continuously, resulting in broadcast storm. The solution is to implement RSTP(Rapid Spanning Tree Protocol) on the switch. By exchanging BPDU(Bridge Protocol Data Unit) packets, RSTP cuts off redundant links, eliminates network loops and trims the network topology to be a tree. This thesis implements RSTP on the switch chip BCM53202M, in the Linux system. In the program design, some improvements on RSTP are conducted to enhance performance. This thesis briefly introduces the hardware structure of the switch, as well as its switch chip and processor chip. The principle of RSTP is described in detail, and the overall design idea, the main data structure and function are given in the thesis. The related drivers’ design includes that of the character device driver for read-write operation on registers of switch chip and modification of the network device driver. At last, web pages are created to configure BPDU parameters, which involve the codes of web pages and background application. The software testing results demonstrate that RSTP implemented here meets the requirements of IEEE 802.1W standard, and its network convergence time can be less than one second. So it satisfies the general network communications. Keywords: network loops; Rapid Spanning Tree; BPDU; Linux Written by : Peng Li Supervised by: Hong Wei Wu 目 录 第一章 绪论1 1.1 课题研究背景及意义1 1.2 课题研究现状分析2 1.3 论文研究内容2 1.4 论文组织结构3 第二章 快速生成树协议介绍4 2.1 RSTP 专业术语解释 4 2.2 RSTP 工作原理介绍 6 2.3 RSTP 对 STP 在收敛时间方面的改进 7 第三章 系统硬件9 3.1 系统硬件结构9