The Community for Technology Leaders
Peer-to-Peer Computing, IEEE International Conference on (2008)
Sept. 8, 2008 to Sept. 11, 2008
ISBN: 978-0-7695-3318-6
pp: 333-342
ABSTRACT
The notion of "superpeer" has been shown to be very effective to increase the scalability of P2P applications. For superpeer systems to work, it is critical to preserve the optimal ratio between the number of superpeers and normal peers participating in the overlay. This requires that peers change dynamically their role (i.e., from su-perpeer to normal peer and vice versa) in the presence of node arrivals and departures, a problem that is hard to solve if no peer has global knowledge of the network. In this article, we first investigate the feasibility of superpeer ratio maintenance when each peer can decide to be a superpeer independently of each other. We then show how this problem can be treated as an optimization problem, and we propose a distributed algorithm, based on particle swarm optimization (PSO), to solve it. Our simulation results prove the viability of a PSO-based approach for this problem.
INDEX TERMS
null
CITATION

P. Garc?a-L?pez, A. F. Skarmeta and M. S?nchez-Artigas, "On the Feasibility of Dynamic Superpeer Ratio Maintenance," 2008 Eighth International Conference on Peer-to-Peer Computing (P2P), Aachen, 2008, pp. 333-342.
doi:10.1109/P2P.2008.15
94 ms
(Ver 3.3 (11022016))