Publication

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

Jean-Yves Le Boudec, Eleni Stai, Ehsan Mohammadpour
2019
Journal Articles

Abstract

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.

Official source

https://infoscience.epfl.ch/entities/publication/bcf36760-9c65-4740-87da-de7171550967

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Graph Chat

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

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

Chat with Graph Search

A contagion process with self-exciting jumps in credit risk applications

Polynomial models in finance

Trade Credit: Literature Review and Research Directions