Proposal of load aware routing for OSPF routing protocol

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216305%3A26220%2F13%3APU103361" target="_blank" >RIV/00216305:26220/13:PU103361 - isvavai.cz</a>

Result on the web

—

DOI - Digital Object Identifier

—

Result language

angličtina

Original language name

Proposal of load aware routing for OSPF routing protocol

Original language description

This paper deals with route cost assignment using one of the most commonly used routing protocols - Open Shortest Path First (OSPF). The limitation of this protocol is that the algorithm does not take actual link load into consideration. This paper proposes using an alternate costing strategy to avoid this problem. The alternate strategy uses an integer value representing the load of a link as the additive component of metric. Since the link load is a dynamic variable, Exponential Weighted Moving Average is used to counter quick changes. This paper proposes a novel approach to calculate OSPF metrics, aimed to better distribute the load in network.

Czech name

—

Czech description

—

Type

J_x - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)

CEP classification

JA - Electronics and optoelectronics

OECD FORD branch

—

Project

Result was created during the realization of more than one project. More information in the Projects tab.

Continuities

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>S - Specificky vyzkum na vysokych skolach

Publication year

2013

Confidentiality

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Name of the periodical

Communications

ISSN

1335-4205

e-ISSN

—

Volume of the periodical

15

Issue of the periodical within the volume

2a/2013

Country of publishing house

SK - SLOVAKIA

Number of pages

6

Pages from-to

139-144

UT code for WoS article

—

EID of the result in the Scopus database

—