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

Lymberopoulos, L; Pittaras, C; Grammatikou, M; Papavassiliou, S; Maglaris, V

dc.contributor.author	Lymberopoulos, L	en
dc.contributor.author	Pittaras, C	en
dc.contributor.author	Grammatikou, M	en
dc.contributor.author	Papavassiliou, S	en
dc.contributor.author	Maglaris, V	en
dc.date.accessioned	2014-03-01T02:12:02Z
dc.date.available	2014-03-01T02:12:02Z
dc.date.issued	2012	en
dc.identifier.issn	19366442	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/29986
dc.subject	K-D trees	en
dc.subject	Load balancing	en
dc.subject	Peer-to-Peer	en
dc.subject	PlanetLab	en
dc.subject	Skip graphs	en
dc.subject.other	K-d tree	en
dc.subject.other	Load-Balancing	en
dc.subject.other	Peer to peer	en
dc.subject.other	PlanetLab	en
dc.subject.other	Skip-graphs	en
dc.subject.other	Algorithms	en
dc.subject.other	Forestry	en
dc.subject.other	Network management	en
dc.subject.other	Overlay networks	en
dc.subject.other	Parallel architectures	en
dc.subject.other	Peer to peer networks	en
dc.subject.other	Algorithms	en
dc.subject.other	Forestry	en
dc.subject.other	Management	en
dc.subject.other	Networks	en
dc.title	PLATON: Peer-to-Peer load adjusting tree overlay networks	en
heal.type	journalArticle	en
heal.identifier.primary	10.1007/s12083-011-0114-6	en
heal.identifier.secondary	http://dx.doi.org/10.1007/s12083-011-0114-6	en
heal.publicationDate	2012	en
heal.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. © 2011 Springer Science + Business Media, LLC.	en
heal.journalName	Peer-to-Peer Networking and Applications	en
dc.identifier.doi	10.1007/s12083-011-0114-6	en
dc.identifier.volume	5	en
dc.identifier.issue	2	en
dc.identifier.spage	125	en
dc.identifier.epage	142	en