Transformation-Based Network Calculus Applying Convex/Concave Conjugates

Publikation: Beitrag in Buch/Bericht/Sammelwerk/KonferenzbandAufsatz in KonferenzbandForschungPeer-Review

Autoren

Externe Organisationen

  • Rheinisch-Westfälische Technische Hochschule Aachen (RWTH)
  • IMST GmbH
Forschungs-netzwerk anzeigen

Details

OriginalspracheEnglisch
Titel des Sammelwerks14. Fachtagung Kommunikation in Verteilten Systemen
UntertitelKiVS 2005 - Eine Veranstaltung der Gesellschaft fur Informatik (GI) unter Beteiligung der Informationstechnischen Gesellschaft (ITG/VDE)
Seiten181-192
Seitenumfang12
PublikationsstatusVeröffentlicht - 2005
Extern publiziertJa
Veranstaltung14. Fachtagung Kommunikation in Verteilten Systemen, KiVS 2005 - 14th Conference on Communication in Distributed Systems, KiVS 2005 - Kaiserslautern, Deutschland
Dauer: 28 Feb. 20053 März 2005

Publikationsreihe

NameInformatik aktuell
ISSN (Print)1431-472X

Abstract

Network calculus has successfully been applied to derive performance bounds for communication networks, whereas a number of issues still remain unsolved or are not well understood yet. Founded on min-plus 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 convex/concave conjugates referred to also as 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.

ASJC Scopus Sachgebiete

Zitieren

Transformation-Based Network Calculus Applying Convex/Concave Conjugates. / Fidler, Markus; Recker, Stephan.
14. Fachtagung Kommunikation in Verteilten Systemen: KiVS 2005 - Eine Veranstaltung der Gesellschaft fur Informatik (GI) unter Beteiligung der Informationstechnischen Gesellschaft (ITG/VDE). 2005. S. 181-192 (Informatik aktuell).

Publikation: Beitrag in Buch/Bericht/Sammelwerk/KonferenzbandAufsatz in KonferenzbandForschungPeer-Review

Fidler, M & Recker, S 2005, Transformation-Based Network Calculus Applying Convex/Concave Conjugates. in 14. Fachtagung Kommunikation in Verteilten Systemen: KiVS 2005 - Eine Veranstaltung der Gesellschaft fur Informatik (GI) unter Beteiligung der Informationstechnischen Gesellschaft (ITG/VDE). Informatik aktuell, S. 181-192, 14. Fachtagung Kommunikation in Verteilten Systemen, KiVS 2005 - 14th Conference on Communication in Distributed Systems, KiVS 2005, Kaiserslautern, Deutschland, 28 Feb. 2005. https://doi.org/10.1007/3-540-27301-8_15
Fidler, M., & Recker, S. (2005). Transformation-Based Network Calculus Applying Convex/Concave Conjugates. In 14. Fachtagung Kommunikation in Verteilten Systemen: KiVS 2005 - Eine Veranstaltung der Gesellschaft fur Informatik (GI) unter Beteiligung der Informationstechnischen Gesellschaft (ITG/VDE) (S. 181-192). (Informatik aktuell). https://doi.org/10.1007/3-540-27301-8_15
Fidler M, Recker S. Transformation-Based Network Calculus Applying Convex/Concave Conjugates. in 14. Fachtagung Kommunikation in Verteilten Systemen: KiVS 2005 - Eine Veranstaltung der Gesellschaft fur Informatik (GI) unter Beteiligung der Informationstechnischen Gesellschaft (ITG/VDE). 2005. S. 181-192. (Informatik aktuell). doi: 10.1007/3-540-27301-8_15
Fidler, Markus ; Recker, Stephan. / Transformation-Based Network Calculus Applying Convex/Concave Conjugates. 14. Fachtagung Kommunikation in Verteilten Systemen: KiVS 2005 - Eine Veranstaltung der Gesellschaft fur Informatik (GI) unter Beteiligung der Informationstechnischen Gesellschaft (ITG/VDE). 2005. S. 181-192 (Informatik aktuell).
Download
@inproceedings{854d675fe6e84e73a8cab50f41e88388,
title = "Transformation-Based Network Calculus Applying Convex/Concave Conjugates",
abstract = "Network calculus has successfully been applied to derive performance bounds for communication networks, whereas a number of issues still remain unsolved or are not well understood yet. Founded on min-plus 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 convex/concave conjugates referred to also as 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.",
author = "Markus Fidler and Stephan Recker",
year = "2005",
doi = "10.1007/3-540-27301-8_15",
language = "English",
isbn = "3540244735",
series = "Informatik aktuell",
pages = "181--192",
booktitle = "14. Fachtagung Kommunikation in Verteilten Systemen",
note = "14. Fachtagung Kommunikation in Verteilten Systemen, KiVS 2005 - 14th Conference on Communication in Distributed Systems, KiVS 2005 ; Conference date: 28-02-2005 Through 03-03-2005",

}

Download

TY - GEN

T1 - Transformation-Based Network Calculus Applying Convex/Concave Conjugates

AU - Fidler, Markus

AU - Recker, Stephan

PY - 2005

Y1 - 2005

N2 - Network calculus has successfully been applied to derive performance bounds for communication networks, whereas a number of issues still remain unsolved or are not well understood yet. Founded on min-plus 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 convex/concave conjugates referred to also as 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.

AB - Network calculus has successfully been applied to derive performance bounds for communication networks, whereas a number of issues still remain unsolved or are not well understood yet. Founded on min-plus 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 convex/concave conjugates referred to also as 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.

UR - http://www.scopus.com/inward/record.url?scp=84879862935&partnerID=8YFLogxK

U2 - 10.1007/3-540-27301-8_15

DO - 10.1007/3-540-27301-8_15

M3 - Conference contribution

AN - SCOPUS:84879862935

SN - 3540244735

SN - 9783540244738

T3 - Informatik aktuell

SP - 181

EP - 192

BT - 14. Fachtagung Kommunikation in Verteilten Systemen

T2 - 14. Fachtagung Kommunikation in Verteilten Systemen, KiVS 2005 - 14th Conference on Communication in Distributed Systems, KiVS 2005

Y2 - 28 February 2005 through 3 March 2005

ER -

Von denselben Autoren