Name
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. |
Year | DOI | Venue |
|---|---|---|
2012 | 10.1109/PDCAT.2012.49 | PDCAT |
Keywords | Field | DocType |
topology,peer-to-peer data sharing,network routing,topology-aware lookup mechanism,space complexity,topology-aware lookup,p2p,network delay,lookup solution,p2p data sharing,conventional chord method,telecommunication network topology,counting bloom filter,conventional chord,p2p network,data retrieval,data storage,bloom filter,peer-to-peer computing,telecommunication network routing,chord,improved chord,chord topology,improved chord scheme | Bloom filter,Logical topology,Topology,Network delay,Computer data storage,Computer science,Data retrieval,Network topology,Chord (music),Speedup,Distributed computing | Conference |
ISBN | Citations | PageRank |
978-0-7695-4879-1 | 0 | 0.34 |
References | Authors | |
7 | 5 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Limin Zhao | 1 | 0 | 0.68 |
| Jun Wu | 2 | 125 | 15.66 |
| Hong Shen | 3 | 499 | 52.98 |
| Yidong Li | 4 | 151 | 43.42 |
| Yingpeng Sang | 5 | 21 | 9.05 |