This repo aims to solve the worst-case delay of relatively complicated network architecture with [1] Trajectory Approach; [2] Network Calculus; [3] Compositional Performance Analysis (CPA); and [4] Flow Aggregation and summarize both advantages and disadvantages of each approach and strives to seek out the optimal method under specific scenarios.

Additionally, while each approach here has advantages and shortcomings, they often provide different delay bounds with more or less pessimism, and a comprehensive comparison is still missing. More than this, when one considers a switched network (e.g., Ethernet, TSN, AFDX, NoC), how sending protocol2 and network topology 3 settings affect data/packet transmission within the web is insufficiently discussed, which leads that the worst-case delay analysis is often studied under a specified networking scenario, in other words, the formalization of worst-case delay analysis remains difficult to be generalized.

If you find this work helpful, please cite us:

@INPROCEEDINGS{10639705,
  author={Yang, Lijie and Docquier, Théo and Thomas, Ludovic and Song, Ye-Qiong},
  booktitle={2024 IEEE 49th Conference on Local Computer Networks (LCN)}, 
  title={Blocking-Waived Estimation: Improving the Worst-Case End-To-End Delay Analysis in Switched Ethernet}, 
  year={2024},
  volume={},
  number={},
  pages={1-9},
  keywords={Upper bound;Virtual links;Estimation;Switches;Network architecture;Real-time systems;Explosions;Switched Ethernet;Worst-Case Delay Analysis;Real-time Scheduling;AFDX},
  doi={10.1109/LCN60385.2024.10639705}}

Lijie Yang. Worst-case delay analysis: a simulation-based comparison between Flow Aggregation and CPA. LORIA (Université de Lorraine, CNRS, INRIA); Carnegie Mellon University. 2023. ⟨hal-03970717⟩