一种适用于分布式电信系统的高效P2P路由算法
n Efficient Two-hop Lookup Service for Distributed Telcom System
Peer-to-Peer(简称P2P)系统以其负载均衡,高稳定性和高可靠性的优点而得到广泛应用。本文通过分析分布式电信系统的特点:低接续时延要求和地理位置分布,提出一种分布式哈希表(DHT)路由算法Comb。Comb算法提出"域划分"的思想,将整个网络划分为多个"子域",将资源通过一致性哈希映射到节点的ID空间,消息的路由在"域内"和"域间"进行。Comb算法是纯P2P结构化的路由算法,节点与节点的地位点完全平等,不存在单点故障和性能瓶颈,实验结果证明,Comb具有节点负载均衡,路由效率高的优点。
With the advantages of load balance, high scalability and cost-effectiveness, the Peer-to-Peer system has been applied in the network infrastructures of many Internet applications. This paper analysis the features of the distributed telecom system, so-called the real-time response and geographic partition, proposed a two-hop DHT lookup service Comb. Comb is a purely peer-to-peer network routes most lookups in no more than two hops with low bandwidth consumption and satisfactory fault tolerance even in a continuously changing environment. The simulation experiment shows that Comb is feasible P2P algorithm with load balance and high routing efficiency.
张鹏、双锴
通信无线电设备、电信设备无线通信
P2P(peer to peerHT(Distributed Hash Table)路由算法omb路由算法一致性哈希域划分
P2P(peer to peer)DHT(Distributed Hash Table) routing algorithmComb routing algorithmConsistent hashDomain partition
张鹏,双锴.一种适用于分布式电信系统的高效P2P路由算法[EB/OL].(2012-12-14)[2025-08-16].http://www.paper.edu.cn/releasepaper/content/201212-289.点此复制
评论