Skip to main content
SpringerLink
Log in

PLATON: Peer-to-Peer load adjusting tree overlay networks

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

Abstract

Peer-to-Peer systems supporting multi attribute and range queries use a number of techniques to partition the multi dimensional data space among participating peers. Load-balancing of data accross peer partitions is necessary in order to avoid the presence of network hotspots which may cause performance degradation or failures within the distributed environment. In this paper, we introduce a novel framework, PLATON, that preserves load balancing accross peer partitions when the multi-dimensional data space is dynamic, without requiring up-to-date global load information, e.g. information about the most loaded or least loaded peers in the network. A theoretical analysis on the upper bounds (ie. worst case) of the proposed algorithm is presented; its performance is evaluated in large-scale simulated networks and validated within in the PlanetLab emulation platform.

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

Similar content being viewed by others

Notes

  1. Selected old points maybe also be removed by a peer.

  2. Since the query cost is logarithmic to the number of peers, the network cost in terms of average time taken to deliver all the load-balancing network messages is \({N/log(N) * \mbox{average}}\) \({\mbox {query time}}\).

References

  1. Basu S, Costa L, Brasileiro F, Banerjee S, Sharma P, Lee SJ (2009) Fault-tolerant grid information service. In: Peer-to-Peer networking and applications journal, vol 2, no 4. Springer, pp 348–366

  2. Zhang C, Krishnamurthy A, Wang RY (2005) Brushwood: distributed trees in Peer-to-Peer systems. In: Proceedings of the 4th International Workshop of Peer-to-Peer Systems (IPTPS’05), Ithaca, NY, 24–25 February 2005

  3. Bentley JL (1975) Multidimensional binary search trees used for associative searching. Commun ACM 18(9):509–517

    Article  MathSciNet  MATH  Google Scholar 

  4. Zhang C, Krishnamurthy A, Wang RY (2004) SkipIndex: towards a scalable Peer-to-Peer index service for high dimensional data. Technical Report TR-703-04, Princeton University CS

  5. Ganesan P, Yang B, Garcia-Molina H (2004) One torus to rule them all. Multidimensional queries in P2P systems. In: Proceedings of the 7th international workshop on the Web and Databases (WebDB ‘04). Paris, France, pp 19–24

  6. Aspnes J, Shah G (2007) Skip graphs. ACM Transactions on Algorithms. PLATON 3(4):37

    MathSciNet  Google Scholar 

  7. Pugh W (1989) Skip lists: a probabilistic alternative to balanced trees. In: Proceedings of workshop on algorithms and data structures, pp 437–449

  8. Stoica I, Morris R, Liben-Nowell D, Karger DR, Kaashoek MF, Dabek F, Balakrishnan H (2003) Chord: a scalable peer-to-peer lookup protocol for Internet applications. IEEE/ACM Trans Netw 11(1):17–32

    Article  Google Scholar 

  9. Cormen TH, Leiserson CE, Rivest RL, Stein C (2001) Introduction to algorithms, 2nd edn. MIT Press and McGraw-Hill, pp 73–90. ISBN 0-262-03293-7. Sections 4.3 (The master method) and 4.4 (Proof of the master theorem).

  10. Ganesan P, Bawa M, Garcia-Molina H (2004) Online balancing of range-partitioned data with applications to peer-to-peer systems. In: Proceedings of VLDB ’04: 30th international conference on Very Large Data Bases. Toronto, Canada, pp 444–455

  11. Zipf GK (1949) Human behaviour and the principle of least effort. Addison-Wesley, Reading, Massachusetts

    Google Scholar 

  12. Risson JJ, Moors T (2006) Survey of research towards robust Peer-to-Peer networks: search methods. Comput Networks 50(17):5

    Article  Google Scholar 

  13. Ratnasamy S, Francis P, Handley M, Karp RM, Shenker S (2001) A scalable content-addressable network. In: Proceedings of ACM SIGCOMM 2001 conferenece. on applications, technologies, architectures, and protocols for computer communication. San Diego, CA, pp 161–172

  14. Cai M, Frank M, Chen J, Szekely P (2003) MAAN: a multi-attribute addressable network for grid information services. In: Proceedings of the 4th international workshop on grid computing, pp 184–191

  15. Bharambe AR, Agrawal M, Seshan S (2004) Mercury: supporting scalable multi-attribute range queries. SIGCOMM Comput Commun Rev 34:4

    Article  Google Scholar 

  16. Jagadish HV, Ooi BC, Vu QH (2005) BATON: a balanced tree structure for Peer-to-Peer networks. In: Proceedings of the 31st international conference on very large data bases. Trondheim, Norway, pp 661–672

  17. Rao A, Lakshminarayanan K, Surana S, Karp R, Stoica I (2003) Load-balancing in structured P2P systems. In: Proceedings IPTPS

  18. Aberer K (2002) Scalable data access in P2P systems using unbalanced search trees. In: Proceedings of Workshop on Distributed Data and Structures (WDAS)

  19. Aberer K, Datta A, Hauswirth M (2003) The quest for balancing peer load in structured Peer-to-Peer systems. Technical Report IC/2003/32, EPFL, Switzerland

  20. Karger DR, Ruhl M (2004) Simple efficient load-balancing Algorithms for Peer-to-Peer systems. In: Proceedings of ACM symposium on parallelism in algorithms and architectures

  21. PlanetLab: an open platform for developing, deploying, and accessing planetary-scale services. http://www.planet-lab.org

  22. Yoid PF (2000) extending the internet multicast architecture. Unrefereed report, 2 April 2000. Available from http://www.icir.org/yoid/docs

  23. Li M, Qi M (2009) Facilitating resource discovery in grid environments with Peer-to-Peer structured tuple spaces. In: Peer-to-Peer networking and applications journal, vol 2, no 4. Springer, pp 283–297

  24. Ranjan R, Harwood A, Buyya R (2008) Peer-to-Peer based resource discovery in global grids: a tutorial. IEEE Communications Surveys & Tutorials

Download references

Author information

Authors and Affiliations

  1. National Technical University of Athens, Heroon Polytenxeiou 9, 15773, Athens, Greece

    Leonidas Lymberopoulos, Maria Grammatikou, Symeon Papavassiliou & Vasilis Maglaris

  2. University of Amsterdam (UvA), Spui 21, 1012, WX Amsterdam, The Netherlands

    Chariklis Pittaras

Authors
  1. Leonidas Lymberopoulos
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Chariklis Pittaras
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Maria Grammatikou
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Symeon Papavassiliou
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Vasilis Maglaris
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Leonidas Lymberopoulos.

Additional information

The work done by Chariklis was carried out while he was final year student at NTUA.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Lymberopoulos, L., Pittaras, C., Grammatikou, M. et al. PLATON: Peer-to-Peer load adjusting tree overlay networks. Peer-to-Peer Netw. Appl. 5, 125–142 (2012). https://doi.org/10.1007/s12083-011-0114-6

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s12083-011-0114-6

Keywords

Search

Navigation