Cited by 255Software-Defined Networks and 5GAdvanced Optical Network TechnologiesNetwork Traffic and Congestion Control

QoS-Aware Adaptive Routing in Multi-layer Hierarchical Software Defined Networks: A Reinforcement Learning Approach

Lin, Shih-Chun, Akyildiz, Ian F., Wang, Pu, Luo, Min·2016·2016 IEEE International Conference on Services Computing (SCC)

Abstract

Software-defined networks (SDNs) have been recognized as the next-generation networking paradigm that decouples the data forwarding from the centralized control. To realize the merits of dedicated QoS provisioning and fast route (re-)configuration services over the decoupled SDNs, various QoS requirements in packet delay, loss, and throughput should be supported by an efficient transportation with respect to each specific application. In this paper, a QoS-aware adaptive routing (QAR) is proposed in the designed multi-layer hierarchical SDNs. Specifically, the distributed hierarchical control plane architecture is employed to minimize signaling delay in large SDNs via three-levels design of controllers, i.e., the super, domain (or master), and slave controllers. Furthermore, QAR algorithm is proposed with the aid of reinforcement learning and QoS-aware reward function, achieving a time-efficient, adaptive, QoS-provisioning packet forwarding. Simulation results confirm that QAR outperforms the existing learning solution and provides fast convergence with QoS provisioning, facilitating the practical implementations in large-scale software service-defined networks.

Integrity signals

Registry

Crossref · 10.1109/scc.2016.12

Cites

17 of 17 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Claims the paper makes

This paper’s full text isn’t openly available, so its claims and self-check weren’t run. The registry and citation checks still apply.

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

Cites

Flagged first, then by citations

Cited by

Sorted by citations

Authors
Lin, S.-C., Akyildiz, I. F., Wang, P., & Luo, M.
Affiliations
  • Georgia Institute of Technology (US)
  • Wichita State University (US)
  • Huawei Technologies (China) (CN)
Venue
2016 IEEE International Conference on Services Computing (SCC)
Publisher
IEEE
Published
2016-06
Pages
25-33
OpenAlex
W2512877821
Cited by
255
References
17
Citations by year
2026: 3 · 2025: 9 · 2024: 21 · 2023: 33 · 2022: 24 · 2021: 51 · 2020: 41 · 2019: 38 · 2018: 29 · 2017: 6
FWCI
20.79
Type
conference paper
Language
en
Open access
closed
Locations
  • IEEE International Conference on Services Computing (publishedVersion)
  • Holmes Museum Of Anthropology (Wichita State University) (submittedVersion)
Topics
  • Physical Sciences › Computer Science › Computer Networks and Communications › Software-Defined Networks and 5G
  • Physical Sciences › Engineering › Electrical and Electronic Engineering › Advanced Optical Network Technologies
  • Physical Sciences › Computer Science › Computer Networks and Communications › Network Traffic and Congestion Control
Keywords
software-defined networking, reinforcement learning, domain controller, reward function design, packet delay, packet loss, throughput

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review