Dynamic Per-Flow Queues in Shared Buffer TSN Switches
Buffer (optical fiber)
DOI:
10.1145/3718087
Publication Date:
2025-02-19T11:19:52Z
AUTHORS (6)
ABSTRACT
Time-Sensitive Networking (TSN), as an enhancement based on Ethernet, can ensure deterministic traffic transmission with low delays and minimal jitters. However, TSN switches have only eight priority queues inherited from Ethernet at each egress port, which limits the flexibility efficiency of scheduling, well support for developing management mechanisms. Although per-flow boost scheduling Quality Service (QoS), static hardware in are considered unpratical due to resource limits. In this paper, we leverage limitation buffer size number concurrent flows shared design Dynamic Per-Flow Queues (DFQ). DFQ maintains a fixed virtual determined by dynamically manages mapping between active provide capability queueing. By constructing Flow Mapping Table (FMT) content-addressable memory (or hash bucket), quickly match, create, recycle multiplex limited switch resource. We prototype FPGA evaluate its performance different scenarios. Experimental results show that decrease overhead isolation impact delay throughput, indicating is effective solution.
SUPPLEMENTAL MATERIAL
Coming soon ....
REFERENCES (48)
CITATIONS (0)
EXTERNAL LINKS
PlumX Metrics
RECOMMENDATIONS
FAIR ASSESSMENT
Coming soon ....
JUPYTER LAB
Coming soon ....