根据IP地址奇偶性优化P2P对等网的方法  

P2P Optimization Based on the Property of IP Address Parity

作　　者：公鲁男[1] 袁鹏飞[1] 薛建生[1] 刘蕊[1] 

机构地区：[1]辽宁大学信息科学与技术学院,沈阳110036

出　　处：《计算机科学与探索》2009年第6期665-672,共8页Journal of Frontiers of Computer Science and Technology

摘　　要：针对对等网(P2P)中因抽象的覆盖网与底层物理网不匹配而在网络上产生了大量多余的传送开销的问题,提出了一种基于IP地址奇偶性的方案来优化对等网的拓扑结构。该方法根据IP地址的奇偶性将对等网中的结点分成两组完成不同的工作。模拟实验证明了这种方法没有缩减查询范围,同时减小了网络中的传输负载和结点的工作负载,缩短了查询的响应时间,有效地解决了覆盖网与底层物理网拓扑不匹配现象。In order to solve the problem of a volume of redundant traffic incurred by the topology mismatch between abstract overlay and physical network in Peer-to-Peer system, an approach based on the property of IP address parity to optimize the P2P＇s overlay topology is proposed. This approach based on the IP address＇s parity to divide the nodes into two different classes to do different work. The simulations show that this approach reduces the network＇s traffic overload and decreases the node＇s working load without shrinking the search scope, and shrinking the response-time. This approach can efficiently solve the problem of the topology mismatch between the P2P logical overlay network and the physical underlying network.

关 键 词：对等网 拓扑不匹配 查询效果 IP地址奇偶性 

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