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

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.

[1]  Hector Garcia-Molina,et al.  Online Balancing of Range-Partitioned Data with Applications to Peer-to-Peer Systems , 2004, VLDB.

[2]  Karl Aberer,et al.  The Quest for Balancing Peer Load in Structured Peer-to-Peer Systems , 2003 .

[3]  Sujata Banerjee,et al.  NodeWiz: Fault-tolerant grid information service , 2009, Peer-to-Peer Netw. Appl..

[4]  David R. Karger,et al.  Simple Efficient Load-Balancing Algorithms for Peer-to-Peer Systems , 2004, SPAA '04.

[5]  Karl Aberer,et al.  Improving Data Access in P2P Systems , 2002, IEEE Internet Comput..

[6]  Rajkumar Buyya,et al.  Peer-to-peer-based resource discovery in global grids: a tutorial , 2008, IEEE Communications Surveys & Tutorials.

[7]  Jon Louis Bentley,et al.  Multidimensional binary search trees used for associative searching , 1975, CACM.

[8]  Tim Moors,et al.  Survey of Research towards Robust Peer-to-Peer Networks: Search Methods , 2007, RFC.

[9]  Chi Zhang,et al.  Brushwood: Distributed Trees in Peer-to-Peer Systems , 2005, IPTPS.

[10]  Richard M. Karp,et al.  Load Balancing in Structured P2P Systems , 2003, IPTPS.

[11]  Beng Chin Ooi,et al.  BATON: A Balanced Tree Structure for Peer-to-Peer Networks , 2005, VLDB.

[12]  Srinivasan Seshan,et al.  Mercury: supporting scalable multi-attribute range queries , 2004, SIGCOMM 2004.

[13]  William Pugh,et al.  Skip Lists: A Probabilistic Alternative to Balanced Trees , 1989, WADS.

[14]  David R. Karger,et al.  Chord: a scalable peer-to-peer lookup protocol for internet applications , 2003, TNET.

[15]  Min Cai,et al.  MAAN: A Multi-Attribute Addressable Network for Grid Information Services , 2003, Journal of Grid Computing.

[16]  Ronald L. Rivest,et al.  Introduction to Algorithms , 1990 .

[17]  Mark Handley,et al.  A scalable content-addressable network , 2001, SIGCOMM 2001.

[18]  George Kingsley Zipf,et al.  Human behavior and the principle of least effort , 1949 .

[19]  James Aspnes,et al.  Skip graphs , 2003, SODA '03.

[20]  Hector Garcia-Molina,et al.  One torus to rule them all: multi-dimensional queries in P2P systems , 2004, WebDB '04.

[21]  Maozhen Li,et al.  Facilitating resource discovery in grid environments with peer-to-peer structured tuple spaces , 2009, Peer Peer Netw. Appl..

[22]  Karl Aberer.  Scalable Data Access in Peer-to-Peer Systems Using Unbalanced Search Trees , 2002, WDAS.