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 proceeding

2 Citations (Scopus)

Abstract

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

Conference

ConferenceIASTED International Conference on Applied Simulation and Modelling
CountrySpain
CityBenalmadena
Period15/06/0517/06/05

Fingerprint

Routing algorithms
Computer networks
Reinforcement learning
Large scale systems
Costs

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

Keywords

  • Computer network
  • database
  • experimentation system
  • modelling
  • routing algorithm

Cite this

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.

System with Database for Evaluating Routing Algorithms in Computer Networks. / Rudek, R.; Pozniak-Koszalka, I.; Koszalka, L.; Haas, Olivier C.L.; Burnham, Keith J.

Proceedings of Applied Simulation and Modelling. ed. / M.H. Hamza. Calgary, Canada : Acta Press, 2005.

Research output: Chapter in Book/Report/Conference proceedingConference proceeding

Rudek, R, Pozniak-Koszalka, I, Koszalka, L, Haas, OCL & Burnham, KJ 2005, System with Database for Evaluating Routing Algorithms in Computer Networks. in MH Hamza (ed.), Proceedings of Applied Simulation and Modelling. Acta Press, Calgary, Canada, IASTED International Conference on Applied Simulation and Modelling, Benalmadena, Spain, 15/06/05.
Rudek R, Pozniak-Koszalka I, Koszalka L, Haas OCL, Burnham KJ. System with Database for Evaluating Routing Algorithms in Computer Networks. In Hamza MH, editor, Proceedings of Applied Simulation and Modelling. Calgary, Canada: Acta Press. 2005
Rudek, R. ; Pozniak-Koszalka, I. ; Koszalka, L. ; Haas, Olivier C.L. ; Burnham, Keith J. / System with Database for Evaluating Routing Algorithms in Computer Networks. Proceedings of Applied Simulation and Modelling. editor / M.H. Hamza. Calgary, Canada : Acta Press, 2005.
@inproceedings{beb3123553584626b854896e13fbcc59,
title = "System with Database for Evaluating Routing Algorithms in Computer Networks",
abstract = "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.",
keywords = "Computer network, database, experimentation system, modelling, routing algorithm",
author = "R. Rudek and I. Pozniak-Koszalka and L. Koszalka and Haas, {Olivier C.L.} and Burnham, {Keith J.}",
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{\'a}dena, Spain",
year = "2005",
month = "6",
language = "English",
editor = "M.H. Hamza",
booktitle = "Proceedings of Applied Simulation and Modelling",
publisher = "Acta Press",
address = "Canada",

}

TY - GEN

T1 - System with Database for Evaluating Routing Algorithms in Computer Networks

AU - Rudek, R.

AU - Pozniak-Koszalka, I.

AU - Koszalka, L.

AU - Haas, Olivier C.L.

AU - Burnham, Keith J.

N1 - 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

PY - 2005/6

Y1 - 2005/6

N2 - 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.

AB - 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.

KW - Computer network

KW - database

KW - experimentation system

KW - modelling

KW - routing algorithm

M3 - Conference proceeding

BT - Proceedings of Applied Simulation and Modelling

A2 - Hamza, M.H.

PB - Acta Press

CY - Calgary, Canada

ER -