An improved chord based on counting bloom filter and topology-aware lookup

Limin Zhao, Jun Wu, Hong Shen, Yidong Li, Yingpeng Sang

研究成果: Conference contribution同行評審

摘要

Chord is a popular and successful topology for Peer-to-Peer (P2P) data sharing. However, the conventional chord is challenged by two main drawbacks. First, it fails to consider the physical topology of the P2P network for designing the lookup solution, which may bring tremendous delay to network routing. Second, its performance of is usually limited by the high space complexity of data storage and thus data retrieval may suffer further network delay. In this work, we propose an improved chord based on Counting Bloom Filter and topology aware lookup to address the drawbacks. We first apply counting Bloom filter for data storage to reduce the space complexity. We then develop a topology-aware lookup mechanism to further speed up the search for local resources. Simulation results show that our improved chord scheme is significantly more efficient than the conventional chord method.

原文English
主出版物標題Proceedings - 13th International Conference on Parallel and Distributed Computing, Applications, and Technologies, PDCAT 2012
頁面703-706
頁數4
DOIs
出版狀態Published - 2012
對外發佈
事件13th International Conference on Parallel and Distributed Computing, Applications, and Technologies, PDCAT 2012 - Beijing, China
持續時間: 14 12月 201216 12月 2012

出版系列

名字Parallel and Distributed Computing, Applications and Technologies, PDCAT Proceedings

Conference

Conference13th International Conference on Parallel and Distributed Computing, Applications, and Technologies, PDCAT 2012
國家/地區China
城市Beijing
期間14/12/1216/12/12

指紋

深入研究「An improved chord based on counting bloom filter and topology-aware lookup」主題。共同形成了獨特的指紋。

引用此