An analytic modelling approach for network routing algorithms that use "ant-like" mobile agents

  • Authors:

  • Nigel Bean;Andre Costa

  • Affiliations:

  • Applied Mathematics, University of Adelaide, Adelaide 5005, Australia;Applied Mathematics, University of Adelaide, Adelaide 5005, Australia and Centre of Excellence for Mathematics and Statistics of Complex Systems, University of Melbourne, Melbourne 3010, Australia

  • Venue:
  • Computer Networks: The International Journal of Computer and Telecommunications Networking
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper, we introduce an analytic modelling approach to the study of a novel class of adaptive network routing algorithm, which is inspired by the emergent problem-solving behaviours observed in biological ant colonies. This class of algorithm utilizes ''ant-like'' agents which traverse the network and collectively construct routing policies. Previous studies have focused exclusively on simulation experiments, which indicate that such algorithms perform well in response to real-time changes in traffic demands and network conditions. The analytic model presented in this paper permits useful insights into certain fundamental aspects of ant-based algorithms, which have not been discussed in previous ant-based routing literature. In particular, the work presented in this paper motivates our proposal of a number of modifications to the basic design of ant-based routing algorithms, which result in improved performance with respect to equilibrium performance measures.