An improved credit-based shaper for TSN

Abstract

In response to the growing demands of real-time application scenarios, TSN has emerged as a crucial solution. However, the implementation of a credit-based shaper to ensure low-priority traffic transmission may unintentionally result in burst traffic generation. This could lead to storage overflow and potential data loss, posing a significant challenge to the efficient operation of TSN networks. To address this issue, we propose the ICBS algorithm, an enhancement of the original CBS mechanism, which preserves the fundamental principles of preventing low-priority starvation while mitigating the risk of burst traffic generation. The ICBS algorithm demonstrates enhanced fine-grained operation of data frames by refining the credit calculation method, effectively minimizing the occurrence of bursts in AVB traffic. Furthermore, we have devised an ICBS adaptation evaluation algorithm to assess the rationality of pre-scheduling results for AVB, ensuring optimal resource allocation. The simulation results demonstrate that the proposed ICBS algorithm effectively achieves its objective of low-priority traffic transmission with extra worst-case delay cost, making it a highly suitable substitute for existing TSN shaper solutions. The ICBS algorithm not only enhances the efficiency and reliability of TSN networks but also paves the way for future advancements in real-time application scenarios.