论文部分内容阅读
摘要 Chord模型的路由表实际上是把整个空间不断地二等分,路由表项过于稀疏,这样使P2P系统存在高延迟、低效率的问题。针对该问题,对Chord的路由表进行改进,增加路由表中指针的密度,提出路由算法LChord。模拟实验结果表明,该算法在路径长度、访问延迟方面的性能较Chord有一定的提高。
关键词 对等网络;Chord;路由表;指针
中图分类号:TP312 文献标识码:B 文章编号:1671-489X(2010)33-0102-02
Improvement in Chord Routing Table//Jia Cuijing, Wang Dongbo
Abstract The whole space in chord is divided into two parts continuously, routing table is too sparse, so leads to high latency and low efficiency. This paper improve routing table, presents LChord algorithm. Experimental results show that this method is superior to original Chord at path length and access latency.
Key words P2P network; Chord; routing table; finger
Author’s address
1 Computer Science and Technology Department of Information Science
关键词 对等网络;Chord;路由表;指针
中图分类号:TP312 文献标识码:B 文章编号:1671-489X(2010)33-0102-02
Improvement in Chord Routing Table//Jia Cuijing, Wang Dongbo
Abstract The whole space in chord is divided into two parts continuously, routing table is too sparse, so leads to high latency and low efficiency. This paper improve routing table, presents LChord algorithm. Experimental results show that this method is superior to original Chord at path length and access latency.
Key words P2P network; Chord; routing table; finger
Author’s address
1 Computer Science and Technology Department of Information Science