基于Hilbert曲线的拓扑匹配的P2P覆盖网模型  

A Topology-Matching P2P Overlay Network Model Based on Hilbert Curve

作　　者：李永[1,2] 余镇危[2] 

机构地区：[1]盐城师范学院信息科学与技术学院,江苏盐城224002 [2]中国矿业大学(北京)机电与信息工程学院,北京100083

出　　处：《微电子学与计算机》2013年第1期139-142,共4页Microelectronics & Computer

摘　　要：针对P2P网络中由于逻辑网络和物理网络的拓扑结构不匹配导致物理路由效率低下的问题,提出一种新的拓扑匹配的P2P覆盖网模型.首先基于Vivaldi网络坐标系统对网络节点进行聚类,划分成K个聚集,且在每个聚集内选出头节点;然后利用Hilbert空间填充曲线的局部保持特性,把K个聚集的头节点构成环状拓扑结构;最终得到一个拓扑匹配的Hilbert-Ring覆盖网模型.仿真实验表明,该模型具有良好的性能,可以有效地降低网络延迟,减少网络开销.Aiming at the unmatched topology problem between overlay network and physical network which result in inefficient routing,a new topology-matching P2P overlay network model is presented.Firstly,network nodes are clustered into K groups based on the network coordinates system Vivaldi,and selecting a leader node for each group.Then,using the proximity-aware nature of hilbert space filing curve,the K leader nodes are formed into ring topology.Finally a topology-matching Hilbert-Ring overlay network model is obtained.Simulating experiment shows that this model has the good performance,and it is effective in lowering the network delay and decreasing the network load.

关 键 词：覆盖网 HILBERT曲线 拓扑匹配 

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