Adaptive routing in packet-switched networks using agents updating methods
This paper investigates a non-trivial, multi-objective and multi-constraint routing optimisation problem for dynamic packet-switched networks. The research adopts the application of the ant colony optimisation process into routing and congestion control in telecommunication networks. This paper sugg...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Faculty of Computer Science and Information Technology, University of Malaya
2003
|
| Online Access: | http://psasir.upm.edu.my/id/eprint/49481/1/Adaptive%20routing%20in%20packet-switched%20networks%20using%20agents%20updating%20methods.pdf http://psasir.upm.edu.my/id/eprint/49481/ http://e-journal.um.edu.my/publish/MJCS/144-159 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | This paper investigates a non-trivial, multi-objective and multi-constraint routing optimisation problem for dynamic packet-switched networks. The research adopts the application of the ant colony optimisation process into routing and congestion control in telecommunication networks. This paper suggests the use of epochal updating in conjunction with modified incremental updating to update the routing table in each switching node. The resulting new approach is called the For/Backward approach. Three updating methods (Forward, Backword, For/Backword) are simulated over a packet-switched network, representing Malaysian Backbone Network, using different combinations of traffic and geographical traffic patterns. The simulation results show a clear improvement on network performance (less average packet delay and greater throughput) using the For/Backward approach compared to the Forward and Backward methods. Furthermore, the behavior of the Forward and Backward methods is studied for inconsistency of behavior. |
|---|