The DOI matches its Crossref record; 6 of the 6 references it cites were found in a registry or an index.
Unicast QoS Routing Algorithms for SDN: A Comprehensive Survey and Performance Evaluation
Open accessAbstract
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 leastcost (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 4D 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.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
A Formal Basis for the Heuristic Determination of Minimum Cost Paths
Hart, P., Nilsson, N., & Raphael, B. (1968) · IEEE Transactions on Systems Science and Cybernetics · doi:10.1109/tssc.1968.300136 · Cited by 12,738
Wollschlaeger, M., Sauter, T., & Jasperneite, J. (2017) · IEEE Industrial Electronics Magazine · doi:10.1109/mie.2017.2649104 · Cited by 1,726
A survey on software-defined network and openflow: From concept to implementation
Hu, F., Hao, Q., & Bao, K. (2014) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2014.2326417 · Cited by 752
Internet of Things Architecture: Recent Advances, Taxonomy, Requirements, and Open Challenges
Yaqoob, I., Ahmed, E., Hashem, I. A. T., Ahmed, A. I. A., Gani, A., Imran, M., & Guizani, M. (2017) · IEEE Wireless Communications · doi:10.1109/mwc.2017.1600421 · Cited by 668
A roadmap for traffic engineering in SDN-OpenFlow networks
Akyildiz, I. F., Lee, A., Wang, P., Luo, M., & Chou, W. (2014) · Computer Networks · doi:10.1016/j.comnet.2014.06.002 · Cited by 536
Comparative Examination on Architecture and Protocol of Industrial Wireless Sensor Network Standards
Wang, Q., & Jiang, J. (2016) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2016.2548360 · Cited by 182
Cited by
Xie, J., Yu, F. R., Huang, T., Xie, R., Liu, J., Wang, C., & Liu, Y. (2019) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2018.2866942 · Cited by 700
Ultra-Low Latency (ULL) Networks: The IEEE TSN and IETF DetNet Standards and Related 5G ULL Research
Nasrallah, A., Thyagaturu, A. S., Alharbi, Z., Wang, C., Shao, X., Reisslein, M., & ElBakoury, H. (2019) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2018.2869350 · Cited by 695
Self-citationHybrid SDN Networks: A Survey of Existing Approaches
Amin, R., Reisslein, M., & Shah, N. (2018) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2018.2837161 · Cited by 352
Self-citationGhaleb, B., Al-Dubai, A. Y., Ekonomou, E., Alsarhan, A., Nasser, Y., Mackenzie, L. M., & Boukerche, A. (2019) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2018.2874356 · Cited by 333
Metadata
- Authors
- Guck, J. W., Van Bemten, A., Reisslein, M., & Kellerer, W.
- Venue
- IEEE Communications Surveys & Tutorials
- Published
- 2018
- Volume
- 20
- Issue
- 1
- Pages
- 388-415
- ISSN
- 1553-877X (ISSN-L)
- OpenAlex
- W2753412869
- Cited by
- 177
- References
- 6
- FWCI
- 13.39
- Type
- journal article
- Language
- en
- Open access
- green
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
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.