PTAS: PIFO-Based Time-Aware Shaper for Massive Concurrent Flows in Time-Sensitive Networks

Time-sensitive networking (TSN) specifies a time-aware shaper (TAS) to enhance the real-time support of Ethernet for time-triggered traffic. In TAS, flow/frame isolation is necessary for obtaining a deterministic queuing order, which is the key to achieving determinism. However, this isolation is difficult to fulfill when accessing a large number of concurrent flows generated by industrial devices without TSN capabilities due to the uncontrollable sending times and a limited number of egress queues in TAS. In this paper, a novel TAS framework is designed for massive concurrent flows, named push-in-first-out (PIFO) based time-aware shaper (PTAS). Specifically, the PTAS takes advantage of a PIFO queue to buffer and sort all time-triggered frames based on expected sending time (EST), while an ephemeral memory EST allocation algorithm is proposed to obtain ESTs that can ensure a deterministic queuing order. Through frame sorting rather than conventional isolation, the PTAS efficiently provides a deterministic transmission guarantee for massive concurrent flows. Furthermore, the deterministic flow scheduling constraints for the PTAS are derived, based on which the PTAS is proven to have better schedulability than conventional TAS. In addition to simulation, the PTAS is also implemented on a TSN testbed for evaluation. Extensive experimental results demonstrate that the PTAS can reduce up to 37.0% maximum end-to-end latency, 98.8% jitter, and save 40.1% queue resources in high-concurrency scenarios while scheduling up to 15.5% more flows as compared with conventional TAS.

• Publication year

  2025

• Venue

  IEEE Transactions on Network Science and Engineering

• Publication date

  2025-01-01

• Fields of study

  Computer Science, Engineering

• Identifiers
  DOI 10.1109/TNSE.2024.3486038
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• DR-PIFO: A Dynamic Ranking Packet Scheduler Using a Push-In-First-Out Queue

  2024cited by this paper
• DecAge: Decentralized Flow Scheduling for Industrial 5G and TSN Integrated Networks

  2024cited by this paper
• reTSN: Resilient and Efficient Time-Sensitive Network for Automotive In-Vehicle Communication

  2023cited by this paper
• Enabling Time-Sensitive Network Management Over Multi-Domain Wired/Wi-Fi Networks

  2023cited by this paper
• Burst-Aware Time-Triggered Flow Scheduling With Enhanced Multi-CQF in Time-Sensitive Networks

  2023cited by this paper
• Deterministic Latency Bounded Network Slice Deployment in IP-Over-WDM Based Metro-Aggregation Networks

  2022cited by this paper
• A Survey of Intelligent Network Slicing Management for Industrial IoT: Integrated Approaches for Smart Transportation, Smart Energy, and Smart Factory

  2022cited by this paper
• TC-Flow: Chain Flow Scheduling for Advanced Industrial Applications in Time-Sensitive Networks

  2022cited by this paper
• An interoperable and flat Industrial Internet of Things architecture for low latency data collection in manufacturing systems

  2022cited by this paper
• AI-Native Network Slicing for 6G Networks

  2021cited by this paper
• Improving Latency Analysis for Flexible Window-Based GCL Scheduling in TSN Networks by Integration of Consecutive Nodes Offsets

  2021cited by this paper
• Latency-Efficient VNF Deployment and Path Routing for Reliable Service Chain

  2021cited by this paper
• Deadline-Aware Task Offloading With Partially-Observable Deep Reinforcement Learning for Multi-Access Edge Computing

  2021cited by this paper
• How to Optimize Joint Routing and Scheduling Models for TSN Using Integer Linear Programming

  2021cited by this paper
• Enhancing Schedulability and Throughput of Time-Triggered Traffic in IEEE 802.1Qbv Time-Sensitive Networks

  2020cited by this paper
• Moving a step forward in the quest for Deterministic Networks (DetNet)

  2020cited by this paper
• SP-PIFO: Approximating Push-In First-Out Behaviors using Strict-Priority Queues

  2020cited by this paper
• Size-based queuing: an approach to improve bandwidth utilization in TSN networks

  2019cited by this paper
• An empirical model of packet processing delay of the Open vSwitch

  2017cited by this paper

• Frame Dynamic Priority Scheduling With Graph Theory Based Traffic Grouping and Routing Co-Design for Wireless Time-Sensitive Networking

  2026cites this paper
• Industrial Value Symbiont in the context of Industrial Symbiosis: Retrospect and prospect

  2026cites this paper
• Fine-Grained Latency Control Time-Sensitive Networking With Low Deployment Cost

  2026cites this paper
• Optimized CQF Scheduling in TSN: A Formal Architecture-Based Neuro-Tabu Optimized Scheduling Algorithm

  2025cites this paper