Performance Guarantees in Communication Networks
Performance Guarantees in Communication Networks
Embedded Software in Network Processors - Models and Algorithms
EMSOFT '01 Proceedings of the First International Workshop on Embedded Software
Tight end-to-end per-flow delay bounds in FIFO multiplexing sink-tree networks
Performance Evaluation
Stochastic and deterministic performance evaluation of automotive CAN communication
Computer Networks: The International Journal of Computer and Telecommunications Networking
Network calculus: a theory of deterministic queuing systems for the internet
Network calculus: a theory of deterministic queuing systems for the internet
Tight performance bounds in the worst-case analysis of feed-forward networks
INFOCOM'10 Proceedings of the 29th conference on Information communications
| Hi-index | 0.00 |
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 a 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.