复杂网络中路由算法研究及实现-控制理论与控制工程专业论文.docx

华中科技大学硕士学位论文 华 中 科 技 大 学 硕 士 学 位 论 文 II II Abstract Communication network has become an indispensable tool for daily life. And with the expandable scale of communication network, routing has become one of the nuclear network problems. But people living with complex networks suffer from the congestion caused by plenty of simultaneous information. So the research on routing algorithm has some significance to the ease of congestion. Based on the concept of complex network and congestion control, this thesis introduces serial routing algorithms, such as general routing algorithm, shortest path routing algorithm, local routing algorithm and so on. And then the thesis focuses on two local routing algorithms, one is based on local information and the other is based on local visibility. Then it points out the fact that although routing algorithm doesn’t caused congestion in essence, good algorithm or bad algorithm plays an important role in the performance of network. The local routing algorithm can make full use of the local information about congestion and then prevent or relieve congestion through dispatching the packet to different link or router. This routing algorithm can be used to improve the performance of the network. On the background of a project named “distributed monitoring and feedback control system”, the thesis sets forth the components and topological architecture of the system. Then put forward a proposal of applying the routing algorithm based on local visibility into the program. In the thesis, the scale-free network is used to modeling the system. Through practical qualitative analysis, we conclude that, compared to shortest path routing algorithm, the algorithm based on local visibility can relieve the congestion state of the system better. Also the result supports the validity of the routing algorithm. Furthermore, the routing algorithm based on local visibility can get the same performance as those algorithms knowing the whole architecture of the ne