Details
| Original language | English |
|---|---|
| Article number | 6868978 |
| Pages (from-to) | 92-105 |
| Number of pages | 14 |
| Journal | IEEE Communications Surveys and Tutorials |
| Volume | 17 |
| Issue number | 1 |
| Publication status | Published - 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.
Keywords
- end-to-end performance evaluation, moment generating functions, scheduling, Stochastic network calculus
ASJC Scopus subject areas
- Engineering(all)
- Electrical and Electronic Engineering
Cite this
- Standard
- Harvard
- Apa
- Vancouver
- BibTeX
- RIS
In: IEEE Communications Surveys and Tutorials, Vol. 17, No. 1, 6868978, 01.01.2015, p. 92-105.
Research output: Contribution to journal › Article › Research › peer review
}
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 -