Finding the upper envelope of n line segments in O(n log n) time
Information Processing Letters
On numbers of Davenport-Schinzel sequences
Discrete Mathematics
Algorithmic geometry
Performance Guarantees in Communication Networks
Performance Guarantees in Communication Networks
Introduction to Algorithms
Davenport--Schinzel Sequences and Their Geometric Applications
Davenport--Schinzel Sequences and Their Geometric Applications
Conjugate network calculus: a dual approach applying the Legendre transform
Computer Networks: The International Journal of Computer and Telecommunications Networking - Selected papers from the 3rd international workshop on QoS in multiservice IP networks (QoS-IP 2005)
The DISCO network calculator: a toolbox for worst case analysis
valuetools '06 Proceedings of the 1st international conference on Performance evaluation methodolgies and tools
Network calculus: a theory of deterministic queuing systems for the internet
Network calculus: a theory of deterministic queuing systems for the internet
Optimal routing for end-to-end guarantees using Network Calculus
Performance Evaluation
Computation of a (min,+) multi-dimensional convolution for end-to-end performance analysis
Proceedings of the 3rd International Conference on Performance Evaluation Methodologies and Tools
Tight performance bounds in the worst-case analysis of feed-forward networks
INFOCOM'10 Proceedings of the 29th conference on Information communications
NC-maude: a rewriting tool to play with network calculus
ISoLA'10 Proceedings of the 4th international conference on Leveraging applications of formal methods, verification, and validation - Volume Part I
DEBORAH: a tool for worst-case analysis of FIFO tandems
ISoLA'10 Proceedings of the 4th international conference on Leveraging applications of formal methods, verification, and validation - Volume Part I
Causality closure for a new class of curves in real-time calculus
Proceedings of the 1st International Workshop on Worst-Case Traversal Time
An efficient and simple class of functions to model arrival curve of packetised flows
Proceedings of the 1st International Workshop on Worst-Case Traversal Time
Runtime improved computation of path latencies with the real-time calculus
Proceedings of the 1st International Workshop on Worst-Case Traversal Time
Arrival curves for real-time calculus: the causality problem and its solutions
TACAS'10 Proceedings of the 16th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Combining network calculus and scheduling theory to improve delay bounds
Proceedings of the 20th International Conference on Real-Time and Network Systems
Container of (min, +)-linear systems
Discrete Event Dynamic Systems
| Hi-index | 0.00 |
Network calculus offers powerful tools to analyze theperformances in communication networks, in particular to obtaindeterministic bounds. This theory is based on a strong mathematicalground, notably by the use of (min,+) algebra. However, thealgorithmic aspects of this theory have not been much addressedyet. This paper is an attempt to provide some efficient algorithmsimplementing network calculus operations for some classicalfunctions. Some functions which are often used are the piecewiseaffine functions which ultimately have a constant growth. As afirst step towards algorithmic design, we present a classcontaining these functions and closed under the main networkcalculus operations (min, max, +, -, convolution, subadditiveclosure, deconvolution): the piecewise affine functions which areultimately pseudo-periodic. They can be finitely described, whichenables us to propose some algorithms for each of the networkcalculus operations. We finally analyze their computationalcomplexity.