Towards balanced allocations for dhts

Tsatsanifos, G; Samoladas, V

dc.contributor.author	Tsatsanifos, G	en
dc.contributor.author	Samoladas, V	en
dc.date.accessioned	2014-03-01T02:53:31Z
dc.date.available	2014-03-01T02:53:31Z
dc.date.issued	2011	en
dc.identifier.issn	03029743	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/36373
dc.subject.other	Balanced allocation	en
dc.subject.other	Decentralized networks	en
dc.subject.other	Load-Balancing	en
dc.subject.other	Structured peer-to-peer networks	en
dc.subject.other	Virtual node	en
dc.subject.other	Distributed computer systems	en
dc.subject.other	Expert systems	en
dc.subject.other	Peer to peer networks	en
dc.title	Towards balanced allocations for dhts	en
heal.type	conferenceItem	en
heal.identifier.primary	10.1007/978-3-642-23091-2_42	en
heal.identifier.secondary	http://dx.doi.org/10.1007/978-3-642-23091-2_42	en
heal.publicationDate	2011	en
heal.abstract	We consider the problem of load-balancing structured peer-to-peer networks. Load-balancing is of major significance for large-scale decentralized networks in terms of enhanced scalability and performance. Our methods focus mainly on task-skew. Specifically, we address the problem with general rigorous algorithms on the basis of migration. In particular, the cornerstones of our methods are the notions of virtual nodes, replication and multiple realities. Finally, our work is complemented with extensive experiments. © 2011 Springer-Verlag Berlin Heidelberg.	en
heal.journalName	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)	en
dc.identifier.doi	10.1007/978-3-642-23091-2_42	en
dc.identifier.volume	6861 LNCS	en
dc.identifier.issue	PART 2	en
dc.identifier.spage	485	en
dc.identifier.epage	492	en