Survive under high churn in structured p2p systems: evaluation and strategy (2006)
| Venue: | in Proceedings of ICCS 2006 |
| Citations: | 1 - 0 self |
BibTeX
@INPROCEEDINGS{Liu06surviveunder,
author = {Zhiyu Liu and Ruifeng Yuan and Zhenhua Li and Hongxing Li and Guihai Chen},
title = {Survive under high churn in structured p2p systems: evaluation and strategy},
booktitle = {in Proceedings of ICCS 2006},
year = {2006}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Abstract. In Peer to Peer (P2P) systems, peers can join and leave the network whenever they want. Such “freedom ” causes unpredictable network environment which leads to the most complex design challenge of a p2p protocol: how to make p2p service available under churn? What is more, where is the extreme of a system’s resistibility to high churn? A careful evaluation of some typical peer-to-peer networks will contribute a lot to choosing, using and designing a certain kind of protocol in special applications. In this paper we analyze the performance of Chord [1], Tapestry [2], Kelips [3], Kademlia [4] and Koorde [5], then find out the crash point [6] of each network based on the simulation experiment. Finally, we propose a novel way to help nodes survive under high churn.
