Analysis of a Self-Organizing Maintenance Algorithm under Constant Churn

An increasing proportion of distributed hash tables (DHTs) maintain additional routing information regarding each node’s immediately surrounding neighbors in 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.

• Type: Conference
• Year: 2008
• Where: SAINT
• Authors: Richard Price, Tien Tuan Anh Dinh, Georgios K. Theodoropoulos
• Keywords: Additional Routing Information, DHT Routing Protocol, Internet Technology, Routing, SAINT 2008