An ant approach to membership overlay design: Results on the dynamic global setting

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

Volumn 3172 LNCS, Issue , 2004, Pages 37-48

  Maniezzo, Vittorio ^a   Boschetti, Marco ^a   Jelasity, Mark ^a,b  

^a UNIVERSITY OF BOLOGNA   (Italy)

^b SZTE   (Hungary)

Author keywords

[No Author keywords available]

Indexed keywords

BANDWIDTH; COMBINATORIAL OPTIMIZATION; DISTRIBUTED COMPUTER SYSTEMS; INFORMATION DISSEMINATION; PEER TO PEER NETWORKS; SWARM INTELLIGENCE; ARTIFICIAL INTELLIGENCE; OPTIMIZATION;

AVAILABLE BANDWIDTH; COMBINATORIAL OPTIMIZATION TECHNIQUES; DYNAMIC OPTIMIZATION PROBLEM (DOP); EFFICIENT COMMUNICATIONS; LAGRANGEAN RELAXATION; NETWORK STRUCTURES; PEER-TO-PEER COMPUTING; TIME VARYING INPUT;

ANT COLONY OPTIMIZATION;

EID: 28944448735     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-28646-2_4     Document Type: Conference Paper

References (25)

1. C. Blum. Aco applied to group shop scheduling: A case study on intensification and diversification. In Proc. ANTS'02, 2002.
2. M. Boschetti, M. Jelasity, and V. Maniezzo. A local approach to membership overlay design. Working paper, Department of Computer Science, University of Bologna, 2004.
3. T. Corman, C. Leiserson, and R. Rivest. Introduction to Algorithms. MIT Press, 1990.
4. Alan Demers, Dan Greene, Carl Hauser, Wes Irish, John Larson, Scott Shenker, Howard Sturgis, Dan Swinehart, and Doug Terry. Epidemic algorithms for replicated database management. In Proceedings of the 6th Annual ACM Symposium on Principles of Distributed Computing (PODC'87), pages 1-12, Vancouver, August 1987. ACM.
5. Patrick Th. Eugster, Rachid Guerraoui, Anne-Marie Kermarrec, and Laurent Massoulié. From epidemics to distributed computing. IEEE Computer. to appear.
6. C.J. Eyckelhof and M. Snoek. Ant systems for a dynamic tsp: Ants caught in a traffic jam. In M. Dorigo, G. Di Caro, and M. Sampels, editors, Ant Algorithms : Third International Workshop, ANTS 2002, volume 2463 / 2002 of Lecture Notes in Computer Science. Springer-Verlag, Heidelberg, 2002.
7. M.L. Fisher. The lagrangean relaxation method for solving integer programming problems. Management Science, 27(1):1-18, 1981.
8. Ayalvadi J. Ganesh, Anne-Marie Kermarrec, and Laurent Massoulié. Peer-to-peer membership management for gossip-based protocols. IEEE Transactions on Computers, 52(2), February 2003.
9. R.M. Garlick and R.S. Barr. Dynamic wavelength routing in wdm networks via ant colony optimization. In M. Dorigo, G. Di Caro, and M. Sampels, editors, Ant Algorithms : Third International Workshop, ANTS 2002, volume 2463 / 2002 of Lecture Notes in Computer Science. Springer-Verlag, Heidelberg, 2002.
10. Gnutelliums. http://www.gnutelliums.com/.
11. M. Guntsch, J. Branke, M. Middendorf, and H. Schmeck. Aco strategies for dynamic tsp. In ANTS'2000 - From Ant Colonies to Artificial Ants: Second International Workshop on Ant Algorithms, 2000.
12. M. Guntsch and M. Middendorf. Applying population based aco to dynamic optimization problems. In M. Dorigo, G. Di Caro, and M. Sampels, editors, Ant Algorithms: Third International Workshop, ANTS 2002, volume 2463 / 2002 of Lecture Notes in Computer Science. Springer-Verlag, Heidelberg, 2002.
13. T. C. Hu. Optimum communication spanning trees. SIAM Journal on Computing, 3(3):188-195, September 1974.
14. Frank K. Hwang, Dana S. Richards, and Pawel Winter. The Steiner Tree Problem. North-Holland, 1992.
15. Márk Jelasity and Alberto Montresor. Epidemic-style proactive aggregation in large overlay networks. In Proceedings of The 24th International Conference on Distributed Computing Systems (ICDCS 2004), pages 102-109, Tokyo, Japan, 2004. IEEE Computer Society.
16. Meng-Jang Lin and Keith Marzullo. Directional gossip: Gossip in a wide area network. In Jan Hlavička, Erik Maehle, and András Pataricza, editors, Dependable Computing - EDCC-3, volume 1667 of Lecture Notes on Computer Science, pages 364-379. Springer-Verlag, 1999.
17. H. Lourenço and D. Serra. Adaptive search heuristics for the generalized assignment problem. Mathware and Soft Computing, 9(2-3):209-234, 2002.
18. V. Maniezzo. Exact and approximate nondeterministic tree-search procedures for the quadratic assignment problem. INFORMS J. on Computing, 11(4):358-369, 1999.
19. S. Martello and P. Toth. Knapsack problems: algorithms and computer implementations. John Wiley & Sons, Inc., 1990.
20. Laurent Massoulié, Anne-Marie Kermarrec, and Ayalvadi J. Ganesh. Network awareness and failure resilience in self-organising overlays networks. In Proceedings of the 22nd Symposium on Reliable Distributed Systems (SRDS 2003), pages 47-55, Florence, Italy, 2003.
21. Dejan S. Milojicic, Vana Kalogeraki, Rajan Lukose, Kiran Nagaraja, Jim Pruyne, Bruno Richard, Sami Rollins, and Zhichen Xu. Peer-to-peer computing. Technical Report HPL-2002-57, HP Labs, Palo Alto, 2002.
22. Alberto Montresor, Márk Jelasity, and Ozalp Babaoglu. Robust aggregation protocols for large-scale overlay networks. Technical Report UBLCS-2003-16, University of Bologna, Department of Computer Science, Bologna, Italy, December 2003. to appear in the proceedings of Distributed Systems and Networks (DSN 2004).
23. S. Nouyan. Agent-based approach to dynamic task allocation. In M. Dorigo, G. Di Caro, and M. Sampels, editors, Ant Algorithms : Third International Workshop, ANTS 2002, volume 2463 / 2002 of Lecture Notes in Computer Science. Springer-Verlag, Heidelberg, 2002.
24. FastTrack: Wikipedia page. http://en.wikipedia.org/wiki/FastTrack.
25. S. Saroiu, P. Krishna Gummadi, and S.D. Gribble. A measurement study of peerto-peer file sharing systems. In Proceedings of Multimedia Computing and Networking 2002 (MMCN'02), San Jose, CA, 2002.