Peer-to-peer optimization in large unreliable networks with branch-and-bound and particle swarms

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5484 LNCS, Issue , 2009, Pages 87-92

  Bánhelyi, Balázs ^a   Biazzini, Marco ^b   Montresor, Alberto ^b   Jelasity, Márk ^a  

^a UNIVERSITY OF SZEGED   (Hungary)

^b UNIVERSITY OF TRENTO   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

BLACK BOXES; BRANCH AND BOUNDS; COMPUTING PLATFORM; DECENTRALIZED PEER-TO-PEER NETWORKS; DISTRIBUTED PARTICLES; EMPIRICAL RESULTS; INTERVAL ARITHMETIC; LARGER NETWORKS; OPTIMIZATION ALGORITHMS; P2P ENVIRONMENT; P2P NETWORK; PARTICLE SWARM; PEER TO PEER; PSO ALGORITHMS; RESOURCE MANAGEMENT; SEARCH SPACES; UNRELIABLE NETWORK;

ALGORITHMS; COMPUTER SCIENCE; GRID COMPUTING; HEURISTIC ALGORITHMS; RESOURCE ALLOCATION;

PARTICLE SWARM OPTIMIZATION (PSO);

EID: 67650665273     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-01129-0_10     Document Type: Conference Paper

References (11)

1. Kermarrec, A.M., Van Steen, M. (eds.): ACM SIGOPS Operating Systems Review 41 (October 2007); Special issue on Gossip-Based Networking
2. Biazzini,M., Montresor, A., Brunato, M.: Towards a decentralized architecture for optimization. In: Proc. of IEEE IPDPS, Miami, FL, USA (April 2008)
3. Wickramasinghe, W.R.M.U.K., Van Steen, M., Eiben, A.E.: Peer-to-peer evolutionary algorithms with adaptive autonomous selection. In: Proc. of GECCO, pp. 1460-1467. ACM Press, New York (2007) (Pubitemid 47291716)
4. Laredo, J.L.J., Eiben, E.A., Van Steen, M., Castillo, P.A., Mora, A.M., Merelo, J.J.: P2P evolutionary algorithms: A suitable approach for tackling large instances in hard optimization problems. In: Luque, E., Margalef, T., Beńitez, D. (eds.) Euro-Par 2008. LNCS, vol.5168, pp. 622-631. Springer, Heidelberg (2008)
5. Jelasity, M., Montresor, A., Babaoglu, O.: A modular paradigm for building self-organizing peer-to-peer applications. In: Di Marzo Serugendo, G., Karageorgos, A., Rana, O.F., Zambonelli, F. (eds.) ESOA 2003. LNCS (LNAI), vol.2977, pp. 265-282. Springer, Heidelberg (2004) (Pubitemid 38458469)
6. Bendjoudi, A., Melab, N., Talbi, E.G.: A parallel P2P branch-and-bound algorithm for computational grids. In: Proc. of IEEE CCGRID, Rio De Janeiro, Brazil, pp. 749-754 (2007) (Pubitemid 47334619)
7. Jelasity, M., Voulgaris, S., Guerraoui, R., Kermarrec, A.M., Van Steen, M.: Gossip-based peer sampling. ACM Transactions on Computer Systems 25(3), 8 (2007) (Pubitemid 47330747)
8. Talbi, E.G. (ed.): Parallel Combinatorial Optimization. Wiley, Chichester (2006)
9. Casado, L.G., Martinez, J.A., Garcia, I., Hendrix, E.M.T.: Branch-and-bound interval global optimization on shared memory multiprocessors. Optimization Methods and Software 23(5), 689-701 (2008)
10. Ratschek, H., Rokne, J.: Interval methods. In: Horst, R., Pardalos, P.M. (eds.) Handbook of Global Optimization. Kluwer, Dordrecht (1995)
11. PeerSim, http://peersim.sourceforge.net/