The DOI matches its Crossref record; 7 of the 7 references it cites were found in a registry or an index.
No-wait Packet Scheduling for IEEE Time-sensitive Networks (TSN)
Abstract
The IEEE Time-sensitive Networking (TSN) Task Group has recently standardized enhancements for IEEE 802.3 networks for enabling it to transport time-triggered traffic (aka scheduled traffic) providing them with stringent bounds on network delay and jitter while also transporting best-effort traffic. These enhancements primarily include dedicating one queue per port of the switch for scheduled traffic along with a programmable gating mechanism that dictates which of the queues are to be considered for transmission. While the IEEE 802.1Qbv standards define these mechanisms to handle scheduled traffic, it stops short of specifying algorithms to compute fine-grained link schedules for the streams of scheduled traffic. Further, the mechanisms in TSN require creation of so-called guard bands to isolate scheduled traffic from the best-effort traffic. These guard bands may potentially result in bandwidth wastage, and hence schedules with lower number of guard bands are preferred. In this paper, we introduce the No-wait Packet Scheduling Problem (NW-PSP) for modelling the scheduling in IEEE Time-sensitive Networks and map it to the No-wait Job-shop Scheduling Problem (NW-JSP), a well-known problem from the field of operational research. In particular, we present a Tabu search algorithm for efficient computing of schedules and a schedule compression technique to reduce number of guard bands in schedule. Our evaluations show that our Tabu search algorithm can compute near-optimal schedules for over 1500 flows and the subsequent schedule compression reduces the number of guard bands on an average by 24%.
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
Cites
Emergence of Scaling in Random Networks
Barabási, A.-L., & Albert, R. (1999) · Science · doi:10.1126/science.286.5439.509 · Cited by 36,135
Glover, F. (1990) · Interfaces · doi:10.1287/inte.20.4.74 · Cited by 1,092
Real-time fieldbus communications using Profibus networks
Tovar, E., & Vasques, F. (1999) · IEEE Transactions on Industrial Electronics · doi:10.1109/41.808018 · Cited by 206
Time-sensitive Software-defined Network (TSSDN) for Real-time Applications
Nayak, N. G., Dürr, F., & Rothermel, K. (2016) · Proceedings of the 24th International Conference on Real-Time Networks and Systems · doi:10.1145/2997465.2997487 · Cited by 168
Self-citationCombined task- and network-level scheduling for distributed time-triggered systems
Craciunas, S. S., & Oliver, R. S. (2016) · Real-Time Systems · doi:10.1007/s11241-015-9244-x · Cited by 159
SMT-based Task- and Network-level Static Schedule Generation for Time-Triggered Networked Systems
Craciunas, S. S., & Oliver, R. S. (2014) · International Conference on Real-Time Networks and Systems (RTNS) · doi:10.1145/2659787.2659812 · Cited by 102
Synthesis of communication schedules for TTEthernet-based mixed-criticality systems
Tămaş–Selicean, D., Pop, P., & Steiner, W. (2012) · International Conference on Hardware/Software Codesign and System Synthesis · doi:10.1145/2380445.2380518 · Cited by 96
Cited by
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
Metadata
- Authors
- Dürr, F., & Nayak, N. G.
- Venue
- Proceedings of the 24th International Conference on Real-Time Networks and Systems
- Publisher
- ACM
- Published
- 2016-10-19
- Pages
- 203-212
- OpenAlex
- W2535707672
- Cited by
- 348
- References
- 7
- FWCI
- 8.31
- Type
- conference paper
- 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: No-wait Packet Scheduling for IEEE Time-sensitive Networks (TSN). https://app.cochat.ai/papers/10.1145/2997465.2997494
- The paper
- Dürr, F., & Nayak, N. G. (2016). No-wait Packet Scheduling for IEEE Time-sensitive Networks (TSN). Proceedings of the 24th International Conference on Real-Time Networks and Systems. https://doi.org/10.1145/2997465.2997494
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.