Dynamic Resource Reservation for Deadline-Guaranteed Admission Control in Distributed Time-Sensitive Networking

Conventional deadline-guaranteed admission control methods in distributed time-sensitive networking (TSN) rely on fixed bandwidth reservations and delay budgets that are unadjustable at runtime, limiting the adaptability and stability of admitting time-critical traffic and hindering the efficient use of residual bandwidth for non-time-critical traffic. In this letter, we propose a novel dynamic resource reservation scheme for distributed admission control. It uses information available in distributed networks to adaptively adjust local deadlines and bandwidth reservations in response to dynamic traffic changes, ensuring end-to-end deadlines for time-critical traffic while maximizing available bandwidth for non-time-critical traffic. We also present the implementation within the resource allocation protocol (RAP) model, eliminating the need for centralized storage and decision-making. Experimental results show that our method avoids the need for pre-configuration based on prior traffic knowledge, increases admissions for time-critical traffic, and enhances available bandwidth for non-time-critical traffic.