By Topic

Analysis of a Self-Organizing Maintenance Algorithm under Constant Churn

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Price, R. ; Sch. of Comput. Sci., Univ. of Birmingham, Birmingham ; Tien Tuan Anh Dinh ; Theodoropoulos, G.

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.

Published in:

Applications and the Internet, 2008. SAINT 2008. International Symposium on

Date of Conference:

July 28 2008-Aug. 1 2008