Peer-to-Peer Optimization in Large Unreliable Networks with Branch-and-Bound and Particle Swarms

Authors:
Balázs Bánhelyi;Marco Biazzini;Alberto Montresor;Márk Jelasity
Affiliations:
University of Szeged, Hungary;University of Trento, Italy;University of Trento, Italy;University of Szeged and HAS, Hungary
Venue:
EvoWorkshops '09 Proceedings of the EvoWorkshops 2009 on Applications of Evolutionary Computing: EvoCOMNET, EvoENVIRONMENT, EvoFIN, EvoGAMES, EvoHOT, EvoIASP, EvoINTERACTION, EvoMUSART, EvoNUM, EvoSTOC, EvoTRANSLOG
Year:
2009

Citing 7
Cited 4

Parallel Combinatorial Optimization (Wiley Series on Parallel and Distributed Computing)

Parallel Combinatorial Optimization (Wiley Series on Parallel and Distributed Computing)
A Parallel P2P Branch-and-Bound Algorithm for Computational Grids

CCGRID '07 Proceedings of the Seventh IEEE International Symposium on Cluster Computing and the Grid
Gossip-based peer sampling

ACM Transactions on Computer Systems (TOCS)
Peer-to-peer evolutionary algorithms with adaptive autonomous selection

Proceedings of the 9th annual conference on Genetic and evolutionary computation
Gossiping in distributed systems

ACM SIGOPS Operating Systems Review - Gossip-based computer networking
P2P Evolutionary Algorithms: A Suitable Approach for Tackling Large Instances in Hard Optimization Problems

Euro-Par '08 Proceedings of the 14th international Euro-Par conference on Parallel Processing
Branch-and-Bound interval global optimization on shared memory multiprocessors

Optimization Methods & Software - THE JOINT EUROPT-OMS CONFERENCE ON OPTIMIZATION, 4-7 JULY, 2007, PRAGUE, CZECH REPUBLIC, PART I

Two-stage EDA-based approach for all optical WDM mesh network survivability under SRLG constraints

Applied Soft Computing
A peer-to-peer approach to genetic programming

EuroGP'11 Proceedings of the 14th European conference on Genetic programming
Validating evolutionary algorithms on volunteer computing grids

DAIS'10 Proceedings of the 10th IFIP WG 6.1 international conference on Distributed Applications and Interoperable Systems
Pool-Based distributed evolutionary algorithms using an object database

EvoApplications'12 Proceedings of the 2012t European conference on Applications of Evolutionary Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.