DocumentCode :
2144700
Title :
An Enhanced P4P-Based Pastry Routing Algorithm for P2P Network
Author :
Guo, Zhengwei ; Min, Lin ; Yang, Shuai ; Yang, Huaipo
Author_Institution :
Coll. of Comput. & Informotion Eng., Henan Univ., Kaifeng, China
fYear :
2010
fDate :
14-16 Aug. 2010
Firstpage :
687
Lastpage :
691
Abstract :
Aiming at the current structured P2P system´s locality of physical location and accessing resources, in the context of P4P technology, this paper takes the Pastry and P4P-Pastry algorithms as foundation, proposes a enhanced P4P routing algorithm, in which peers performed clustering to the same resources and the proximity of physical location of nodes. When routing, the node routes to the nodes which are physical adjacent to it and have the lowest cost of communication. Theory analysis and the experimental results show that the algorithm proposed in this paper has realized localization download and greatly raised the data transfer rate, reduced the load in backbone network and enhanced the network performance.
Keywords :
peer-to-peer computing; telecommunication network routing; P2P systems locality; backbone network load reduction; data transfer rate; enhanced P4P based pastry routing algorithm; localization download; network performance enhancement; Algorithm design and analysis; Clustering algorithms; Delay; Peer to peer computing; Process control; Routing; Traffic control; P4P; Pastry; clustering; communication costs;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Granular Computing (GrC), 2010 IEEE International Conference on
Conference_Location :
San Jose, CA
Print_ISBN :
978-1-4244-7964-1
Type :
conf
DOI :
10.1109/GrC.2010.111
Filename :
5576039
Link To Document :
بازگشت