BlatAnt: 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.