Performance Guarantees in Communication Networks
Performance Guarantees in Communication Networks
On the way to a distributed systems calculus: an end-to-end network calculus with data scaling
SIGMETRICS '06/Performance '06 Proceedings of the joint international conference on Measurement and modeling of computer systems
Tight end-to-end per-flow delay bounds in FIFO multiplexing sink-tree networks
Performance Evaluation
Complex task activation schemes in system level performance analysis
CODES+ISSS '07 Proceedings of the 5th IEEE/ACM international conference on Hardware/software codesign and system synthesis
Tight performance bounds in the worst-case analysis of feed-forward networks
INFOCOM'10 Proceedings of the 29th conference on Information communications
Non preemptive static priority with network calculus: enhancement
MMB'12/DFT'12 Proceedings of the 16th international GI/ITG conference on Measurement, Modelling, and Evaluation of Computing Systems and Dependability and Fault Tolerance
| Hi-index | 0.00 |
Network calculus is a theory designed to compute guaranteed bounds on delays and memory usage for networks. One of its strength is its mathematical framework to function representation and manipulation for network analysis. Up to now, the papers looking at the scheduling with networking consider left-continuous curves, while papers looking at packets with networking consider right-continuous curves. Some other are merging the two, without any consideration on that incompatibility due to a different definition of the functions. This theoretical paper focuses on the mathematical problem of function continuity and especially the continuity of cumulative curves, those applied by the network calculus to represent network dynamics. The right-continuity extension to the network calculus is formalized and compared with the classical left-continuity hypothesis evaluating its impact on some of the main results for network calculus.