BlåtAnt: Bounding Networks’ Diameter with a Collaborative Distributed Algorithm

  • Amos Brocco
  • Fulvio Frapolli
  • Béat Hirsbrunner
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5217)


In this paper we describe BlåtAnt, a new algorithm to create overlay networks with small diameters. BlåtAnt is a fully distributed and adaptive algorithm inspired by Ant Colony Optimization (ACO), which targets dynamic and evolving networks without requiring a global knowledge. Simulation results show that our approach results in networks with a bounded diameter. This algorithm, implemented and empirically tested, will be the foundation of a fully decentralized resource discovery mechanism optimized for networks with small diameters.


Overlay Network Small World Global Knowledge Resource Discovery Bounding Network 
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.
    Milgram, S.: The small world problem. Psychology Today 2, 60–67 (1967)Google Scholar
  2. 2.
    Kleinberg, J.: The small-world phenomenon: An algorithmic perspective. In: Proceedings of the 32nd ACM Symposium on Theory of Computing (2000)Google Scholar
  3. 3.
    Duchon, P., Hanusse, N., Lebhar, E., Schabanel, N.: Towards small world emergence. In: SPAA 2006: Proceedings of the 18th annual ACM symposium on Parallelism in algorithms and architectures, pp. 225–232. ACM, New York (2006)CrossRefGoogle Scholar
  4. 4.
    Ratnasamy, S., Francis, P., Handley, M., Karp, R., Schenker, S.: A scalable content-addressable network. SIGCOMM Comp. Com. Rev. 31(4), 161–172 (2001)CrossRefGoogle Scholar
  5. 5.
    Stoica, I., Morris, R., Karger, D., Kaashoek, F., Balakrishnan, H.: Chord: A scalable peer-to-peer lookup service for internet applications. In: Proceedings of the 2001 ACM SIGCOMM Conference, pp. 149–160 (2001)Google Scholar
  6. 6.
    Kleinberg, J.: Complex networks and decentralized search algorithms. In: Proceedings of the International Congress of Mathematicians (ICM) (2006)Google Scholar
  7. 7.
    Sandberg, O.: Searching a small world. Master’s thesis, Chalmers University (2005)Google Scholar
  8. 8.
    Zhang, H., Goel, A., Govindan, R.: Using the small-world model to improve freenet performance. In: INFOCOM 2002. 21st Annual Joint Conference of the IEEE Computer and Communications Societies, vol. 3, pp. 1228–1237 (2002)Google Scholar
  9. 9.
    Akavipat, R., Wu, L.S., Menczer, F.: Small world peer networks in distributed web search. In: WWW Alt. 2004: Proceedings of the 13th international World Wide Web conference on Alternate track papers & posters, pp. 396–397. ACM, New York (2004)CrossRefGoogle Scholar
  10. 10.
    Clarke, I., Sandberg, O., Wiley, B., Hong, T.W.: Freenet: A distributed anonymous information storage and retrieval system. In: Proceedings of Designing Privacy Enhancing Technologies: Workshop on Design Issues in Anonymity and Unobservability, pp. 46–66 (July 2000)Google Scholar
  11. 11.
    Hui, K.Y.K., Lui, J.C.S., Yau, D.K.Y.: Small-world overlay p2p networks: construction, management and handling of dynamic flash crowds. Comput. Netw. 50(15), 2727–2746 (2006)zbMATHCrossRefGoogle Scholar
  12. 12.
    Iamnitchi, A., Foster, I.T.: On fully decentralized resource discovery in grid environments. In: Lee, C.A.(ed.). LNCS, Vol. 2242, pp. 51–62. Springer, Heidelberg (2001)Google Scholar
  13. 13.
    Dimakopoulos, V.V., Pitoura, E.: On the performance of flooding-based resource discovery. IEEE Trans. Parallel Distrib. Syst. 17(11), 1242–1252 (2006)CrossRefGoogle Scholar
  14. 14.
    Brocco, A., Frapolli, F., Hirsbrunner, B.: Shrinking the network: The blatant algorithm. Technical Report 08-04, Department of Informatics, University of Fribourg, Fribourg, Switzerland (April 2008),

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Amos Brocco
    • 1
  • Fulvio Frapolli
    • 1
  • Béat Hirsbrunner
    • 1
  1. 1.Department of InformaticsUniversity of FribourgSwitzerland

Personalised recommendations