Details
| Original language | English |
|---|---|
| Article number | 6298751 |
| Pages (from-to) | 15-28 |
| Number of pages | 14 |
| Journal | IEEE Transactions on Network and Service Management |
| Volume | 10 |
| Issue number | 1 |
| Publication status | Published - Mar 2013 |
Abstract
In packet switched networks, statistical multiplexing of independent variable bit rate flows achieves significant resource savings, i.e., N flows require considerably less than N times the resources needed for one flow. In this work, we explore statistical multiplexing using methods from the current stochastic network calculus, where we compare the accuracy of different analytical approaches. While these approaches are known to provide identical results for a single flow, we find significant differences if several independent flows are multiplexed. Recent results on the concatenation of nodes along a network path allow us to investigate both single- as well as multi-node networks with cross traffic. The analysis enables us to distinguish different independence assumptions between traffic flows at a single node as well as between cross traffic flows at consecutive nodes of a network path. We contribute insights into the scaling of end-toend delay bounds in the number of nodes n of a network path under statistical independence. Our work is complemented by numerical applications, e.g., on access multiplexer dimensioning and traffic trunk management.
Keywords
- EBB, Effective bandwidth, Statistical multiplexing, Statistical network calculus
ASJC Scopus subject areas
- Computer Science(all)
- Computer Networks and Communications
- Engineering(all)
- Electrical and Electronic Engineering
Cite this
- Standard
- Harvard
- Apa
- Vancouver
- BibTeX
- RIS
In: IEEE Transactions on Network and Service Management, Vol. 10, No. 1, 6298751, 03.2013, p. 15-28.
Research output: Contribution to journal › Article › Research › peer review
}
TY - JOUR
T1 - On Multiplexing Models for Independent Traffic Flows in Single- and Multi-Node Networks
AU - Rizk, Amr
AU - Fidler, Markus
PY - 2013/3
Y1 - 2013/3
N2 - In packet switched networks, statistical multiplexing of independent variable bit rate flows achieves significant resource savings, i.e., N flows require considerably less than N times the resources needed for one flow. In this work, we explore statistical multiplexing using methods from the current stochastic network calculus, where we compare the accuracy of different analytical approaches. While these approaches are known to provide identical results for a single flow, we find significant differences if several independent flows are multiplexed. Recent results on the concatenation of nodes along a network path allow us to investigate both single- as well as multi-node networks with cross traffic. The analysis enables us to distinguish different independence assumptions between traffic flows at a single node as well as between cross traffic flows at consecutive nodes of a network path. We contribute insights into the scaling of end-toend delay bounds in the number of nodes n of a network path under statistical independence. Our work is complemented by numerical applications, e.g., on access multiplexer dimensioning and traffic trunk management.
AB - In packet switched networks, statistical multiplexing of independent variable bit rate flows achieves significant resource savings, i.e., N flows require considerably less than N times the resources needed for one flow. In this work, we explore statistical multiplexing using methods from the current stochastic network calculus, where we compare the accuracy of different analytical approaches. While these approaches are known to provide identical results for a single flow, we find significant differences if several independent flows are multiplexed. Recent results on the concatenation of nodes along a network path allow us to investigate both single- as well as multi-node networks with cross traffic. The analysis enables us to distinguish different independence assumptions between traffic flows at a single node as well as between cross traffic flows at consecutive nodes of a network path. We contribute insights into the scaling of end-toend delay bounds in the number of nodes n of a network path under statistical independence. Our work is complemented by numerical applications, e.g., on access multiplexer dimensioning and traffic trunk management.
KW - EBB
KW - Effective bandwidth
KW - Statistical multiplexing
KW - Statistical network calculus
UR - http://www.scopus.com/inward/record.url?scp=84899093235&partnerID=8YFLogxK
U2 - 10.1109/TNSM.2012.091012.120234
DO - 10.1109/TNSM.2012.091012.120234
M3 - Article
AN - SCOPUS:84899093235
VL - 10
SP - 15
EP - 28
JO - IEEE Transactions on Network and Service Management
JF - IEEE Transactions on Network and Service Management
SN - 1932-4537
IS - 1
M1 - 6298751
ER -