IEEE/ACM Transactions on Networking (TON)
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
Performance Guarantees in Communication Networks
Performance Guarantees in Communication Networks
Worst case burstiness increase due to FIFO multiplexing
Performance Evaluation
A parameter based admission control for differentiated services networks
Computer Networks: The International Journal of Computer and Telecommunications Networking - QoS in multiservice IP networks
Delay bounds for FIFO aggregates: a case study
Computer Communications
Traffic shaping in aggregate-based networks: implementation and analysis
Computer Communications
Network calculus: a theory of deterministic queuing systems for the internet
Network calculus: a theory of deterministic queuing systems for the internet
Slope transforms: theory and application to nonlinear signalprocessing
IEEE Transactions on Signal Processing
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)
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)
| Hi-index | 0.00 |
Network calculus has successfully been applied to derive service guarantees for per-flow Integrated Services networks. Recent extensions also allow providing performance bounds for aggregate-based Differentiated Services domains, but with a significant increase in complexity. Further on, a number of issues still remain unsolved or are not well understood yet. Founded on convolution and de-convolution, network calculus obeys a strong analogy to system theory. However, system theory has been extended beyond the time domain, applying the Fourier transform and 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 the Legendre transform. We provide solutions for dual operations and show that min-plus convolution and de-convolution become simple addition and subtraction in Legendre space. Finally we address an aggregate scheduling example, where the Legendre transform allows deriving a new, explicit, and clear solution.