摘要
在基于DHT技术的对等网络中,一个重要的研究内容是减少逻辑网络和物理网络不匹配所带来的寻路时延过长的问题.现有的解决方案没有考虑IPv6网络环境下的新特征.基于IPv6体系中地址层次性具有物理网络路由聚集的特点,提出了通过IPv6前缀对节点进行聚集,并利用DHT网络本身定位具有相同IPv6前缀的节点列表信息来实现高效寻路.这种节点聚集策略不依赖集中式服务器,具有完全分布式的特点.利用此策略对Chord和CAN这两种应用广泛的DHT系统进行改造,仿真和分析表明此方案可显著减少寻路延时.
Due to the mismatch between P2P overlay network and physical network, the routing latency is inefficient. Observed that the IPv6 address hierarchical structure can reflect the aggregate of network route entries, we first show the idea that nodes can be clustered together by the same specific prefix length to reduce the routing latency. Also, we use DHT network itself to store and retrieve the IPv6 prefix information. We give out a general protocol that can be used by most of DHT protocols and adopt it to two famous DHT protocol, CAN and Chord. We call the two new adoptions as Chord6 and CAN6. From the simulations, Chord6 and CAN6 can reduce the latency significantly and effectively）.
出处
《小型微型计算机系统》
CSCD
北大核心
2006年第8期1421-1425,共5页
Journal of Chinese Computer Systems
基金
国家自然科学基金项目(60373000)资助
