An End-to-End Probabilistic Network Calculus with Moment Generating Functions

Research output: Chapter in book/report/conference proceedingConference contributionResearchpeer review

Authors

External Research Organisations

  • University of Toronto
View graph of relations

Details

Original languageEnglish
Title of host publicationProceedings - 2006 Fourteenth International Workshop on Quality of Service
Subtitle of host publicationIWQoS 2006
Pages261-270
Number of pages10
Publication statusPublished - 2006
Externally publishedYes
Event2006 14th IEEE International Workshop on Quality of Service, IWQoS 2006 - New Haven, CT, United States
Duration: 19 Jun 200621 Jun 2006

Publication series

NameIEEE International Workshop on Quality of Service, IWQoS
ISSN (Print)1548-615X

Abstract

Network calculus is a min-plus system theory for performance evaluation of queuing networks. Its elegance stems from intuitive convolution formulas for concatenation of deterministic servers. Recent research dispenses with the worst-case assumptions of network calculus to develop a probabilistic equivalent that benefits from statistical multiplexing. Significant achievements have been made, owing for example to the theory of effective bandwidths, however, the outstanding scalability set up by concatenation of deterministic servers has not been shown. This paper establishes a concise, probabilistic network calculus with moment generating functions. The presented work features closed-form, end-to-end, probabilistic performance bounds that achieve the objective of scaling linearly in the number of servers in series. The consistent application of moment generating functions put forth in this paper utilizes independence beyond the scope of current statistical multiplexing of flows. A relevant additional gain is demonstrated for tandem servers with independent cross-traffic.

ASJC Scopus subject areas

Cite this

An End-to-End Probabilistic Network Calculus with Moment Generating Functions. / Fidler, Markus.
Proceedings - 2006 Fourteenth International Workshop on Quality of Service: IWQoS 2006. 2006. p. 261-270 4015760 (IEEE International Workshop on Quality of Service, IWQoS).

Research output: Chapter in book/report/conference proceedingConference contributionResearchpeer review

Fidler, M 2006, An End-to-End Probabilistic Network Calculus with Moment Generating Functions. in Proceedings - 2006 Fourteenth International Workshop on Quality of Service: IWQoS 2006., 4015760, IEEE International Workshop on Quality of Service, IWQoS, pp. 261-270, 2006 14th IEEE International Workshop on Quality of Service, IWQoS 2006, New Haven, CT, United States, 19 Jun 2006. https://doi.org/10.1109/IWQOS.2006.250477
Fidler, M. (2006). An End-to-End Probabilistic Network Calculus with Moment Generating Functions. In Proceedings - 2006 Fourteenth International Workshop on Quality of Service: IWQoS 2006 (pp. 261-270). Article 4015760 (IEEE International Workshop on Quality of Service, IWQoS). https://doi.org/10.1109/IWQOS.2006.250477
Fidler M. An End-to-End Probabilistic Network Calculus with Moment Generating Functions. In Proceedings - 2006 Fourteenth International Workshop on Quality of Service: IWQoS 2006. 2006. p. 261-270. 4015760. (IEEE International Workshop on Quality of Service, IWQoS). Epub 2005 Jul 3. doi: 10.1109/IWQOS.2006.250477
Fidler, Markus. / An End-to-End Probabilistic Network Calculus with Moment Generating Functions. Proceedings - 2006 Fourteenth International Workshop on Quality of Service: IWQoS 2006. 2006. pp. 261-270 (IEEE International Workshop on Quality of Service, IWQoS).
Download
@inproceedings{e2595d1aabb0404ca86a5f131d8ef6c4,
title = "An End-to-End Probabilistic Network Calculus with Moment Generating Functions",
abstract = "Network calculus is a min-plus system theory for performance evaluation of queuing networks. Its elegance stems from intuitive convolution formulas for concatenation of deterministic servers. Recent research dispenses with the worst-case assumptions of network calculus to develop a probabilistic equivalent that benefits from statistical multiplexing. Significant achievements have been made, owing for example to the theory of effective bandwidths, however, the outstanding scalability set up by concatenation of deterministic servers has not been shown. This paper establishes a concise, probabilistic network calculus with moment generating functions. The presented work features closed-form, end-to-end, probabilistic performance bounds that achieve the objective of scaling linearly in the number of servers in series. The consistent application of moment generating functions put forth in this paper utilizes independence beyond the scope of current statistical multiplexing of flows. A relevant additional gain is demonstrated for tandem servers with independent cross-traffic.",
author = "Markus Fidler",
year = "2006",
doi = "10.1109/IWQOS.2006.250477",
language = "English",
isbn = "1424404762",
series = "IEEE International Workshop on Quality of Service, IWQoS",
pages = "261--270",
booktitle = "Proceedings - 2006 Fourteenth International Workshop on Quality of Service",
note = "2006 14th IEEE International Workshop on Quality of Service, IWQoS 2006 ; Conference date: 19-06-2006 Through 21-06-2006",

}

Download

TY - GEN

T1 - An End-to-End Probabilistic Network Calculus with Moment Generating Functions

AU - Fidler, Markus

PY - 2006

Y1 - 2006

N2 - Network calculus is a min-plus system theory for performance evaluation of queuing networks. Its elegance stems from intuitive convolution formulas for concatenation of deterministic servers. Recent research dispenses with the worst-case assumptions of network calculus to develop a probabilistic equivalent that benefits from statistical multiplexing. Significant achievements have been made, owing for example to the theory of effective bandwidths, however, the outstanding scalability set up by concatenation of deterministic servers has not been shown. This paper establishes a concise, probabilistic network calculus with moment generating functions. The presented work features closed-form, end-to-end, probabilistic performance bounds that achieve the objective of scaling linearly in the number of servers in series. The consistent application of moment generating functions put forth in this paper utilizes independence beyond the scope of current statistical multiplexing of flows. A relevant additional gain is demonstrated for tandem servers with independent cross-traffic.

AB - Network calculus is a min-plus system theory for performance evaluation of queuing networks. Its elegance stems from intuitive convolution formulas for concatenation of deterministic servers. Recent research dispenses with the worst-case assumptions of network calculus to develop a probabilistic equivalent that benefits from statistical multiplexing. Significant achievements have been made, owing for example to the theory of effective bandwidths, however, the outstanding scalability set up by concatenation of deterministic servers has not been shown. This paper establishes a concise, probabilistic network calculus with moment generating functions. The presented work features closed-form, end-to-end, probabilistic performance bounds that achieve the objective of scaling linearly in the number of servers in series. The consistent application of moment generating functions put forth in this paper utilizes independence beyond the scope of current statistical multiplexing of flows. A relevant additional gain is demonstrated for tandem servers with independent cross-traffic.

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

U2 - 10.1109/IWQOS.2006.250477

DO - 10.1109/IWQOS.2006.250477

M3 - Conference contribution

AN - SCOPUS:33748557572

SN - 1424404762

SN - 9781424404766

T3 - IEEE International Workshop on Quality of Service, IWQoS

SP - 261

EP - 270

BT - Proceedings - 2006 Fourteenth International Workshop on Quality of Service

T2 - 2006 14th IEEE International Workshop on Quality of Service, IWQoS 2006

Y2 - 19 June 2006 through 21 June 2006

ER -

By the same author(s)