Survey on Load Balancing in Peer-to-Peer Distributed Hash Tables (Article de p�riodique) | Pascal Felber, Peter Kropf, Eryk Schiller, Sabina Serbu - 2014 (Communications Surveys & Tutorials, IEEE)

Survey on Load Balancing in Peer-to-Peer Distributed Hash Tables

Pascal Felber, Peter Kropf, Eryk Schiller & Sabina Serbu

R�sum�	Peer-to-peer systems represent a radical shift from the classical client-server paradigm in which a centralized server processes requests from all clients. In a peer-to-peer (P2P) system, every "peer" can play the role of a client and a server at the same time, hence sharing responsibilities among all parties. As in practice some peers or connecting links may be heavily loaded in comparison to others, load balancing algorithms are necessary to ensure a fair distribution of the load among participating peers. In this survey, we present load management solutions in P2P systems. According to the level at which they operate, we classify the different approaches into three categories: object placement, routing protocol, and underlay. The first two approaches tackle information lookup and retrieval in the overlay network, while the last one addresses traffic imbalance at the level of the underlying network.

Mots-cl�s

Citation	P. Felber, et al., "Survey on Load Balancing in Peer-to-Peer Distributed Hash Tables," Communications Surveys & Tutorials, IEEE, vol. 16, p. 473-492, 2014.

Type	Article de p�riodique (Anglais)
Date de publication	2014
Nom du p�riodique	Communications Surveys & Tutorials, IEEE
Volume	16
Num�ro	1
Pages	473-492
URL	http://dx.doi.org/10.1109/SURV.2013.060313.00157

Imprimer la page