Comb:Efficient Two-hop Lookup Service for Distributed Communication System
Communication systems utilize the Distributed Hash Table (DHT) approach to build the network infrastructure for advantages of even distribution of workload,high scalability and cost-effectiveness.Although DHT is undoubtedly applicative in such architectures,some practical distinctions still should be considered to meet the performance requirements of communication infrastructures.This paper focuses in two features of the distributed communication system,socalled the real-time response and geographic partition,proposes a hierarchical DHT lookup service named Comb.Comb’s overlay is organized as a two-layered architecture,workload is distributed evenly among nodes and most queries can be routed in no more than two hops.Comb performs effectively with low bandwidth consumption and satisfactory fault tolerance even in a continuously changing environment.Both theoretical analyses and experimental results demonstrate that the two-layered architecture of Comb is feasible and efficient.Comb improves the performances on routing delay and lookup failure rates with high scalability and availability.
Distributed Communication System Peer-to-Peer Comb DHT Two-Hop
Shuang Kai Zhang Peng Su Sen
State Key Laboratory of Networking & Switching Technology Beijing University of Posts & Telecommunications(BUPT)Beijing, China
国内会议
张家界
英文
55-67
2013-07-01（万方平台首次上网日期，不代表论文的发表时间）