Peer-to-Peer Networking and Applications

, Volume 5, Issue 2, pp 125–142

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

  • Leonidas Lymberopoulos
  • Chariklis Pittaras
  • Maria Grammatikou
  • Symeon Papavassiliou
  • Vasilis Maglaris
Article

DOI: 10.1007/s12083-011-0114-6

Cite this article as:
Lymberopoulos, L., Pittaras, C., Grammatikou, M. et al. Peer-to-Peer Netw. Appl. (2012) 5: 125. doi:10.1007/s12083-011-0114-6

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.

Keywords

Load balancing Peer-to-Peer Skip graphs K-D trees PlanetLab 

Copyright information

© Springer Science + Business Media, LLC 2011

Authors and Affiliations

  • Leonidas Lymberopoulos
    • 1
  • Chariklis Pittaras
    • 2
  • Maria Grammatikou
    • 1
  • Symeon Papavassiliou
    • 1
  • Vasilis Maglaris
    • 1
  1. 1.National Technical University of AthensAthensGreece
  2. 2.University of Amsterdam (UvA)WX AmsterdamThe Netherlands

Personalised recommendations