DocumentCode :
2513295
Title :
A Range Query Technology for Structured P2P Network
Author :
Deng, Xiao-heng ; He, Dao-De ; Liu, Yi
Author_Institution :
Coll. of Inf. Sci. & Eng., Central South Univ., Changsha, China
fYear :
2009
fDate :
25-27 Sept. 2009
Firstpage :
409
Lastpage :
414
Abstract :
Accurate searching in current structured P2P network is popular, but range query is very difficult and complex. In this paper, based on the Pastry, we propose a resources allocating mechanism for searching the objects among certain ranges in P2P network, and give the searching algorithm in detail. This mechanism does not need change the original P2P infrastructure, the algorithm is simple and easy to implement, and the simulation results show that the efficiency of searching is very good.
Keywords :
file organisation; peer-to-peer computing; query processing; resource allocation; Pastry system; range query technology; resources allocation mechanism; searching algorithm; structured P2P network; Computer networks; Embedded computing; Information science; Joining processes; Public key; Publishing; Query processing; Resource management; Routing; DHT; range query; structured P2P network;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Scalable Computing and Communications; Eighth International Conference on Embedded Computing, 2009. SCALCOM-EMBEDDEDCOM'09. International Conference on
Conference_Location :
Dalian
Print_ISBN :
978-0-7695-3825-9
Type :
conf
DOI :
10.1109/EmbeddedCom-ScalCom.2009.127
Filename :
5341724
Link To Document :
بازگشت