DocumentCode :
2569635
Title :
A Clustering Route Algorithm of P2P Networks based on Knödel Graph
Author :
Qiong, Sri Chang ; Wang Da Wei ; Hui, Huang ; Yuanyuan, Huang
Author_Institution :
Inst. of Comput. & Commun. Eng., Changsha Univ. of Sci. & Technol., Changsha, China
fYear :
2009
fDate :
15-17 May 2009
Firstpage :
837
Lastpage :
840
Abstract :
A new clustering route algorithm of p2p networks based on knodel graph is proposed in this paper. According to the primary method, our algorithm added physical clustering in ordering to create relation between node´s physical position and logical id number can improve the route efficiency of the whole knodel p2p network.
Keywords :
graph theory; peer-to-peer computing; telecommunication network routing; clustering route algorithm; knodel graph; p2p networks; Clustering algorithms; Computer network management; Computer networks; Distributed computing; Internet; Network topology; RNA; Routing; Signal processing algorithms; Wide area networks;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
2009 International Conference on Signal Processing Systems
Conference_Location :
Singapore
Print_ISBN :
978-0-7695-3654-5
Type :
conf
DOI :
10.1109/ICSPS.2009.196
Filename :
5166907
Link To Document :
بازگشت