Reproduce “Sub-additive service curves in the Network Calculus analysis” on OpenResearch
Turn your favorite coding agents into research agents that review literature, develop hypotheses, and run experiments.
Universal app for Apple silicon and Intel. Requires macOS 11 or later.
About this paper
Anne Bouillard
The authors derive nonnegative per-flow min-plus service guarantees from aggregate service curves under blind multiplexing, using sub-additivity rather than requiring strict service curves. The theorem assumes a nonnegative, nondecreasing, left-continuous, sub-additive aggregate curve, and the residual guarantee need not be sub-additive. In the reported tandem model, PMOO yields tighter calculated delay bounds than negative-service analysis; this does not establish a feedback solution.
Summary by alphaXiv.
Tip: change arxiv.org to autoarxiv.org in any arXiv abstract link to open the paper here.