A first Network Calculus model for Cyclic Queuing and Forwarding - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2023

A first Network Calculus model for Cyclic Queuing and Forwarding

Un premier modèle en calcul réseau du mécanisme CQF

Résumé

Cyclic Queuing and Forwarding (CQF) is a mechanism of the IEEE TSN Group for providing guaranteed latency and jitter in a network. CQF deals with a common cycle time in the network and during one cycle, one queue is queuing the arriving frames when a second one is forwarding the previously queued frames. The roles are inverted at each cycle. To analyze this mechanism, we use the Network Calculus theory. It makes the computation of bounds on the delay possible and it is now largely used in the network analysis. In this paper, we show that the burstiness does not increase along the path and we provide a residual capacity for the low priority flows.
Fichier principal
Vignette du fichier
DTIS23092.1685016303.pdf (252.95 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-04171262 , version 1 (26-07-2023)

Identifiants

  • HAL Id : hal-04171262 , version 1

Citer

Damien Guidolin--Pina, Marc Boyer. A first Network Calculus model for Cyclic Queuing and Forwarding. Junior Researcher Workshop on Real-Time Computing, Jun 2023, DORTMUND, Germany. ⟨hal-04171262⟩

Collections

ONERA
79 Consultations
88 Téléchargements

Partager

Gmail Facebook X LinkedIn More