Case study of the evolution of routing algorithms in a network planning tool

Jyrki Akkanen, Jukka K. Nurminen

Research output: Contribution to journalArticleScientificpeer-review

10 Citations (Scopus)

Abstract

Traffic routing is a key component in a network planning system. This paper concentrates on the routing algorithms and follows their evolution over multiple releases of a planning tool during a period of six years. The algorithms have grown from the initial stage of finding shortest paths with Dijkstra's algorithm to cover more complex routing tasks such as finding protected and unprotected routes and capacity limited routing. We present the algorithms and in particular emphasize the practical aspects: how previous algorithms were reused and what were the practical experiences of using the algorithms. A conclusion of the study is that algorithms should be considered with an engineering attitude. It is not enough to focus on selecting the most sophisticated state-of-the-art algorithm for a given problem. Evolution capability, potential for reuse, and the development cost over the system lifetime are equally important aspects. © 2001 Elsevier Science Inc. All rights reserved.
Original languageEnglish
Pages (from-to)181-198
JournalJournal of Systems and Software
Volume58
Issue number3
DOIs
Publication statusPublished - 15 Sep 2001
MoE publication typeA1 Journal article-refereed

Fingerprint

Routing algorithms
Planning
Costs

Cite this

Akkanen, Jyrki ; Nurminen, Jukka K. / Case study of the evolution of routing algorithms in a network planning tool. In: Journal of Systems and Software. 2001 ; Vol. 58, No. 3. pp. 181-198.
@article{1b159ef4fa5d4a7a8b77d37049461fb4,
title = "Case study of the evolution of routing algorithms in a network planning tool",
abstract = "Traffic routing is a key component in a network planning system. This paper concentrates on the routing algorithms and follows their evolution over multiple releases of a planning tool during a period of six years. The algorithms have grown from the initial stage of finding shortest paths with Dijkstra's algorithm to cover more complex routing tasks such as finding protected and unprotected routes and capacity limited routing. We present the algorithms and in particular emphasize the practical aspects: how previous algorithms were reused and what were the practical experiences of using the algorithms. A conclusion of the study is that algorithms should be considered with an engineering attitude. It is not enough to focus on selecting the most sophisticated state-of-the-art algorithm for a given problem. Evolution capability, potential for reuse, and the development cost over the system lifetime are equally important aspects. {\circledC} 2001 Elsevier Science Inc. All rights reserved.",
author = "Jyrki Akkanen and Nurminen, {Jukka K.}",
year = "2001",
month = "9",
day = "15",
doi = "10.1016/S0164-1212(01)00037-1",
language = "English",
volume = "58",
pages = "181--198",
journal = "Journal of Systems and Software",
issn = "0164-1212",
publisher = "Elsevier",
number = "3",

}

Case study of the evolution of routing algorithms in a network planning tool. / Akkanen, Jyrki; Nurminen, Jukka K.

In: Journal of Systems and Software, Vol. 58, No. 3, 15.09.2001, p. 181-198.

Research output: Contribution to journalArticleScientificpeer-review

TY - JOUR

T1 - Case study of the evolution of routing algorithms in a network planning tool

AU - Akkanen, Jyrki

AU - Nurminen, Jukka K.

PY - 2001/9/15

Y1 - 2001/9/15

N2 - Traffic routing is a key component in a network planning system. This paper concentrates on the routing algorithms and follows their evolution over multiple releases of a planning tool during a period of six years. The algorithms have grown from the initial stage of finding shortest paths with Dijkstra's algorithm to cover more complex routing tasks such as finding protected and unprotected routes and capacity limited routing. We present the algorithms and in particular emphasize the practical aspects: how previous algorithms were reused and what were the practical experiences of using the algorithms. A conclusion of the study is that algorithms should be considered with an engineering attitude. It is not enough to focus on selecting the most sophisticated state-of-the-art algorithm for a given problem. Evolution capability, potential for reuse, and the development cost over the system lifetime are equally important aspects. © 2001 Elsevier Science Inc. All rights reserved.

AB - Traffic routing is a key component in a network planning system. This paper concentrates on the routing algorithms and follows their evolution over multiple releases of a planning tool during a period of six years. The algorithms have grown from the initial stage of finding shortest paths with Dijkstra's algorithm to cover more complex routing tasks such as finding protected and unprotected routes and capacity limited routing. We present the algorithms and in particular emphasize the practical aspects: how previous algorithms were reused and what were the practical experiences of using the algorithms. A conclusion of the study is that algorithms should be considered with an engineering attitude. It is not enough to focus on selecting the most sophisticated state-of-the-art algorithm for a given problem. Evolution capability, potential for reuse, and the development cost over the system lifetime are equally important aspects. © 2001 Elsevier Science Inc. All rights reserved.

U2 - 10.1016/S0164-1212(01)00037-1

DO - 10.1016/S0164-1212(01)00037-1

M3 - Article

VL - 58

SP - 181

EP - 198

JO - Journal of Systems and Software

JF - Journal of Systems and Software

SN - 0164-1212

IS - 3

ER -