System with Database for Evaluating Routing Algorithms in Computer Networks

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

System with Database for Evaluating Routing Algorithms in Computer Networks

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

School of Mechanical, Aerospace and Automotive Engineering

Research output: Chapter in Book/Report/Conference proceeding › Conference proceeding › peer-review

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 language	English
Title of host publication	Proceedings of Applied Simulation and Modelling
Editors	M.H. Hamza
Place of Publication	Calgary, Canada
Publisher	Acta Press
Publication status	Published - Jun 2005
Event	IASTED International Conference on Applied Simulation and Modelling - Benalmadena, Spain Duration: 15 Jun 2005 → 17 Jun 2005

Conference

Conference	IASTED International Conference on Applied Simulation and Modelling
Country	Spain
City	Benalmadena
Period	15/06/05 → 17/06/05

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

Access to Document

http://www.actapress.com/PaperInfo.aspx?PaperID=20864

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

Cite this

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. <http://www.actapress.com/PaperInfo.aspx?PaperID=20864>

@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; IASTED International Conference on Applied Simulation and Modelling ; Conference date: 15-06-2005 Through 17-06-2005",

year = "2005",

month = jun,

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

T2 - IASTED International Conference on Applied Simulation and Modelling

Y2 - 15 June 2005 through 17 June 2005

ER -