Improved Credit Bounds for the Credit-Based Shaper in Time-Sensitive Networking

In Time-Sensitive Networking (TSN), it is important to formally prove per-flow latency and backlog bounds. To this end, recent works have applied network calculus and obtained latency bounds from service curves. The latency component of such service curves is directly derived from upper bounds on the values of the credit counters used by the Credit-Based Shaper (CBS), an essential building-block of TSN. In this paper, we derive and formally prove credit upper bounds for the CBS, which improve on existing bounds.


Published in:
IEEE Networking Letters, 1-1
Year:
Jun 26 2019
Keywords:
Laboratories:




 Record created 2019-07-02, last modified 2019-07-03

Fulltext:
Download fulltext
PDF

Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)