2008 International Symposium on Applications and the Internet Analysis of a Self-Organizing Maintenance Algorithm under Constant Churn July 28-August 01 ISBN: 978-0-7695-3297-4
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/SAINT.2008.65
Distributed hash tables (DHTs) often maintain additional routing information regarding each node's surrounding neighbors within a network overlay. Sequential neighbors play a critical role in network recovery, providing alternative routes thus allowing more flexible and robust routing around a overlay.??This paper details our analysis of a existing DHT routing protocol under continuously dynamic network conditions. In this environment we examine an alternative self-organizing maintenance mechanism and show its increased fault tolerance.
Index Terms:
churn, self-organizing, p2p
Citation:
Richard Price, Tien Tuan Anh Dinh, Georgios Theodoropoulos, "Analysis of a Self-Organizing Maintenance Algorithm under Constant Churn," saint, pp.209-212, 2008 International Symposium on Applications and the Internet, 2008 Usage of this product signifies your acceptance of the Terms of Use. | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||