An Ant Approach to Membership Overlay Design

Results on the Dynamic Global Setting
  • Vittorio Maniezzo
  • Marco Boschetti
  • Mark Jelasity
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3172)


Designing an optimal overlay communication network for a set of processes on the Internet is a central problem of peer-to-peer (P2P) computing. Such a network defines membership and allows for members to disseminate information within the group. The network has to be robust and the available bandwidth has to be utilized in an optimal manner to allow for maximally efficient communication. This problem can be formulated as a dynamic optimization problem where classical combinatorial optimization techniques must face the further challenge of time-varying input data. ACO systems appear to be particularly fit for this class of problems, being able to construct an internal model of the instance to face and to exploit it for fast adaptation to modified contexts.

This paper proposes to use elements resulting from mathematical techniques, in this case Lagrangean relaxation, in an ACO framework in order to achieve sound hot start states for fast response to varying network structures.


Overlay Network Distribute Hash Table Steiner Tree Problem Dynamic Optimization Problem Lagrangean Penalty 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Blum, C.: Aco applied to group shop scheduling: A case study on intensification and diversification. In: Proc. ANTS 2002 (2002)Google Scholar
  2. 2.
    Boschetti, M., Jelasity, M., Maniezzo, V.: A local approach to membership overlay design. Working paper, Department of Computer Science, University of Bologna (2004)Google Scholar
  3. 3.
    Corman, T., Leiserson, C., Rivest, R.: Introduction to Algorithms. MIT Press, Cambridge (1990)Google Scholar
  4. 4.
    Demers, A., Greene, D., Hauser, C., Irish, W., Larson, J., Shenker, S., Sturgis, H., Swinehart, D., Terry, D.: Epidemic algorithms for replicated database management. In: Proceedings of the 6th Annual ACM Symposium on Principles of Distributed Computing (PODC 1987), Vancouver, August 1987, pp. 1–12. ACM, New York (1987)CrossRefGoogle Scholar
  5. 5.
    Eugster, P.T., Guerraoui, R., Kermarrec, A.-M., Massoulié, L.: . From epidemics to distributed computing. IEEE Computer (to appear)Google Scholar
  6. 6.
    Eyckelhof, C.J., Snoek, M.: Ant systems for a dynamic tsp: Ants caught in a traffic jam. In: Dorigo, M., Di Caro, G.A., Sampels, M. (eds.) Ant Algorithms 2002. LNCS, vol. 2463, p. 88. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  7. 7.
    Fisher, M.L.: The lagrangean relaxation method for solving integer programming problems. Management Science 27(1), 1–18 (1981)zbMATHCrossRefMathSciNetGoogle Scholar
  8. 8.
    Ganesh, A.J., Kermarrec, A.-M., Massoulié, L.: Peer-to-peer membership management for gossip-based protocols. IEEE Transactions on Computers 52(2) (February 2003)Google Scholar
  9. 9.
    Garlick, R.M., Barr, R.S.: Dynamic wavelength routing in wdm networks via ant colony optimization. In: Dorigo, M., Di Caro, G.A., Sampels, M. (eds.) Ant Algorithms 2002. LNCS, vol. 2463, p. 250. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  10. 10.
  11. 11.
    Guntsch, M., Branke, J., Middendorf, M., Schmeck, H.: Aco strategies for dynamic tsp. In: ANTS 2000 - From Ant Colonies to Artificial Ants: Second International Workshop on Ant Algorithms (2000)Google Scholar
  12. 12.
    Guntsch, M., Middendorf, M.: Applying population based aco to dynamic optimization problems. In: Dorigo, M., Di Caro, G., Sampels, M. (eds.) Ant Algorithms 2002. LNCS, vol. 2463, p. 111. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  13. 13.
    Hu, T.C.: Optimum communication spanning trees. SIAM Journal on Computing 3(3), 188–195 (1974)zbMATHCrossRefMathSciNetGoogle Scholar
  14. 14.
    Hwang, F.K., Richards, D.S., Winter, P.: The Steiner Tree Problem. North-Holland, Amsterdam (1992)zbMATHGoogle Scholar
  15. 15.
    Jelasity, M., Montresor, A.: Epidemic-style proactive aggregation in large overlay networks. In: Proceedings of The 24th International Conference on Distributed Computing Systems (ICDCS 2004), Tokyo, Japan, pp. 102–109. IEEE Computer Society, Los Alamitos (2004)CrossRefGoogle Scholar
  16. 16.
    Lin, M.-J., Marzullo, K.: Directional gossip: Gossip in a wide area network. In: Hlavicka, J., Maehle, E., Pataricza, A. (eds.) EDDC 1999. LNCS, vol. 1667, pp. 364–379. Springer, Heidelberg (1999)CrossRefGoogle Scholar
  17. 17.
    Lourenço, H., Serra, D.: Adaptive search heuristics for the generalized assignment problem. Mathware and Soft Computing 9(2-3), 209–234 (2002)zbMATHMathSciNetGoogle Scholar
  18. 18.
    Maniezzo, V.: Exact and approximate nondeterministic tree-search procedures for the quadratic assignment problem. INFORMS J. on Computing 11(4), 358–369 (1999)zbMATHCrossRefMathSciNetGoogle Scholar
  19. 19.
    Martello, S., Toth, P.: Knapsack problems: algorithms and computer implementations. John Wiley & Sons, Chichester (1990)zbMATHGoogle Scholar
  20. 20.
    Massoulié, L., Kermarrec, A.-M., Ganesh, A.J.: Network awareness and failure resilience in self-organising overlays networks. In: Proceedings of the 22nd Symposium on Reliable Distributed Systems (SRDS 2003), Florence, Italy, pp. 47–55 (2003)Google Scholar
  21. 21.
    Milojicic, D.S., Kalogeraki, V., Lukose, R., Nagaraja, K., Pruyne, J., Richard, B., Rollins, S., Xu, Z.: Peer-to-peer computing. Technical Report HPL-2002-57, HP Labs, Palo Alto (2002)Google Scholar
  22. 22.
    Montresor, A., Jelasity, M., Babaoglu, O.: 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)Google Scholar
  23. 23.
    Nouyan, S.: Agent-based approach to dynamic task allocation. In: Dorigo, M., Di Caro, G.A., Sampels, M. (eds.) Ant Algorithms 2002. LNCS, vol. 2463, p. 28. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  24. 24.
    FastTrack: Wikipedia page,
  25. 25.
    Saroiu, S., Krishna Gummadi, P., Gribble, S.D.: A measurement study of peerto- peer file sharing systems. In: Proceedings of Multimedia Computing and Networking 2002 (MMCN 2002), San Jose, CA (2002)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • Vittorio Maniezzo
    • 1
  • Marco Boschetti
    • 2
  • Mark Jelasity
    • 1
  1. 1.Department of Computer ScienceUniversity of BolognaItaly
  2. 2.Department of MathematicsUniversity of BolognaItaly

Personalised recommendations