Fast and cost-effective online load-balancing in distributed range-queriable systems

Konstantinou, I; Tsoumakos, D; Koziris, N

dc.contributor.author	Konstantinou, I	en
dc.contributor.author	Tsoumakos, D	en
dc.contributor.author	Koziris, N	en
dc.date.accessioned	2014-03-01T01:35:44Z
dc.date.available	2014-03-01T01:35:44Z
dc.date.issued	2011	en
dc.identifier.issn	1045-9219	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/21170
dc.subject	load-balancing	en
dc.subject	Peer-to-peer systems	en
dc.subject	range queries	en
dc.subject.classification	Computer Science, Theory & Methods	en
dc.subject.classification	Engineering, Electrical & Electronic	en
dc.subject.other	Distributed systems	en
dc.subject.other	Experimental analysis	en
dc.subject.other	Hybrid method	en
dc.subject.other	Load allocation	en
dc.subject.other	Load-Balancing	en
dc.subject.other	Load-balancing algorithm	en
dc.subject.other	Peer-to-peer overlays	en
dc.subject.other	Peer-to-peer systems	en
dc.subject.other	Range query	en
dc.subject.other	Skip-graphs	en
dc.subject.other	Cost benefit analysis	en
dc.subject.other	Cost effectiveness	en
dc.subject.other	Distributed computer systems	en
dc.subject.other	Online systems	en
dc.subject.other	Peer to peer networks	en
dc.title	Fast and cost-effective online load-balancing in distributed range-queriable systems	en
heal.type	journalArticle	en
heal.identifier.primary	10.1109/TPDS.2010.200	en
heal.identifier.secondary	http://dx.doi.org/10.1109/TPDS.2010.200	en
heal.identifier.secondary	5629336	en
heal.language	English	en
heal.publicationDate	2011	en
heal.abstract	Distributed systems such as Peer-to-Peer overlays have been shown to efficiently support the processing of range queries over large numbers of participating hosts. In such systems, uneven load allocation has to be effectively tackled in order to minimize overloaded peers and optimize their performance. In this work, we detect the two basic methodologies used to achieve load-balancing: Iterative key redistribution between neighbors and node migration. We identify these two key mechanisms and describe their relative advantages and disadvantages. Based on this analysis, we propose NIXMIG, a hybrid method that adaptively utilizes these two extremes to achieve both fast and cost-effective load-balancing in distributed systems that support range queries. We theoretically prove its convergence and as a case study, we offer an implementation on top of a Skip Graph, where we thoroughly validate our findings in a variety of static, dynamic and realistic workloads. We compare NIXMIG with an existing load-balancing algorithm proposed by Karger and Ruhl [1] and our experimental analysis shows that, NIXMIG can be as much as three times faster, requiring only one sixth and one third of message and item exchanges, respectively, to bring the system to a balanced state. © 2006 IEEE.	en
heal.publisher	IEEE COMPUTER SOC	en
heal.journalName	IEEE Transactions on Parallel and Distributed Systems	en
dc.identifier.doi	10.1109/TPDS.2010.200	en
dc.identifier.isi	ISI:000292047500011	en
dc.identifier.volume	22	en
dc.identifier.issue	8	en
dc.identifier.spage	1350	en
dc.identifier.epage	1364	en