Abstract
To enable efficient and appropriate uses of the resources in web, it is important to provide range query to keep track of the availability and attributes of millions of service which are geographically distributed. Range query in P2P face a performance tradeoff problem between the efficiency of query and number of message: Optimizing one tends to put pressure on the others. In this paper, a range query algorithm had proposed which lookup for every node in range can be done via O(logN) hops, and number of messages is trend to O(logN)+m-1. We evaluate our system in this paper via a simulation and show that its design along with particular Range-query algorithm meets the goals of efficient query and low message load.
Supported by the National Basic Research Program of under Grant Nos. 2005cb231804.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Xu, J., Kumar, A., Yu, X.: On the Fundamental Tradeoffs between Routing Table Size and Network Diameter In peer-to-peer Networks. IEEE Journal on Selected Areas in Communications (JSAC)Â 22(1) (January 2004)
Li, D., Lu, X., et al.: Topology and Resource Discovery in Peer-to-Peer Overlay Networks. In: Jin, H., Pan, Y., Xiao, N., Sun, J. (eds.) GCC 2004. LNCS, vol. 3252, Springer, Heidelberg (2004)
Bharambe, A.R., Agrawal, M., Seshan, S.: Mercur: Supporting Scalable Multi-attribute Range Queries. In: Proc. of SIGCOMM 2004, Portland, Oregon, USA (2004)
Oppenheimer, D., Albrecht, J., Patterson, D., Vahdat, A.: Distributed Resource Discovery on Planetlab with SWORD. In: Proc. of the First Workshop on Real Large Distributed Systems (WORLDS 2004), December 2004, Santa Fe, New Mexico, USA (2004)
Cai, M., Frank, M., Chen, J., Szekely, P.: MAAN: A Multi-attribute Addressable Network for Grid Information Services. In: Proc. of the 4th International Workshop on Grid Computing (Grid’2003), Phoenix, AZ, USA (2003)
Crainiceanu, A., Linga, P., Gehrke, J., Shanmugasundaram, J.: PTree: A P2P Index for Resource Discovery Applications. In: Proc. of WWW2004, May 2004, New York, USA (2004)
Nazerzadeh, H., Ghodsi, M.: RAQ: A Range-Queriable Distributed Data Structure. In: Vojtáš, P., Bieliková, M., Charron-Bost, B., Sýkora, O. (eds.) SOFSEM 2005. LNCS, vol. 3381, pp. 269–277. Springer, Heidelberg (2005)
Milgram, S.: The small world problem. Psychology Today 1, 61 (1967)
Chawathe, Y., Ramabhadran, S., Ratnasamy, S., LaMarcay, A., Shenker, S., Hellersteinz, J.: A Case Study in Building Layered DHT Applications. In: Proc. of SIGCOMM 2005, August 2005, Philadelphia, Pennsylvania, USA (2005)
Andrzejak, A., Xu, Z.: Scalable, Efficient Range Queries for Grid Information Services. In: Proc. of the Second IEEE International Conference on Peer-to-Peer Computing (P2P’2002), September 2002, Linköping, Sweden (2002)
ShuiChao, et al.: Cactus: a new constant-degree and fault tolerate P2P overlay. In: The ninth Pacific Rim Internatianal workshop on Multi-Agents, Guilin, China (2006)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chao, S., Pen, Z., JiaYan, Bing, Z. (2006). The Efficient and Low Load Range Queries in P2P. In: Shi, ZZ., Sadananda, R. (eds) Agent Computing and Multi-Agent Systems. PRIMA 2006. Lecture Notes in Computer Science(), vol 4088. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11802372_59
Download citation
DOI: https://doi.org/10.1007/11802372_59
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-36707-9
Online ISBN: 978-3-540-36860-1
eBook Packages: Computer ScienceComputer Science (R0)