复杂网络中基于局域信息的路由选择策略信息安全专业论文.docx

II II Abstract With the rapid development of society, communication networks such as the Internet have become indispensable necessities of daily life, which plays an important role in today’s society. However, network size and the number of users have grown explosively, and congestion has become an inevitable phenomenon of network. Serious congestion will make network throughput and transmission reducing, and may even cause the collapse of the entire network. Therefore, how to mitigation and control network congestion and how to improve the communication capability of the network by routing strategy have become an important research direction of traffic dynamics. Early studies of complex network’s congestion control were carried out on a homogeneous network, but most of the communication networks possess the characteristics of the power-law distribution, so the study on the scale-free network routing strategy has important practical significance. This dissertation is based on the research of previous work on network congestion and optimal routing strategy, deeply studies the routing strategy based on the local information, and propose two improved routing schemes to enhance network throughput and transmission performance. The main contents and contributions of this dissertation are as follows: Aiming at the deficiencies of the traditional routing strategy based on local information, on an improved routing method based on local information is proposed on scale-free network. This algorithm is only related to the degree of a node, and the improved method can choose the adjacent node which has the smaller degree with a greater probability. And by this way the hub node can be avoided, the transport burden of the hub node can be reduced and the handling capacity of the network can be maximized. Some simulations and relate theoretical proof are given to demonstrate the effectiveness of the proposed method, showing that this strategy does better than traditional routing str