Title :
Empowering Chord DHT overlays
Author :
Ktari, Salma ; Hecker, Artur ; Labiod, Houda
Author_Institution :
Telecom ParisTech, Paris, France
Abstract :
In peer to peer networks, the overlay topology connecting peers is an important component in addition to peer and data organization and search. In fact, topological characteristics have an important impact on the efficiency of search on such networks. In this paper, we address this issue for Chord based P2P systems. Based on the Barabasi Albert (BA) model, we propose to extend the topology of Chord to a scale free graph DHT, named PL-Chord, to provide a non hierarchical super-peer based lookup algorithm with an efficient search support. Through several simulation experiments, we found that PL-DHT could construct an overlay network that extends the search region and provides higher reachability at a very little additional cost.
Keywords :
complex networks; graph theory; network theory (graphs); peer-to-peer computing; search problems; telecommunication network topology; Barabasi Albert model; chord DHT overlay topology; lookup algorithm; peer-to-peer network; scale free graph; search region; Costs; Delay; Fingers; Floods; Internet; Joining processes; Peer to peer computing; Resilience; Routing; Telecommunication network topology; DHT; flooding; key based routing; power law degree; scale free graph;
Conference_Titel :
High Performance Switching and Routing, 2009. HPSR 2009. International Conference on
Conference_Location :
Paris
Print_ISBN :
978-1-4244-5174-6
Electronic_ISBN :
978-1-4244-5174-6
DOI :
10.1109/HPSR.2009.5307418