Skip to main content
SpringerLink
Log in

Dynamic storage and access load balancing for answering range queries in peer-to-peer networks

  • Published:
Peer-to-Peer Networking and Applications Aims and scope Submit manuscript

Abstract

Recently, many applications have used Peer-to-Peer (P2P) systems to overcome the current problems with client/server systems such as non-scalability, high bandwidth requirement and single point of failure. In this paper, we propose an efficient scheme to support efficient range query processing over structured P2P systems, while balancing both the storage load and access load. The paper proposes a rotating token scheme to balance the storage load by placing joining nodes in appropriate locations in the identifier space to share loads with already overloaded nodes. Then, to support range queries, we utilize an order-preserving mapping function to map keys to nodes in order preserving way and without hashing. This may result in an access load imbalance due to non-uniform distribution of keys in the identifier space. Thus, we propose an adaptive replication scheme to relieve overloaded nodes by shedding some load on other nodes to balance the access load. We derive a formula for estimating the overhead of the proposed adaptive replication scheme. In this study, we carry simulation experiments with synthetic data to measure the performance of the proposed schemes. Our simulation experiments show significant gains in both storage load balancing and access load balancing.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13
Fig. 14
Fig. 15
Fig. 16
Fig. 17
Fig. 18
Fig. 19
Fig. 20
Fig. 21
Fig. 22
Fig. 23

Similar content being viewed by others

References

  1. Andrzejak A, Xu Z (2002) Scalable, efficient range queries for Grid Information services. Proceedings of the Second IEEE International Conference on Peer-to-Peer Computing, Sweden

  2. Butt A, Johnson T, Zheng Y, Hu Y (2004) Kosha: A Peer-to-Peer Enhancement for the Network File System. In Proc. of the ACM/IEEE SC 2004: High Performance Computing, Networking and Storage Conference, Pittsburgh, PA

  3. Crainiceanu A, Linga P, Gehrke J, Shanmugasundaram J (2004) Querying Peer-to-Peer Networks Using P-Trees. In Proc. of 7th Intl. Workshop on the Web and Databases, Cornell University, Paris, France

  4. Gupta A, Agrawal D, Abbadi AE (2003) Approximate range selection queries in peer-to-peer systems. In Proc. First Biennial Conference on Innovative Data Systems Research (CIDR)

  5. Gupta A, Dinda P, Bustamante FE (2005) Distributed popularity indices. In: Proceedings of ACM SIGCOMM

  6. Mondal A, Lifu Y, Kitsuregawa M (2004) P2PR-Tree: An R-Tree-Based Spatial Index for Peer-to-Peer Environments. In Extended Database Technology (EDBT) Workshops, pages 516–525

  7. Bharambe AR, Agrawal M, Seshan S (2004) Mercury: Supporting Scalable Multi-Attribute Range Queries. In Proc. of the ACM SIGCOMM Conference

  8. Rao A, Lakshminarayanan K, Surana S, Karp R, Stoica I (2003) Load Balancing in Structured P2P Systems. In Proceedings of the International workshop on Peer-To-Peer Systems

  9. Rowstron A, Druschel P (2001) Pastry: scalable, decentralized object location, and routing for large-scale peer-to-peer systems. Lect Notes Comput Sci 2218:329–350

    Article  Google Scholar 

  10. Karger D, Ruhl M (2004) Simple Efficient Load Balancing Algorithms for Peer-to-Peer Systems. In Proc. of the 16th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)

  11. Tanin E, Harwood A, Samet H (2005) A distributed quadtree index for peer-to-peer settings. In Proceedings of the International Conference on Data Engineering—ICDE. Tokyo, Japan, pp 254–255

  12. FIPS 180-1. Secure Hash Standard. U.S. Department of Commerce/NIST, National Technical Information Service, Springfield, VA, April 1995

  13. Gnutella. http://gnutella.wego.com/

  14. Balakrishnan H, Kaashoek MF, Karger D, Morris R, Stoica I (2003) Looking up data in p2p systems. Communications of the ACM, Vol. 46, No. 2, USA, pp. 43–48

  15. Wang H, Zimmermann R, Ku WS (2005) ASPEN: an adaptive spatial peer-to-peer network, Proceedings of the 13th annual ACM international workshop on Geographic information systems, Bremen, Germany

  16. Jagadish HV, Ooi BC, Vu QH (2005) BATON: A balanced tree structure for peer-to-peer networks. In Proc. of Very Large Databases (VLDB)

  17. Stoica I, Morris R, Karger D, Kaashoek MF, Balakrishnan H (2001) Chord: A Scalable Peer-to-Peer Lookup Service for Internet Applications. In: Proceedings of SIGCOMM

  18. Ardenghi J, Echaiz J (2007) Peer-to-Peer Systems: The Present and the Future. Vol. 7 - No. 3 - Journal of Computer Science & Technology (JCS&T), ISSN 1666-6038, pp. 198–203. La Plata

  19. Aspnes J, Shah G (2003) Skip graphs. In Proc. of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)

  20. Aspnes J, Kirsch J, Krishnamurthy A (2004). Load Balancing and Locality in Range-Queriable Data Structures. In: Proceedings of the 23rd Annual ACM Symposium on Principles of Distributed Computing

  21. KaZaA. http://www.kazaa.com/

  22. Breslau L, Cao P, Fan L, Phillips G, Shenker S (1999) Web cashing and zipf-like distribution: Evidence and implications, In Proc. of IEEE Infocom, vol. XX, no. V, pp. 1–9

  23. Abdallah M, Buyukkaya E (2006) Efficient Routing in Non-Uniform DHTs for Range Query Support In: Proc. of the International Conference on Parallel and Distributed Computing and Systems (PDCS), USA

  24. Abdallah M, Buyukkaya E (2007) Fair Load Balancing Under Skewed Popularity Patterns in Heterogeneous DHT-Based P2P Systems, In Proc. of the International Conference on Parallel and Distributed Computing and Systems (PDCS), Cambridge, Ma, USA

  25. Abdallah M, Le HC (2005) Scalable range query processing for large-scale distributed database applications. In: Proceedings of the IASTED International Conference on Parallel and Distributed Computing and Systems (PDCS), USA

  26. Cai M, Frank M, Chen J, Szekely P (2004) MAAN: a multi-attribute addressable network for grid information services. J Grid Comput 2(1):3–14

    Article  MATH  Google Scholar 

  27. Harvey NJ, Jones M, Saroiu S, Theimer M, Wolman A (2003) Skipnet: a scalable overlay network with practical locality properties. In Proceedings of USITS, Seattle, WA

  28. Napster. http://www.napster.com/

  29. Sahin OD, Gupta A, Agrawal D, Abbadi AE (2004) A peer-to-peer framework for caching range queries. In: Proc. of ICDE

  30. Ganesan P, Yang B, Garcia-Molina H (2004) One torus to rule them all: Multidimensional queries in P2P systems. In: Proceedings of the ACM SIGMOD’04, WebDB Workshop. Paris, France, pp 19–24

  31. Ganesan P, Bawa M, Garcia-Molina H (2004) Online Balancing of Range-Partitioned Data with Applications to Peer-to-Peer Systems. Proc. Very Large Data Bases Conf, pp 444–455

  32. Blanco R, Ahmed N, Hadaller D, Sung LG, Li H (2006) & M.A. Soliman, A survey of Data Management in Peer-to-Peer Systems. Technical Report (CS-2006-18). University of Waterloo

  33. Xiao RY (2008) Survey on anonymity in unstructured peer-to-peer systems. J Comput Sci Technol 23(4):660–671

    Article  Google Scholar 

  34. AL-Kassimi S (2005) Evaluation of a scalable peer-to-peer lookup protocol for internet applications, Master of Science Thesis, Swedish Institute of Computer Science, Stockholm, Sweden

  35. Ramabhadran S, Ratnasamy S, Hellerstein J, Shenker S (2004) Brief announcement: prefix hash tree, In Proc. of Proc. 23rd Annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, PODC, pp. 368–368

  36. Gribble SD, Halevy AY, Ives ZG, Rodrig M, Suciu D (2001) What Can Database Do for Peer-to-Peer? In Proc. of the ACM SIGMOD WebDB workshop

  37. Ratnasamy S, Francis P, Handley M, Karp R, Shenker S (2001) A scalable content-addressable network. In Proceedings of the 2001 conference on applications, technologies, architectures, and protocols for computer communications, pages 161–172. ACM Press

  38. Pitoura T, Ntarmos N, Triantafillou P (2006) Replication, Load Balancing and Efficient Range Query Processing in DHTs, 10th International Conference on Extending Database Technology (EDBT06)

  39. Zhao YB, Kubiatowicz J, Joseph A (2001) Tapestry: An infrastructure for fault-tolerant wide-area location and routing. Technical Report Tech. Rep. UCB/CSD-01-1141, University of California at Berkeley

  40. Datta A, Hauswirth M, John R, Schmidt R, Aberer K (2005) Range Queries in Trie-Structured Overlays. IEEE International Conference on Peer-to-Peer Computing

  41. Liu L, Xu J, Russell D, Townend P, Webster D (2009) Efficient and scalable search on scale-free P2P networks. Springer Peer-to-Peer Networking and Applications Journal, 2(2)

  42. Li M, Qi M (2009) Facilitating resource discovery in grid environment with peer-to-peer structured tuple spaces. Springer Peer-to-Peer Networking and Applications Journal 2(4)

  43. Zhang R, Qian W, Zhou A, Zhou M (2009) An efficient peer-to-peer indexing tree structure for multidimensional data. Elsevier J Future Gener Comput Syst 25(1):77–88

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Sharjah, 27272, Sharjah, UAE

    Zaher Al Aghbari & Ahmed Mustafa

  2. Department of Computer Engineering, University of Sharjah, Sharjah, UAE

    Ibrahim Kamel

Authors
  1. Zaher Al Aghbari
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ibrahim Kamel
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Ahmed Mustafa
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Zaher Al Aghbari.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Al Aghbari, Z., Kamel, I. & Mustafa, A. Dynamic storage and access load balancing for answering range queries in peer-to-peer networks. Peer-to-Peer Netw. Appl. 4, 391–409 (2011). https://doi.org/10.1007/s12083-010-0097-8

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s12083-010-0097-8

Keywords

Search

Navigation