Analysis of a Self-Organizing Maintenance Algorithm under Constant Churn

Author

Price, Richard ; Dinh, Tien Tuan Anh ; Theodoropoulos, Georgios

Author_Institution

Sch. of Comput. Sci., Univ. of Birmingham, Birmingham

fYear

2008

fDate

July 28 2008-Aug. 1 2008

Firstpage

209

Lastpage

212

Abstract

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.

Keywords

peer-to-peer computing; routing protocols; continuously dynamic network conditions; distributed hash tables; network overlay; network recovery; routing information; routing protocol; self-organizing maintenance algorithm; sequential neighbors; Algorithm design and analysis; Application software; Costs; Frequency estimation; IP networks; Partitioning algorithms; Peer to peer computing; Resilience; Routing; Steady-state; churn; p2p; self-organizing;

fLanguage

English

Publisher

ieee

Conference_Titel

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

Conference_Location

Turku

Print_ISBN

978-0-7695-3297-4

Type

conf

DOI

10.1109/SAINT.2008.65

Filename

4604573