A Guide to the Stochastic Network Calculus

Publikation: Beitrag in FachzeitschriftArtikelForschungPeer-Review

Autoren

Organisationseinheiten

Forschungs-netzwerk anzeigen

Details

OriginalspracheEnglisch
Aufsatznummer6868978
Seiten (von - bis)92-105
Seitenumfang14
FachzeitschriftIEEE Communications Surveys and Tutorials
Jahrgang17
Ausgabenummer1
PublikationsstatusVeröffentlicht - 1 Jan. 2015

Abstract

The aim of the stochastic network calculus is to comprehend statistical multiplexing and scheduling of non-trivial traffic sources in a framework for end-to-end analysis of multi-node networks. To date, several models, some of them with subtle yet important differences, have been explored to achieve these objectives. Capitalizing on previous works, this paper contributes an intuitive approach to the stochastic network calculus, where we seek to obtain its fundamental results in the possibly easiest way. In detail, the method that is assembled in this work uses moment generating functions, known from the theory of effective bandwidths, to characterize traffic arrivals and network service. Thereof, affine envelope functions with an exponentially decaying overflow profile are derived to compute statistical end-to-end backlog and delay bounds for networks.

ASJC Scopus Sachgebiete

Zitieren

A Guide to the Stochastic Network Calculus. / Fidler, Markus; Rizk, Amr.
in: IEEE Communications Surveys and Tutorials, Jahrgang 17, Nr. 1, 6868978, 01.01.2015, S. 92-105.

Publikation: Beitrag in FachzeitschriftArtikelForschungPeer-Review

Fidler M, Rizk A. A Guide to the Stochastic Network Calculus. IEEE Communications Surveys and Tutorials. 2015 Jan 1;17(1):92-105. 6868978. doi: 10.1109/COMST.2014.2337060
Download
@article{3e641775803f436c985fd94fe5cc70aa,
title = "A Guide to the Stochastic Network Calculus",
abstract = "The aim of the stochastic network calculus is to comprehend statistical multiplexing and scheduling of non-trivial traffic sources in a framework for end-to-end analysis of multi-node networks. To date, several models, some of them with subtle yet important differences, have been explored to achieve these objectives. Capitalizing on previous works, this paper contributes an intuitive approach to the stochastic network calculus, where we seek to obtain its fundamental results in the possibly easiest way. In detail, the method that is assembled in this work uses moment generating functions, known from the theory of effective bandwidths, to characterize traffic arrivals and network service. Thereof, affine envelope functions with an exponentially decaying overflow profile are derived to compute statistical end-to-end backlog and delay bounds for networks.",
keywords = "end-to-end performance evaluation, moment generating functions, scheduling, Stochastic network calculus",
author = "Markus Fidler and Amr Rizk",
year = "2015",
month = jan,
day = "1",
doi = "10.1109/COMST.2014.2337060",
language = "English",
volume = "17",
pages = "92--105",
journal = "IEEE Communications Surveys and Tutorials",
issn = "1553-877X",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "1",

}

Download

TY - JOUR

T1 - A Guide to the Stochastic Network Calculus

AU - Fidler, Markus

AU - Rizk, Amr

PY - 2015/1/1

Y1 - 2015/1/1

N2 - The aim of the stochastic network calculus is to comprehend statistical multiplexing and scheduling of non-trivial traffic sources in a framework for end-to-end analysis of multi-node networks. To date, several models, some of them with subtle yet important differences, have been explored to achieve these objectives. Capitalizing on previous works, this paper contributes an intuitive approach to the stochastic network calculus, where we seek to obtain its fundamental results in the possibly easiest way. In detail, the method that is assembled in this work uses moment generating functions, known from the theory of effective bandwidths, to characterize traffic arrivals and network service. Thereof, affine envelope functions with an exponentially decaying overflow profile are derived to compute statistical end-to-end backlog and delay bounds for networks.

AB - The aim of the stochastic network calculus is to comprehend statistical multiplexing and scheduling of non-trivial traffic sources in a framework for end-to-end analysis of multi-node networks. To date, several models, some of them with subtle yet important differences, have been explored to achieve these objectives. Capitalizing on previous works, this paper contributes an intuitive approach to the stochastic network calculus, where we seek to obtain its fundamental results in the possibly easiest way. In detail, the method that is assembled in this work uses moment generating functions, known from the theory of effective bandwidths, to characterize traffic arrivals and network service. Thereof, affine envelope functions with an exponentially decaying overflow profile are derived to compute statistical end-to-end backlog and delay bounds for networks.

KW - end-to-end performance evaluation

KW - moment generating functions

KW - scheduling

KW - Stochastic network calculus

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

U2 - 10.1109/COMST.2014.2337060

DO - 10.1109/COMST.2014.2337060

M3 - Article

AN - SCOPUS:84925863118

VL - 17

SP - 92

EP - 105

JO - IEEE Communications Surveys and Tutorials

JF - IEEE Communications Surveys and Tutorials

SN - 1553-877X

IS - 1

M1 - 6868978

ER -

Von denselben Autoren