15 October 2021 in IEEE Access
Time-sensitive networking (TSN) is a next generation local area network technology for the coexistence of information and operation technology, targeted to industrial automation, in-vehicle networks, and avionic networks in the industrial Internet of Things. This paper presents an up-to-date survey of the research efforts in TSN over the past few years, including the latest efforts in standardization by the IEEE. We review more than 170 TSN-related academic research papers published by major academic publishers and categorize these studies according to the topic, purpose, and methodology, analyzing research trends in TSN. The TSN core function deals with the functional and internal perspective to achieve ultra-low latency/jitter and ultra-reliability. Network management includes work with macroscopic and external views, such as configuration, management, and maintenance of TSN-enabled networks. In particular, we analyze the characteristics of existing studies that have evaluated the TSN network and propose future directions to advance the limits of TSN for real-world deployment. We aim this study to be a cornerstone for fellow and new researchers.
31 October 2023 in IEEE Internet of Things Journal
Time-sensitive networking (TSN) Task Group of the IEEE proposed the frame replication and elimination for reliability (FRER) technique to guarantee reliable transmissions in TSN for the emerging Industrial Internet of Things (IIoT). FRER is a technique that manages the replication and elimination of frames of a stream sent through multiple paths as member streams. However, the standard does not specify how to find and select the multiple paths to send the replicated member streams on, nor how the time-aware shaper (TAS) should be scheduled considering frame elimination. Most prior work on routing or TAS scheduling in TSN do not consider FRER. Conversely, studies on FRER do not address the routing and scheduling issues effectively. In this article, we propose multipath routing and TAS scheduling strategies to support FRER in TSN with reduced complexity. We also identify a scheduling deadlock problem due to the unique characteristics of FRER, and propose a solution using topological sorting. Then, we propose two metaheuristic optimizers to increase the TAS scheduling success rate. Through extensive evaluation against state-of-the-art prior work, we show that our strategies can support more flows with reduced utilization and enhanced schedulability while effectively handling the complexity of routing and scheduling problems for FRER.
18 August 2023 in Computer Networks
9 November 2023 in IEEE Internet of Things Journal
Time-sensitive networking (TSN) strives to provide an ultralow-latency real-time deterministic network for time-critical traffic using the time-aware shaper (TAS) mechanism. For this purpose, methods for routing and scheduling the time-critical flows must be specified. However, this is an NP-hard problem. Although several prior studies have suggested constraint programming (CP)-based approaches, these methods fail to provide a reasonable runtime due to the complexity of the problem. Motivated by this, we propose a TAS co-optimization (TACO) framework that solves the TAS scheduling and routing problem in TSN with a reasonable runtime. As an alternative to CP-based approaches, TACO considers a metaheuristic approach to co-optimize routing, scheduling order, and transmission timing. However, joint optimization through a metaheuristic algorithm is challenging due to the heterogeneous search spaces of the subproblems. Therefore, TACO carefully integrates the search spaces into a single domain and optimizes routing and TAS scheduling jointly with its heuristic algorithm. We evaluate TACO in various industrial networking scenarios to demonstrate that TACO achieves up to an 88% increase in the scheduling success rate with a good convergence rate and an overall low latency/jitter compared to other approaches.
19 November 2026 in Proceedings of the ACM on Networking
As datacenter link bandwidth grows, hop-by-hop flow control (FC) has become essential for rapid congestion suppression by propagating backpressure to pause upstream transmission. However, since this backpressure applies at a per-queue granularity, FC suffers from Head-of-Line (HoL) blocking, where uncongested traffic is throttled unnecessarily when sharing queues with congested flows. The state-of-the-art FC schemes mitigate this by isolating congested flows into separate queues, yet such isolation is fundamentally limited by queue scarcity in commodity switches. This paper rethinks how FC reacts to congestion. Our key observation is that paused queues exhibit highly heterogeneous congestion levels, with many of them still carrying substantial uncongested traffic. Building on this insight, we present G ambit , an FC augmentation that enables opportunistic transmission under HoL blocking. By selectively relaxing pause on less congested queues based on per-queue congestion levels, G ambit allows uncongested flows to make progress by exploiting unused bandwidth, while bounding congestion risks. We verify the hardware feasibility of \gambit by prototyping it on the Intel Tofino switch with P4, and further conduct large-scale trace-driven simulations with production workloads. Our evaluation shows that G ambit effectively recovers the performance of FC lost due to practical queue constraints, reducing average FCT slowdown by up to 49.7% and 33.1%, and short-flow 99th-percentile slowdown by up to 50.6% and 55.6%, for BFC and Pyrrha, respectively.