Link-state and ant-like algorithm behaviour for single-constrained routing
Theodoros Michalareas, L. Sacks · 2002
In this paper we examine the steady state behaviour of the link state routing protocol and the AntNet algorithm in simple topologies under uniform load. We show that under our scenario conditions both algorithms behave in the same operational region. We discuss also the applied statistical methodology and the necessary measurements for throughput behaviour in steady state.