The DOI matches its Crossref record.
Incremental Flow Scheduling and Routing in Time-Sensitive Software-Defined Networks
Abstract
Several networking architectures have been developed atop IEEE 802.3 networks to provide real-time communication guarantees for time-sensitive applications in industrial automation systems. The basic principle underlying these technologies is the precise transmission scheduling of time-triggered traffic through the network for providing deterministic and bounded latency and jitter. These transmission schedules are typically synthesized offline (computational time in the order of hours) and remain fixed thereafter, making it difficult to dynamically add or remove network applications. This paper presents algorithms for incrementally adding time-triggered flows in a time-sensitive software-defined network (TSSDN). The TSSDN is a network architecture based on software-defined networking, which provides real-time guarantees for time-triggered flows by scheduling their transmissions on the hosts (network edge) only. These algorithms exploit the global view of the control plane on the data plane to schedule and route time-triggered flows needed for the dynamic applications in the Industrial Internet of Things (Industry 4.0). The evaluations show that these algorithms can compute incremental schedules for time-triggered flows in subseconds with an average relative optimality of 68%.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Cited by
Edge Computing in Industrial Internet of Things: Architecture, Advances and Challenges
Qiu, T., Chi, J., Zhou, X., Ning, Z., Atiquzzaman, M., & Wu, D. O. (2020) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2020.3009103 · Cited by 857
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
SDN-based Self-Configuration for Time-Sensitive IoT Networks
Bulbul, N. S., Ergenc, D., & Fischer, M. (2021) · 2021 IEEE 46th Conference on Local Computer Networks (LCN) · doi:10.1109/lcn52139.2021.9524979 · Cited by 32
Metadata
- Authors
- Nayak, N. G., Durr, F., & Rothermel, K.
- Venue
- IEEE Transactions on Industrial Informatics
- Published
- 2018-05
- Volume
- 14
- Issue
- 5
- Pages
- 2066-2075
- ISSN
- 1551-3203 (ISSN-L)
- 1941-0050
- OpenAlex
- W2772610583
- Cited by
- 229
- References
- 0
- FWCI
- 7.15
- Type
- journal article
- Language
- en
- Open access
- closed
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Incremental Flow Scheduling and Routing in Time-Sensitive Software-Defined Networks. https://app.cochat.ai/papers/10.1109/tii.2017.2782235
- The paper
- Nayak, N. G., Durr, F., & Rothermel, K. (2018). Incremental Flow Scheduling and Routing in Time-Sensitive Software-Defined Networks. IEEE Transactions on Industrial Informatics. https://doi.org/10.1109/tii.2017.2782235
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.