Unicast QoS Routing Algorithms for SDN

A Comprehensive Survey and Performance Evaluation

Jochen W. Guck, Amaury Van Bemten, Martin Reisslein, Wolfgang Kellerer

Research output: Contribution to journalArticle

21 Citations (Scopus)

Abstract

A variety of communication networks, such as industrial communication systems, have to provide strict delay guarantees to the carried flows. Fast and close to optimal quality of service (QoS) routing algorithms, e.g., delay-constrained least-cost (DCLC) routing algorithms, are required for routing flows in such networks with strict delay requirements. The emerging software-defined networking (SDN) paradigm centralizes the network control in SDN controllers that can centrally execute QoS routing algorithms. A wide range of QoS routing algorithms have been proposed in the literature and examined in individual studies. However, a comprehensive evaluation framework and quantitative comparison of QoS routing algorithms that can serve as a basis for selecting and further advancing QoS routing in SDN networks is missing in the literature. This makes it difficult to select the most appropriate QoS routing algorithm for a particular use case, e.g., for SDN controlled industrial communications. We close this gap in the literature by conducting a comprehensive up-to-date survey of centralized QoS routing algorithms. We introduce a novel four-dimensional (4D) evaluation framework for QoS routing algorithms, whereby the four dimensions correspond to the type of topology, two forms of scalability of a topology, and the tightness of the delay constraint. We implemented 26 selected DCLC algorithms and compared their runtime and cost inefficiency within the 4D evaluation framework. While the main conclusion of this evaluation is that the best algorithm depends on the specific sub-space of the 4D space that is targeted, we identify two algorithms, namely Lagrange relaxation based aggregated cost (LARAC) and search space reduction delay-cost-constrained routing (SSR+DCCR), that perform very well in most of the 4D evaluation space.

Original languageEnglish (US)
JournalIEEE Communications Surveys and Tutorials
DOIs
StateAccepted/In press - Sep 6 2017

Fingerprint

Routing algorithms
Quality of service
Costs
Topology
Software defined networking
Telecommunication networks
Scalability
Communication systems
Controllers
Communication

Keywords

  • Delay-constrained least-cost (DCLC) routing
  • performance evaluation framework
  • quality of service (QoS)
  • scalability
  • software-defined networking (SDN).

ASJC Scopus subject areas

  • Electrical and Electronic Engineering

Cite this

Unicast QoS Routing Algorithms for SDN : A Comprehensive Survey and Performance Evaluation. / Guck, Jochen W.; Van Bemten, Amaury; Reisslein, Martin; Kellerer, Wolfgang.

In: IEEE Communications Surveys and Tutorials, 06.09.2017.

Research output: Contribution to journalArticle

@article{f2e1f34a287f4ca18adfbe12eba77f88,
title = "Unicast QoS Routing Algorithms for SDN: A Comprehensive Survey and Performance Evaluation",
abstract = "A variety of communication networks, such as industrial communication systems, have to provide strict delay guarantees to the carried flows. Fast and close to optimal quality of service (QoS) routing algorithms, e.g., delay-constrained least-cost (DCLC) routing algorithms, are required for routing flows in such networks with strict delay requirements. The emerging software-defined networking (SDN) paradigm centralizes the network control in SDN controllers that can centrally execute QoS routing algorithms. A wide range of QoS routing algorithms have been proposed in the literature and examined in individual studies. However, a comprehensive evaluation framework and quantitative comparison of QoS routing algorithms that can serve as a basis for selecting and further advancing QoS routing in SDN networks is missing in the literature. This makes it difficult to select the most appropriate QoS routing algorithm for a particular use case, e.g., for SDN controlled industrial communications. We close this gap in the literature by conducting a comprehensive up-to-date survey of centralized QoS routing algorithms. We introduce a novel four-dimensional (4D) evaluation framework for QoS routing algorithms, whereby the four dimensions correspond to the type of topology, two forms of scalability of a topology, and the tightness of the delay constraint. We implemented 26 selected DCLC algorithms and compared their runtime and cost inefficiency within the 4D evaluation framework. While the main conclusion of this evaluation is that the best algorithm depends on the specific sub-space of the 4D space that is targeted, we identify two algorithms, namely Lagrange relaxation based aggregated cost (LARAC) and search space reduction delay-cost-constrained routing (SSR+DCCR), that perform very well in most of the 4D evaluation space.",
keywords = "Delay-constrained least-cost (DCLC) routing, performance evaluation framework, quality of service (QoS), scalability, software-defined networking (SDN).",
author = "Guck, {Jochen W.} and {Van Bemten}, Amaury and Martin Reisslein and Wolfgang Kellerer",
year = "2017",
month = "9",
day = "6",
doi = "10.1109/COMST.2017.2749760",
language = "English (US)",
journal = "IEEE Communications Surveys and Tutorials",
issn = "1553-877X",
publisher = "Institute of Electrical and Electronics Engineers Inc.",

}

TY - JOUR

T1 - Unicast QoS Routing Algorithms for SDN

T2 - A Comprehensive Survey and Performance Evaluation

AU - Guck, Jochen W.

AU - Van Bemten, Amaury

AU - Reisslein, Martin

AU - Kellerer, Wolfgang

PY - 2017/9/6

Y1 - 2017/9/6

N2 - A variety of communication networks, such as industrial communication systems, have to provide strict delay guarantees to the carried flows. Fast and close to optimal quality of service (QoS) routing algorithms, e.g., delay-constrained least-cost (DCLC) routing algorithms, are required for routing flows in such networks with strict delay requirements. The emerging software-defined networking (SDN) paradigm centralizes the network control in SDN controllers that can centrally execute QoS routing algorithms. A wide range of QoS routing algorithms have been proposed in the literature and examined in individual studies. However, a comprehensive evaluation framework and quantitative comparison of QoS routing algorithms that can serve as a basis for selecting and further advancing QoS routing in SDN networks is missing in the literature. This makes it difficult to select the most appropriate QoS routing algorithm for a particular use case, e.g., for SDN controlled industrial communications. We close this gap in the literature by conducting a comprehensive up-to-date survey of centralized QoS routing algorithms. We introduce a novel four-dimensional (4D) evaluation framework for QoS routing algorithms, whereby the four dimensions correspond to the type of topology, two forms of scalability of a topology, and the tightness of the delay constraint. We implemented 26 selected DCLC algorithms and compared their runtime and cost inefficiency within the 4D evaluation framework. While the main conclusion of this evaluation is that the best algorithm depends on the specific sub-space of the 4D space that is targeted, we identify two algorithms, namely Lagrange relaxation based aggregated cost (LARAC) and search space reduction delay-cost-constrained routing (SSR+DCCR), that perform very well in most of the 4D evaluation space.

AB - A variety of communication networks, such as industrial communication systems, have to provide strict delay guarantees to the carried flows. Fast and close to optimal quality of service (QoS) routing algorithms, e.g., delay-constrained least-cost (DCLC) routing algorithms, are required for routing flows in such networks with strict delay requirements. The emerging software-defined networking (SDN) paradigm centralizes the network control in SDN controllers that can centrally execute QoS routing algorithms. A wide range of QoS routing algorithms have been proposed in the literature and examined in individual studies. However, a comprehensive evaluation framework and quantitative comparison of QoS routing algorithms that can serve as a basis for selecting and further advancing QoS routing in SDN networks is missing in the literature. This makes it difficult to select the most appropriate QoS routing algorithm for a particular use case, e.g., for SDN controlled industrial communications. We close this gap in the literature by conducting a comprehensive up-to-date survey of centralized QoS routing algorithms. We introduce a novel four-dimensional (4D) evaluation framework for QoS routing algorithms, whereby the four dimensions correspond to the type of topology, two forms of scalability of a topology, and the tightness of the delay constraint. We implemented 26 selected DCLC algorithms and compared their runtime and cost inefficiency within the 4D evaluation framework. While the main conclusion of this evaluation is that the best algorithm depends on the specific sub-space of the 4D space that is targeted, we identify two algorithms, namely Lagrange relaxation based aggregated cost (LARAC) and search space reduction delay-cost-constrained routing (SSR+DCCR), that perform very well in most of the 4D evaluation space.

KW - Delay-constrained least-cost (DCLC) routing

KW - performance evaluation framework

KW - quality of service (QoS)

KW - scalability

KW - software-defined networking (SDN).

UR - http://www.scopus.com/inward/record.url?scp=85029184651&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85029184651&partnerID=8YFLogxK

U2 - 10.1109/COMST.2017.2749760

DO - 10.1109/COMST.2017.2749760

M3 - Article

JO - IEEE Communications Surveys and Tutorials

JF - IEEE Communications Surveys and Tutorials

SN - 1553-877X

ER -