Scalable Computing and Communications; International Conference on Embedded Computing, International Conference on (2009)
Sept. 25, 2009 to Sept. 27, 2009
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.
structured P2P network, DHT, range query
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