Abstract
In this paper we propose a Peer-To-Peer (P2P) architecture using a tree based indexing scheme which allows for efficient lookup and range query services on documents in the network. We also present a basic load balancing technique by assigning a new node that joins the network to a heavily loaded area to take on some of load of its peers. Given a query, we need to search only a small number of nodes to locate matching documents hence making the architecture scalable. We also take into account the fact that nodes in a P2P environment need not have the same capability. We implemented a simulator and performed experiments to study to the performance of our proposed architecture. The results show that our proposed architecture is scalable and highly efficient when handling range queries.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Bestpeer, http://xena1.ddns.comp.nus.edu.sg/p2p/
NAPSTER, http://www.napster.com
Wiley, B., Clarke, I., Sandberg, O., Hong, T.W.: Freenet: A distributed anonymous information storage and retrieval system. LNCS (2001)
GNUTELLA, http://gnutella.wego.com
Ooi, B.C., Papadias, D., Kalnis, P., Ng, W.S., Tan, K.L.: An adaptive peer-to-peer network for distributed caching of olap results. In: ACM SIGMOD 2002, Madison, Wisconsin, USA, pp. 25–36 (2002)
JXTA Project Home Page, http://www.jxta.org
Microsft.NET Home Page, http://www.microsoft.com/net
Yang, B., Garcia-Molina, H.: Comparing hybrid peer-to-peer systems. In: Proc. of The Conf. on Very Large Data Bases, VLDB (2001)
Saroiu, S., Gummadi, P.K., Gribble, S.D.: A measurement study of peer-to-peer file sharing systems. Technical Report UW-CSE-01-06-02, Department of Computer Science and Engineering University of Washinton Seattle WA (July 2001)
Kubiatowicz, J., et al.: Oceanstore: An architecture for global-scale persistent storage. In: Proceedings of the Ninth international Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS), Boston, MA (November 2000)
Halevy, A., Ives, Z., Suciu, D., Tatarinov, I.: Schema mediation in peer data management systems. In: Proceedings of the 19th International Conference on Data Engineering, Bangalore, India (March 2003)
Gribble, S., Halevy, A., Ives, Z., Rodrig, M., Suciu, D.: What can databases do for peer-to-peer. In: ACM SIGMOD Workshop on the Web and Databases WebDB (2001)
Dingledine, R., Molnar, D., Freedman, M.J.: The free haven project: Distributed anonymous storage service. In: Proceedings of the Workshop on Design Issues in Anonymity and Unobservability (2000)
Karger, D., Kaashoek, F., Stoica, I., Morris, R., Balakrishnan, H.: Chord: A scalable Peer-To-Peer lookup service for internet applications. In: Proceedings of the 2001 ACM SIGCOMM Conference, pp. 149–160 (2001)
Handley, M., Karp, R., Ratnasamy, S., Francis, P., Shenker, S.: A scalable content addressable network. In: Proceedings of the 2001 ACM SIGCOMM Conference (2001)
Druschel, P., Rowstron, A.: Past: A large-scale, persistent peer-to-peer storage utility. In: Proceedings of the Eighth Workshop on Hot Topics in Operating Systems, HotOS-VIII (2001)
Kubiatowicz, J.D., Zhao, B.Y., Joseph, A.D.: Tapestry: An infrastructure for fault-tolerant wide-area location and routing. Technical report, Technical Report UCB/CSD-01-1141, Computer Science Division, U. C. Berkeley (April 2001)
Andrzejak, A., Zichen, X.: Scalable, efficient range queries for grid information services. Technical report, Technical Report HPL-2002-209, Internet Systems and Storage Laboratory, HP Laboratories Palo Alto (July 2002)
Neimat, M.A., Litwin, W., Schneider, D.: Rp: A family of order-preserving scalable distributed data structures. In: Proc. of The Conf. on Very Large Data Bases, VLDB (1994)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Liau, C.Y., Ng, W.S., Shu, Y., Tan, KL., Bressan, S. (2005). Efficient Range Queries and Fast Lookup Services for Scalable P2P Networks. In: Ng, W.S., Ooi, BC., Ouksel, A.M., Sartori, C. (eds) Databases, Information Systems, and Peer-to-Peer Computing. DBISP2P 2004. Lecture Notes in Computer Science, vol 3367. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-31838-5_7
Download citation
DOI: https://doi.org/10.1007/978-3-540-31838-5_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-25233-7
Online ISBN: 978-3-540-31838-5
eBook Packages: Computer ScienceComputer Science (R0)