System with Database for Evaluating Routing Algorithms in Computer Networks

R. Rudek, I. Pozniak-Koszalka, L. Koszalka, Olivier C.L. Haas, Keith J. Burnham

Research output: Chapter in Book/Report/Conference proceedingConference proceedingpeer-review


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.
Original languageEnglish
Title of host publicationProceedings of Applied Simulation and Modelling
EditorsM.H. Hamza
Place of PublicationCalgary, Canada
PublisherActa Press
Publication statusPublished - Jun 2005
EventIASTED International Conference on Applied Simulation and Modelling - Benalmadena, Spain
Duration: 15 Jun 200517 Jun 2005


ConferenceIASTED International Conference on Applied Simulation and Modelling

Bibliographical note

This 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
  • database
  • experimentation system
  • modelling
  • routing algorithm


Dive into the research topics of 'System with Database for Evaluating Routing Algorithms in Computer Networks'. Together they form a unique fingerprint.

Cite this