A control framework for ant-based routing algorithms
| Autor: | G. Takahara, C. Leith |
|---|---|
| Rok vydání: | 2004 |
| Předmět: |
Routing protocol
Dynamic Source Routing Computer science Equal-cost multi-path routing Distributed computing Routing table Enhanced Interior Gateway Routing Protocol Wireless Routing Protocol Geographic routing Routing Information Protocol Packet switching Destination-Sequenced Distance Vector routing Hierarchical routing Triangular routing Static routing Zone Routing Protocol Network packet business.industry ComputerSystemsOrganization_COMPUTER-COMMUNICATIONNETWORKS Policy-based routing Path vector protocol DSRFLOW Routing domain Link-state routing protocol Multipath routing business Computer network |
| Zdroj: | The 2003 Congress on Evolutionary Computation, 2003. CEC '03.. |
| DOI: | 10.1109/cec.2003.1299889 |
| Popis: | 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. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|