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

Authors:
Amos Brocco;Fulvio Frapolli;Béat Hirsbrunner
Affiliations:
Department of Informatics, University of Fribourg, Switzerland;Department of Informatics, University of Fribourg, Switzerland;Department of Informatics, University of Fribourg, Switzerland
Venue:
ANTS '08 Proceedings of the 6th international conference on Ant Colony Optimization and Swarm Intelligence
Year:
2008

Citing 8
Cited 3

The small-world phenomenon: an algorithmic perspective

STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Chord: A scalable peer-to-peer lookup service for internet applications

Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
A scalable content-addressable network

Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
On Fully Decentralized Resource Discovery in Grid Environments

GRID '01 Proceedings of the Second International Workshop on Grid Computing
Small world peer networks in distributed web search

Proceedings of the 13th international World Wide Web conference on Alternate track papers & posters
Towards small world emergence

Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures
On the Performance of Flooding-Based Resource Discovery

IEEE Transactions on Parallel and Distributed Systems
Small-world overlay P2P networks: construction, management and handling of dynamic flash crowds

Computer Networks: The International Journal of Computer and Telecommunications Networking

CASP: a community-aware scheduling protocol

International Journal of Grid and Utility Computing
A self-organizing P2P system with multi-dimensional structure

Proceedings of the 8th ACM international conference on Autonomic computing
MaGate: An Interoperable, Decentralized and Modular High-Level Grid Scheduler

International Journal of Distributed Systems and Technologies

Quantified Score

Hi-index	0.00

Visualization

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.