论文信息 - BlåtAnt: Bounding Networks' Diameter with a Collaborative Distributed Algorithm

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

In this paper we describe BlatAnt, a new algorithm to create overlay networks with small diameters. BlatAnt 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.

[1] Philippe Duchon,et al. Towards small world emergence , 2006, SPAA '06.

[2] Ian Foster,et al. On Fully Decentralized Resource Discovery in Grid Environments , 2001, GRID.

[3] David K. Y. Yau,et al. Small-world overlay P2P networks: Construction, management and handling of dynamic flash crowds , 2006, Comput. Networks.

[4] Ramesh Govindan,et al. Using the small-world model to improve Freenet performance , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[5] Oskar Sandberg,et al. Searching in a Small World , 2005 .

[6] Sharon L. Milgram,et al. The Small World Problem , 1967 .

[7] Filippo Menczer,et al. Small world peer networks in distributed web search , 2004, WWW Alt. '04.

[8] S. D. Chatterji. Proceedings of the International Congress of Mathematicians , 1995 .

[9] Jon M. Kleinberg,et al. The small-world phenomenon: an algorithmic perspective , 2000, STOC '00.

[10] David R. Karger,et al. Chord: A scalable peer-to-peer lookup service for internet applications , 2001, SIGCOMM '01.

[11] Vassilios V. Dimakopoulos,et al. On the Performance of Flooding-Based Resource Discovery , 2006, IEEE Transactions on Parallel and Distributed Systems.

[12] Mark Handley,et al. A scalable content-addressable network , 2001, SIGCOMM 2001.