Skip to Main Content
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.