对等网络的拥塞研究  

Research of Peer-to-Peer network congestion

作　　者：陈浩[1] 杨祝林[1] 陈铁群[1] 李丁丁[1] 

机构地区：[1]湖南大学计算机与通信学院,湖南长沙410082

出　　处：《计算机应用》2007年第4期791-794,797,共5页journal of Computer Applications

摘　　要：对等网络的普遍应用带来了网络拥塞。从对等网络的拓扑属性研究网络拥塞,首先分析真实的Gnutella网络的流量,确定节点介数与网络拥塞之间存在关系。接着根据排队论模型从理论上给出了导致网络拥塞的临界负载与网络拓扑属性介数的公式解。最后设计拥塞控制策略,通过增加具有大介数节点的容量和这些节点间连接的方法来减轻网络拥塞。The wide use of Peer-to-Peer networks causes network congestion. Different from traditional research methods of network congestion, the topology of Peer-to-Peer networks was analyzed to understand network congestion. First, real traffic of GnuteUa network was studied, and that the relationship between node＇s betweenness and the network congestion was found. A closed-form solution for network critical load was got by using queuing theory as the theoretical model. Finally, several schemes for relieving network congestion by augmenting the capacity of nodes with large betweenness and by adding assortative connections between those nodes were also proposed.

关 键 词：对等网络 拓扑 网络拥塞 

分 类 号：TP393.02[自动化与计算机技术—计算机应用技术]