Please use this identifier to cite or link to this item:
|Scopus||Web of Science®||Altmetric|
|Title:||An improved chord based on counting bloom filter and topology-aware lookup|
|Citation:||Proceedings, 13th International Conference on Parallel and Distributed Computing, Applications, and Technologies, PDCAT 2012, 2012 / Shen, H., Sang, Y., Li, Y., Qian, D., Zomaya, A. (ed./s), pp.703-706|
|Conference Name:||13th International Conference on Parallel and Distributed Computing, Applications, and Technologies (PDCAT 2012) (14 Dec 2012 - 16 Dec 2012 : Beijing, China)|
|Limin Zhao, Jun Wu, Hong Shen, Yidong Li, Yingpeng Sang|
|Abstract:||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.|
|Keywords:||P2P; Chord; Counting Bloom Filter; Topology|
|Rights:||© 2012 IEEE|
|Appears in Collections:||Computer Science publications|
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.