摘要
提出了一种基于局部性的分布式哈希表资源定位技术,将非结构化对等网络引入Chord中,充分利用节点在物理网络上的邻近性和节点间兴趣的局部性。模拟测试表明,该技术在路径长度和访问延迟方面的性能优于原Chord。
A core problem in large-scale Internet peer-to-peer application systems is the efficient location of the node that stores desired resource. A DHT resource location method using interest-based locality was presented. This method introduced unstructured P2P to Chord, making the best use of the proximity of peers in underlying physical network and the locality of the interest among peers. Simulation tests show that this method is superior to original Chord at path length and access latency.
出处
《计算机应用》
CSCD
北大核心
2006年第3期531-533,546,共4页
journal of Computer Applications
基金
国家自然科学基金资助项目(60273041)
关键词
资源定位
分布式哈希表
CHORD
兴趣局部性
resource location
DHT(Distributed Hash Table)
Chord
interest-based locality