BlåtAnt: Bounding Networks’ Diameter with a Collaborative Distributed Algorithm | SpringerLink
Skip to main content
Springer Nature Link
Log in

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

  • Conference paper
Ant Colony Optimization and Swarm Intelligence (ANTS 2008)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 5217))

Abstract

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.

Research supported by the Swiss Hasler Foundation (“ManCom Initiative”, project Nr. 2122).

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Milgram, S.: The small world problem. Psychology Today 2, 60–67 (1967)

    Google Scholar 

  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. 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)

    Chapter  Google Scholar 

  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)

    Article  Google Scholar 

  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. Kleinberg, J.: Complex networks and decentralized search algorithms. In: Proceedings of the International Congress of Mathematicians (ICM) (2006)

    Google Scholar 

  7. Sandberg, O.: Searching a small world. Master’s thesis, Chalmers University (2005)

    Google Scholar 

  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. 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)

    Chapter  Google Scholar 

  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. 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)

    Article  MATH  Google Scholar 

  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. Dimakopoulos, V.V., Pitoura, E.: On the performance of flooding-based resource discovery. IEEE Trans. Parallel Distrib. Syst. 17(11), 1242–1252 (2006)

    Article  Google Scholar 

  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), http://diuf.unifr.ch/pai

Download references

Author information

Authors and Affiliations

  1. Department of Informatics, University of Fribourg, Switzerland

    Amos Brocco, Fulvio Frapolli & Béat Hirsbrunner

Authors
  1. Amos Brocco
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Fulvio Frapolli
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Béat Hirsbrunner
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Marco Dorigo Mauro Birattari Christian Blum Maurice Clerc Thomas Stützle Alan F. T. Winfield

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Brocco, A., Frapolli, F., Hirsbrunner, B. (2008). BlåtAnt: Bounding Networks’ Diameter with a Collaborative Distributed Algorithm. In: Dorigo, M., Birattari, M., Blum, C., Clerc, M., Stützle, T., Winfield, A.F.T. (eds) Ant Colony Optimization and Swarm Intelligence. ANTS 2008. Lecture Notes in Computer Science, vol 5217. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-87527-7_27

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-87527-7_27

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-87526-0

  • Online ISBN: 978-3-540-87527-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation