DocumentCode
3109838
Title
Link-state and ant-like algorithm behaviour for single-constrained routing
Author
Michalareas, T. ; Sacks, L.
Author_Institution
Dept. of Electron. & Electr. Eng., Univ. Coll. London, UK
fYear
2001
fDate
2001
Firstpage
302
Lastpage
305
Abstract
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
Keywords
Internet; network topology; statistical analysis; telecommunication network routing; transport protocols; AntNet algorithm; TCP; TCP/IP; ant-like algorithm behaviour; link state routing protocol; link-state; single-constrained routing; statistical methodology; steady state; steady state behaviour; throughput behaviour; topologies; Circuit topology; Data structures; Delay; Distributed algorithms; Educational institutions; IP networks; Routing protocols; Statistical analysis; Steady-state; Throughput;
fLanguage
English
Publisher
ieee
Conference_Titel
High Performance Switching and Routing, 2001 IEEE Workshop on
Conference_Location
Dallas, TX
Print_ISBN
0-7803-6711-1
Type
conf
DOI
10.1109/HPSR.2001.923651
Filename
923651
Link To Document