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.
Similar content being viewed by others
Notes
Selected old points maybe also be removed by a peer.
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
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
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
Bentley JL (1975) Multidimensional binary search trees used for associative searching. Commun ACM 18(9):509–517
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
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
Aspnes J, Shah G (2007) Skip graphs. ACM Transactions on Algorithms. PLATON 3(4):37
Pugh W (1989) Skip lists: a probabilistic alternative to balanced trees. In: Proceedings of workshop on algorithms and data structures, pp 437–449
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
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).
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
Zipf GK (1949) Human behaviour and the principle of least effort. Addison-Wesley, Reading, Massachusetts
Risson JJ, Moors T (2006) Survey of research towards robust Peer-to-Peer networks: search methods. Comput Networks 50(17):5
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
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
Bharambe AR, Agrawal M, Seshan S (2004) Mercury: supporting scalable multi-attribute range queries. SIGCOMM Comput Commun Rev 34:4
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
Rao A, Lakshminarayanan K, Surana S, Karp R, Stoica I (2003) Load-balancing in structured P2P systems. In: Proceedings IPTPS
Aberer K (2002) Scalable data access in P2P systems using unbalanced search trees. In: Proceedings of Workshop on Distributed Data and Structures (WDAS)
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
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
PlanetLab: an open platform for developing, deploying, and accessing planetary-scale services. http://www.planet-lab.org
Yoid PF (2000) extending the internet multicast architecture. Unrefereed report, 2 April 2000. Available from http://www.icir.org/yoid/docs
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
Ranjan R, Harwood A, Buyya R (2008) Peer-to-Peer based resource discovery in global grids: a tutorial. IEEE Communications Surveys & Tutorials
Author information
Authors and Affiliations
Corresponding author
Additional information
The work done by Chariklis was carried out while he was final year student at NTUA.
Rights 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
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s12083-011-0114-6