A theory of traffic regulators for deterministic networks with application to interleaved regulators
JY Le Boudec - IEEE/ACM Transactions on Networking, 2018 - ieeexplore.ieee.org
We introduce Pi-regulation, a new definition of traffic regulation which extends both the
arrival curves of network calculus and Chang's max-plus g-regulation, and also includes …
arrival curves of network calculus and Chang's max-plus g-regulation, and also includes …
DeepTMA: Predicting effective contention models for network calculus using graph neural networks
Network calculus computes end-to-end delay bounds for individual data flows in networks of
aggregate schedulers. It searches for the best model bounding resource contention between …
aggregate schedulers. It searches for the best model bounding resource contention between …
Performance modeling of softwarized network services based on queuing theory with experimental validation
J Prados-Garzon, P Ameigeiras… - IEEE Transactions …, 2019 - ieeexplore.ieee.org
Network Functions Virtualization facilitates the automation of the scaling of softwarized
network services (SNSs). However, the realization of such a scenario requires a way to …
network services (SNSs). However, the realization of such a scenario requires a way to …
A survey on network calculus tools for network infrastructure in real-time systems
B Zhou, I Howenstine, S Limprapaipong… - IEEE Access, 2020 - ieeexplore.ieee.org
Network Calculus is an established analytical framework which can provide deterministic
estimates of latency and buffer requirements for feed-forward packet-switched …
estimates of latency and buffer requirements for feed-forward packet-switched …
Analysis of TSN for industrial automation based on network calculus
J Zhang, L Chen, T Wang… - 2019 24th IEEE …, 2019 - ieeexplore.ieee.org
Time-Sensitive Networking (TSN) Ethernet is becoming a primary industrial networking
technology, since it provides bounded latency capability with broad reaching ecosystem …
technology, since it provides bounded latency capability with broad reaching ecosystem …
Trade-off between accuracy and tractability of network calculus in FIFO networks
A Bouillard - Performance Evaluation, 2022 - Elsevier
Computing accurate deterministic performance bounds is a strong need for communication
technologies having stringent requirements on latency and reliability. Within new scheduling …
technologies having stringent requirements on latency and reliability. Within new scheduling …
Network calculus for bounding delays in feedforward networks of FIFO queueing systems
A Scheffler, S Bondorf - … of Systems: 18th International Conference, QEST …, 2021 - Springer
Networks for safety-critical operation must guarantee deterministic bounds on the end-to-
end delay of data transmission despite the usually many data flows that all share the …
end delay of data transmission despite the usually many data flows that all share the …
Tightening network calculus delay bounds by predicting flow prolongations in the FIFO analysis
Network calculus offers the means to compute worst-case traversal times based on
interpreting a system as a queueing network. A major strength of network calculus is its strict …
interpreting a system as a queueing network. A major strength of network calculus is its strict …
Bounding the delays of the MPPA network-on-chip with network calculus: Models and benchmarks
M Boyer, A Graillat, BD De Dinechin, J Migge - Performance Evaluation, 2020 - Elsevier
The Kalray MPPA2-256 processor integrates 256 processing cores and 32 management
cores on a chip. These cores are grouped into clusters and clusters are connected by a high …
cores on a chip. These cores are grouped into clusters and clusters are connected by a high …
Graph-based deep learning for fast and tight network calculus analyses
Network Calculus (NC) computes end-to-end delay bounds for individual data flows in
networks of aggregate schedulers. It searches for the best model bounding resource …
networks of aggregate schedulers. It searches for the best model bounding resource …