Research Article
Worst-case delay bounds with fixed priorities using network calculus
@INPROCEEDINGS{10.4108/icst.valuetools.2011.245603, author={Aurore Junier and Anne Bouillard}, title={Worst-case delay bounds with fixed priorities using network calculus}, proceedings={5th International ICST Conference on Performance Evaluation Methodologies and Tools}, publisher={ICST}, proceedings_a={VALUETOOLS}, year={2012}, month={6}, keywords={network calculus worst-case performance linear programming fixed priorities}, doi={10.4108/icst.valuetools.2011.245603} }
- Aurore Junier
Anne Bouillard
Year: 2012
Worst-case delay bounds with fixed priorities using network calculus
VALUETOOLS
ICST
DOI: 10.4108/icst.valuetools.2011.245603
Abstract
Worst-case delay bounds are an important issue for applications with hard time constraints. Network calculus is a useful theory to study worst-case performance bounds in networks. In this article, we focus on networks with fixed priority service policy and provide methods to analyze systems where the traffic and the services are constrained by some minimum and/or maximum functions: arrival/service curves. Our approach uses linear programming to express constraints of network calculus.
Our first approach refines an existing method by taking into account fixed priorities. Then we improve that bound by mixing this method with other ones and provide a lower bound of the worst-case delay. Finally, numerical experiments are used to compare those bounds.