A control framework for ant-based routing algorithms

Author

Leith, Chris ; Takahara, Glen

Author_Institution

Dept. of Math & Stats, Queen´´s Univ., Kingston, Ont., Canada

Volume

3

fYear

2003

fDate

8-12 Dec. 2003

Firstpage

1788

Abstract

We propose a new framework for ant-based routing algorithms which addresses the trade-off between effective and timely discovery of optimal routes, and the desire to keep data traffic flowing smoothly. The approach utilizes a database of stored delay estimates on routes to build separate routing tables for ants and data packets. This decoupling results in better control of responsiveness to load or topology fluctuations since the tables can evolve at different rates, according to different rules. The presented architecture also features guaranteed loop-free routes for data packets.

Keywords

computer architecture; delays; genetic algorithms; packet switching; telecommunication network routing; telecommunication traffic; ant algorithm; ant-based routing algorithms; data packets; data traffic; dynamic routig; loop-free routes; optimal routes; responsiveness control; routing tables; stored delay; Communication networks; Communication system traffic control; Delay estimation; Fluctuations; Heuristic algorithms; Network topology; Probability distribution; Routing; Spatial databases; Telecommunication traffic;

fLanguage

English

Publisher

ieee

Conference_Titel

Evolutionary Computation, 2003. CEC '03. The 2003 Congress on

Print_ISBN

0-7803-7804-0

Type

conf

DOI

10.1109/CEC.2003.1299889

Filename

1299889