Link-state and ant-like algorithm behaviour for single-constrained routing
| Autor: | L. Sacks, T. Michalareas |
|---|---|
| Rok vydání: | 2002 |
| Předmět: |
Routing protocol
Internet protocol suite Steady state (electronics) Link-state routing protocol computer.internet_protocol Computer science Distributed algorithm Computer Science::Networking and Internet Architecture Routing (electronic design automation) Network topology Algorithm computer Throughput (business) |
| Zdroj: | 2001 IEEE Workshop on High Performance Switching and Routing (IEEE Cat. No.01TH8552). |
| DOI: | 10.1109/hpsr.2001.923651 |
| Popis: | 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. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|