对等网络的临界负载研究

Critical load of peer-to-peer networks

不同于传统的网络拥塞研究方法,从拓扑属性节点介数出发,分析了网络拥塞与介数之间的关系,以排队论为模型,从理论上给出了导致网络拥塞的临界负载与网络拓扑属性介数的公式解.并且以Gnutella网络拓扑结构为模型进行了仿真实验,假设Gnutella网络中的网络流量由搜索请求和搜索响应构成,搜索请求采用k邻居随机路由方式.仿真结果不仅验证了公式解的正确性,而且证明了临界负载和介数之间的必然联系.

Being different from traditional research, on the basis of the betweenness of topological attribution nodes, the relationship between the networks and the betweenness were analyzed. Taken queuing theory as theoretical model, a closed-form solution to the critical load leading the network congestion and the betweenness of the topology attribution in networks was obtained. Assuming that the network traffic was composed of search requests and responses and k-neighbor random walk was used as routing algorithm of search requests, the simulation was carried out by Gnutella network topology. The simulation results validated the solution to the critical load and testified the necessary relation between the betweenness of the nodes and the critical loads.