DocumentCode :
3176499
Title :
Design and Routing Algorithm of PPCAN
Author :
Gao, Wei ; Zhang, Guoyin ; Li, Yanmei
Author_Institution :
Coll. of Comput. Sci. & Technol., Harbin Eng. Univ., Harbin, China
fYear :
2009
fDate :
21-22 Dec. 2009
Firstpage :
118
Lastpage :
121
Abstract :
By analyzing existed improved DHT networks, we propose a novel improved CAN: PPCAN, which adopt 2-dimensional Polar coordinate and power series expand subspace hops to obtain better routing efficiency and lower maintenance cost. Then, we introduce the Landmarks to optimize the relay sequenced peers through the hops. Our design can be implemented entirely at the application level. Some improved routing algorithms based CAN also can be implemented in PPCAN.
Keywords :
controller area networks; file organisation; network routing; peer-to-peer computing; 2D polar coordinates; DHT networks; PPCAN; distributed hash table; power series expansion subspace; routing algorithm; Algorithm design and analysis; Costs; Delay; Design engineering; Internet; Partitioning algorithms; Peer to peer computing; Physics computing; Relays; Routing; CAN; P2P; routing algorithm;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Internet Computing for Science and Engineering (ICICSE), 2009 Fourth International Conference on
Conference_Location :
Harbin
Print_ISBN :
978-1-4244-6754-9
Type :
conf
DOI :
10.1109/ICICSE.2009.67
Filename :
5521621
Link To Document :
بازگشت