DocumentCode :
507492
Title :
Building a Low-latency, Proximity-aware DHT-Based P2P Network
Author :
Ngoc Ben Dang ; Vu, Son Tung ; Nguyen, Hoai Son
Author_Institution :
Coll. of Technol., Dept. of Comput. Network, Vietnam Nat. Univ., Hanoi, Hanoi, Vietnam
fYear :
2009
fDate :
13-17 Oct. 2009
Firstpage :
195
Lastpage :
200
Abstract :
DHT-based P2P networks have a problem of topology mismatch which causes high latency for message routing. This paper focuses on improving the latency of routing process for chord, which is a typical DHT-based P2P network protocol. We propose a simple method to build a chord network based on the proximity of nodes in the underlying physical network. The idea of our method is the combination of two techniques: identifier selection in node joining phase and neighbor selection in network stabilization phase, both are performed based on physical network latency. We have evaluated our proposed solution by simulations. In a simulation network with 4096 nodes, the average latency of routing process in our method can reduces 30% comparing with the conventional chord routing method.
Keywords :
file organisation; peer-to-peer computing; protocols; telecommunication network topology; P2P network protocol; chord network; message routing; neighbor selection; network stabilization phase; node joining phase; physical network latency; proximity-aware distributed hashing table; topology mismatch; Computer networks; Delay; Educational institutions; IP networks; Knowledge engineering; Modeling; Network topology; Peer to peer computing; Routing protocols; Systems engineering and theory; Chord; DHT; low latency; proximity-aware;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Knowledge and Systems Engineering, 2009. KSE '09. International Conference on
Conference_Location :
Hanoi
Print_ISBN :
978-1-4244-5086-2
Electronic_ISBN :
978-0-7695-3846-4
Type :
conf
DOI :
10.1109/KSE.2009.49
Filename :
5361708
Link To Document :
بازگشت