Decentralized peer-to-peer (P2P) networks (lacking a GRID-style resource management and scheduling infrastructure) are an increasingly important computing platform. So far, little is known about the scaling and reliability of optimization algorithms in P2P environments. In this paper we present empirical results comparing two P2P algorithms for real-valued search spaces in large-scale and unreliable networks. Some interesting, and perhaps counter-intuitive findings are presented: for example, failures in the network can in fact significantly improve performance under some conditions. The two algorithms that are compared are a known distributed particle swarm optimization (PSO) algorithm and a novel P2P branch-and-bound (B&B) algorithm based on interval arithmetic. Although our B&B algorithm is not a black-box heuristic, the PSO algorithm is competitive in certain cases, in particular, in larger networks. Comparing two rather different paradigms for solving the same problem gives a better characterization of the limits and possibilities of optimization in P2P networks. ©Springer-Verlag Berlin Heidelberg 2009.
CITATION STYLE
Bánhelyi, B., Biazzini, M., Montresor, A., & Jelasity, M. (2009). Peer-to-peer optimization in large unreliable networks with branch-and-bound and particle swarms. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5484 LNCS, pp. 87–92). https://doi.org/10.1007/978-3-642-01129-0_10
Mendeley helps you to discover research relevant for your work.