摘 要:
针对结构化P2P系统高异质性和节点频繁加入或离开带来的系统性能问题,基于Chord设计了一个RR—Chord系统.该系统所有节点被分为路由节点和非路由节点.路由节点具有更多的资源和路由信息。并可根据自身能力的强弱调整其路由表的大小,所有的路由节点形成路由环,所有的路由信息在路由环上路由以提高系统的查询效率.设计的新的加入算法,进一步减少了节点频繁加入与离开造成的维护开销.理论分析和实验结果表明,RR—Chord具有较好的路由性能和非常低的维护开销.[著者文摘]
文章出处:
《北京理工大学学报》-2008年28卷2期 -134-138页
栏目信息:
分 类 号:
文献标识码:
A
文章编号:
1001-0645(2008)02-0134-05
RR-Chord: A P2P System Based on Chord with Low Maintenance Cost and Fast Lookup
REN Xiao-jin, GU Zhi-min, GAO Zhi-wei, DUAN Zhao-lei (1. School of Computer Science and Technology, Beijing Institute of Technology, Beijing 100081, China; 2. Network Information Center, Henan University, Kaifeng, Henan 475001, China)
Abstract:
To solve system performance problems caused by extreme heterogeneity and churn in DHT- based P2P system, a new P2P system based on Chord and named RR-Chord is proposed. In RR-Chord all nodes are divided into routing peers and non-routing peers. Routing peers have more sources and more routing information. Routing peers can adjust the size of finger table dynamically. All the routing peers form a routing-ring. All lookup requests are routed on the routing-ring to improve the lookup performance. In addition, to further decrease the maintenance cost caused by chum, a new join algorithm is designed. Theoretical analysis and simulations showed that RR-Chord drastically improves the routing performance and greatly decreases the maintenance overhead.[著者文摘]
Key words:
P2P; chord; lookup

学术















cqvip.com