Introduction to algorithms
IEEE/ACM Transactions on Networking (TON)
Modern heuristic techniques for combinatorial problems
IEEE/ACM Transactions on Networking (TON)
Morphological signal processing and the slope transform
Signal Processing - Special issue on mathematical morphology and its applications to signal processing
A fast computational algorithm for the Legendre-Fenchel transform
Computational Optimization and Applications
Towards real-time measurement of traffic control parameters
Computer Networks: The International Journal of Computer and Telecommunications Networking - Special Issue: performance modeling and evaluation of ATM networks
A dual approach to network calculus applying the legendre transform
QoS-IP'05 Proceedings of the Third international conference on Quality of Service in Multiservice IP Networks
Slope transforms: theory and application to nonlinear signalprocessing
IEEE Transactions on Signal Processing
A calculus for network delay. I. Network elements in isolation
IEEE Transactions on Information Theory
A calculus for network delay. II. Network analysis
IEEE Transactions on Information Theory
On the Identifiability of Link Service Curves from End-Host Measurements
Network Control and Optimization
Residuated pairs in network analysis
APCC'09 Proceedings of the 15th Asia-Pacific conference on Communications
A system-theoretic approach to bandwidth estimation
IEEE/ACM Transactions on Networking (TON)
A calculus for SLA delay properties
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
Container of (min, +)-linear systems
Discrete Event Dynamic Systems
| Hi-index | 0.00 |
Network calculus is a theory of deterministic queuing systems that has successfully been applied to derive performance bounds for communication networks. Founded on min-plus convolution and de-convolution, network calculus obeys a strong analogy to system theory. Yet, system theory has been extended beyond the time domain applying the Fourier transform thereby allowing for an efficient analysis in the frequency domain. A corresponding dual domain for network calculus has not been elaborated, so far. In this paper we show that in analogy to system theory such a dual domain for network calculus is given by convex/concave conjugates referred to also as the Legendre transform. We provide solutions for dual operations and show that min-plus convolution and de-convolution become simple addition and subtraction in the Legendre domain. Additionally, we derive expressions for the Legendre domain to determine upper bounds on backlog and delay at a service element and provide representative examples for the application of conjugate network calculus.