The Community for Technology Leaders
Scalable Computing and Communications; International Conference on Embedded Computing, International Conference on (2009)
Dalian, China
Sept. 25, 2009 to Sept. 27, 2009
ISBN: 978-0-7695-3825-9
pp: 409-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.
INDEX TERMS
structured P2P network, DHT, range query
CITATION
Xiao-heng Deng, Dao-de He, Yi Liu, "A Range Query Technology for Structured P2P Network", Scalable Computing and Communications; International Conference on Embedded Computing, International Conference on, vol. 00, no. , pp. 409-414, 2009, doi:10.1109/EmbeddedCom-ScalCom.2009.127
89 ms
(Ver 3.3 (11022016))