Details
| Original language | English |
|---|---|
| Title of host publication | Quality of Service in Multiservice IP Networks |
| Subtitle of host publication | Third International Workshop, QoS-IP 2005 |
| Pages | 33-48 |
| Number of pages | 16 |
| Publication status | Published - 2005 |
| Externally published | Yes |
| Event | Third International Workshop on Quality of Service in Multiservice IP Networks, QoS-IP 2005 - Catania, Italy Duration: 2 Feb 2005 → 4 Feb 2005 |
Publication series
| Name | Lecture Notes in Computer Science |
|---|---|
| Publisher | Springer Verlag |
| Volume | 3375 |
| ISSN (Print) | 0302-9743 |
Abstract
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.
ASJC Scopus subject areas
- Mathematics(all)
- Theoretical Computer Science
- Computer Science(all)
- General Computer Science
Cite this
- Standard
- Harvard
- Apa
- Vancouver
- BibTeX
- RIS
Quality of Service in Multiservice IP Networks: Third International Workshop, QoS-IP 2005. 2005. p. 33-48 (Lecture Notes in Computer Science; Vol. 3375).
Research output: Chapter in book/report/conference proceeding › Conference contribution › Research › peer review
}
TY - GEN
T1 - A Dual Approach to Network Calculus Applying the Legendre Transform
AU - Fidler, Markus
AU - Recker, Stephan
PY - 2005
Y1 - 2005
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=24144460260&partnerID=8YFLogxK
U2 - 10.1007/978-3-540-30573-6_3
DO - 10.1007/978-3-540-30573-6_3
M3 - Conference contribution
AN - SCOPUS:24144460260
T3 - Lecture Notes in Computer Science
SP - 33
EP - 48
BT - Quality of Service in Multiservice IP Networks
T2 - Third International Workshop on Quality of Service in Multiservice IP Networks, QoS-IP 2005
Y2 - 2 February 2005 through 4 February 2005
ER -