DocumentCode
463120
Title
Locality-Aware Peer-to-Peer Networks
Author
Wang, Chun-Hsin ; Ciou, Jyun-Cheng
Author_Institution
Dept. of Comput. Sci. & Inf. Eng., Chung Hua Univ., Hsinchu
Volume
2
fYear
2007
fDate
12-14 Feb. 2007
Firstpage
1462
Lastpage
1466
Abstract
The searching process in P2P system based on distributed hashing tables (DHT) can be guaranteed to deliver the query message within Q(logN) hops. It is worth noting that there may be many nodes which own the required resource in searching results. Which node will be the best candidate to download the requested resource? In this paper, we investigate how to improve the performance of downloading process for P2P system in IPV6 networks. The nodes in P2P system are classified into logical clusters by the assistance of anycast protocol defined in IPV6 networks. The nodes in a cluster will be assigned the same local code to define their locality. Our proposed method can cooperate with DHT-based P2P system without destroying the advantages provided by DHT functions. The searching results of query a resource will include the local codes of nodes which owns the required resource. The good node can be selected from the searching results by their associated local codes. Extended simulation results show that the proposed P2P system has better performance.
Keywords
IP networks; file organisation; peer-to-peer computing; protocols; IPV6 networks; P2P system; anycast protocol; distributed hashing tables; locality-aware peer-to-peer networks; query message; Computational modeling; Computer science; Delay; File servers; Grid computing; IP networks; Network topology; Peer to peer computing; Protocols; Scalability; DHT; IPV6; P2P; anycast; overlay networks;
fLanguage
English
Publisher
ieee
Conference_Titel
Advanced Communication Technology, The 9th International Conference on
Conference_Location
Gangwon-Do
ISSN
1738-9445
Print_ISBN
978-89-5519-131-8
Type
conf
DOI
10.1109/ICACT.2007.358631
Filename
4195432
Link To Document