DTPF Algorithm Based Open-Source Time-Sensitive Network Leveraging SDN Architecture
No Thumbnail Available
Date
2023
Authors
Journal Title
Journal ISSN
Volume Title
Publisher
Institute of Electrical and Electronics Engineers Inc.
Abstract
Time-Sensitive Networking (TSN) has enabled a lot of advancements in industrial automation, aviation, tactile networking, and other ad-hoc networking applications. The bounded latency, reliability, and self-recovering mechanisms for a network are some of the core attributes of the TSN architecture. The reliability of bench-marking of a given TSN architecture, when done with simulators, will not match with that of hardware systems. But the TSN hardware needs more capital investment along with more development time as it involves understanding the hardware-specific parameters. The research in this paper has solved this shortcoming by implementing an open-source and secured SDN(Software Defined Networking)-based TSN framework integrating IEEE's 802.1 Qbv and 802.1Qcc standards. The novelty of implementation involves i) Realization of Centralized User Configuration (CUC), Centralized Network Configuration (CNC) with open source tools. ii) An algorithm called Dynamic TSN Path Finder (DTPF) is implemented for automatically identifying TSN edges participating in TSN flow. iii) Emulation of hardware environment leveraging Linux-based queuing disciplines and traffic shapers. This unique open source-based TSN architecture is then tested with both TSN and Non-TSN traffic, to demonstrate the gating logic and the delay characteristics based on queuing discipline when applied to virtual queues. © 2013 IEEE.
Description
Keywords
Application programs, Computer architecture, Computer circuits, Computer operating systems, Logic gates, Network architecture, Open source software, Open systems, Optimization, Software defined networking, Hardware, IEEE protocol, Job-Shop scheduling, Open-source, Queuing discipline, Schedule, Scheduling, Software, Software-defined networkings, Time-sensitive networking, Queueing theory
Citation
IEEE Access, 2023, 11, , pp. 71037-71047
