This paper concerns a complex experimentation system for evaluating routing algorithms. The optimisation problem consists of choosing the route in a computer network, in order to find a path with the lowest cost and to balance traffic load, but cost changes affected by transmissions and other factors are taken into consideration. Three algorithms are presented: a fixed routing method with additional paths (DRMAP), an adaptive distance-vector routing (DVR) and the proposed by authors, an adaptive method (MQR) based on reinforcement learning approach. The properties of the algorithms and opportunities of the designed experimentation system with database are shown using examples. It is demonstrated that the proposed simulation model retains the relation between the applied routing algorithms and network environment, as in real networks.
|Title of host publication||Proceedings of Applied Simulation and Modelling|
|Place of Publication||Calgary, Canada|
|Publication status||Published - Jun 2005|
|Event||IASTED International Conference on Applied Simulation and Modelling - Benalmadena, Spain|
Duration: 15 Jun 2005 → 17 Jun 2005
|Conference||IASTED International Conference on Applied Simulation and Modelling|
|Period||15/06/05 → 17/06/05|
Bibliographical noteThis conference paper is not yet available on the repository. The paper was given at the Applied Simulation and Modelling (ASM) 2005, June 15-17 2005, Benalmádena, Spain
- Computer network
- experimentation system
- routing algorithm
Rudek, R., Pozniak-Koszalka, I., Koszalka, L., Haas, O. C. L., & Burnham, K. J. (2005). System with Database for Evaluating Routing Algorithms in Computer Networks. In M. H. Hamza (Ed.), Proceedings of Applied Simulation and Modelling Calgary, Canada: Acta Press.