一种结构化P2P网络拓扑匹配的通用算法①.PDFVIP

2012 年 第 2 1 卷 第 4 期 计 算 机 系 统 应 用 ① 一种结构化P2P 网络拓扑匹配的通用算法 1 1,2 殷苗苗 , 陈世平 1(上海理工大学 光电信息与计算机工程学院，上海 200090) 2(上海理工大学 信息化办公室，上海 200090) 摘 要：与非结构化 P2P 网络相比,结构化 P2P 网络具有良好的可扩展性、鲁棒性。但是结构化 P2P 覆盖网络是 直接建立在逻辑网络之上，没有过多地考虑底层物理网络拓扑结构, 导致逻辑拓扑结构与物理拓扑结构严重不匹 配。本文提出一种新的协议无关的拓扑匹配算法，将现有的界标节点、自适应匹配算法与IP 分配策略相结合构 建初始拓扑结构，优化节点交换算法来维护拓扑结构。模拟实验表明，本算法提高了网络的拓扑匹配度，具有 更低的通信开销。 关键词：结构化对等网络；覆盖网络；拓扑结构；时间延迟；节点交换 Generic Topology Matching Method Based on Structured P2P Network 1 1,2 YIN Miao-Miao , CHEN Shi-Ping 1(School of Optical-Electrical Computer Engineering, University of Shanghai for Science Technology,Shanghai 200093,China) 2(Office of Information,University of Shanghai for Science Technology,Shanghai 200093,China) Abstract ：Compared with the unstructured P2P networks, structured P2P networks have good expansibility and robustness. But structured P2P overlay network is directly based on logic network, not too much above the underlying physical network topology structure, which causes a serious topology mismatching between logical topology structure and physical topology structure. About the question，this paper proposed a protocol-independent topology matching method，by combining the existing beacons node, adaptive matching algorithm with IP distribution strategy to construct the initial topological structure, and by optimizing node switching to maintenance the network topology. Simulation experiments show that the algorithm improve the matching degree of the network topology, and meanwhile with lower traffic cost. Key words ：web information extraction; knowledge presentation; data intensive web pages; ontology-based keyword library [1] P2P 是未来网络的关键技术 ，当前对于 P2P 技