Leveraging Statistical Multiplexing Gainsin Single- and Multi-hop Networks

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

Authors

View graph of relations

Details

Original languageEnglish
Title of host publication2011 IEEE 19th International Workshop on Quality of Service
Subtitle of host publicationIWQoS 2011
Publication statusPublished - Jun 2011
Event2011 IEEE 19th International Workshop on Quality of Service, IWQoS 2011 - San Jose, CA, United States
Duration: 6 Jun 20117 Jun 2011

Publication series

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

Abstract

Packet switched networks achieve significant resource savings due to statistical multiplexing. In this work we explore statistical multiplexing gains in single and multi-hop networks. To this end, we analyze performance metrics such as delay bounds for a through flow comparing different results from the stochastic network calculus. We distinguish different multiplexing gains that stem from independence assumptions between flows at a single hop as well as flows at consecutive hops of a network path. Further, we show corresponding numerical results. In addition to deriving the benefits of various statistical multiplexing models on performance bounds, we contribute insights into the scaling of end-to-end delay bounds in the number of hops n of a network path under statistical independence.

ASJC Scopus subject areas

Cite this

Leveraging Statistical Multiplexing Gainsin Single- and Multi-hop Networks. / Rizk, Amr; Fidler, Markus.
2011 IEEE 19th International Workshop on Quality of Service: IWQoS 2011. 2011. 5931352 (IEEE International Workshop on Quality of Service, IWQoS).

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

Rizk, A & Fidler, M 2011, Leveraging Statistical Multiplexing Gainsin Single- and Multi-hop Networks. in 2011 IEEE 19th International Workshop on Quality of Service: IWQoS 2011., 5931352, IEEE International Workshop on Quality of Service, IWQoS, 2011 IEEE 19th International Workshop on Quality of Service, IWQoS 2011, San Jose, CA, United States, 6 Jun 2011. https://doi.org/10.1109/IWQOS.2011.5931352
Rizk, A., & Fidler, M. (2011). Leveraging Statistical Multiplexing Gainsin Single- and Multi-hop Networks. In 2011 IEEE 19th International Workshop on Quality of Service: IWQoS 2011 Article 5931352 (IEEE International Workshop on Quality of Service, IWQoS). https://doi.org/10.1109/IWQOS.2011.5931352
Rizk A, Fidler M. Leveraging Statistical Multiplexing Gainsin Single- and Multi-hop Networks. In 2011 IEEE 19th International Workshop on Quality of Service: IWQoS 2011. 2011. 5931352. (IEEE International Workshop on Quality of Service, IWQoS). doi: 10.1109/IWQOS.2011.5931352
Rizk, Amr ; Fidler, Markus. / Leveraging Statistical Multiplexing Gainsin Single- and Multi-hop Networks. 2011 IEEE 19th International Workshop on Quality of Service: IWQoS 2011. 2011. (IEEE International Workshop on Quality of Service, IWQoS).
Download
@inproceedings{cdd70852babd44c6968336e3b9bbf30d,
title = "Leveraging Statistical Multiplexing Gainsin Single- and Multi-hop Networks",
abstract = "Packet switched networks achieve significant resource savings due to statistical multiplexing. In this work we explore statistical multiplexing gains in single and multi-hop networks. To this end, we analyze performance metrics such as delay bounds for a through flow comparing different results from the stochastic network calculus. We distinguish different multiplexing gains that stem from independence assumptions between flows at a single hop as well as flows at consecutive hops of a network path. Further, we show corresponding numerical results. In addition to deriving the benefits of various statistical multiplexing models on performance bounds, we contribute insights into the scaling of end-to-end delay bounds in the number of hops n of a network path under statistical independence.",
author = "Amr Rizk and Markus Fidler",
year = "2011",
month = jun,
doi = "10.1109/IWQOS.2011.5931352",
language = "English",
isbn = "9781457701030",
series = "IEEE International Workshop on Quality of Service, IWQoS",
booktitle = "2011 IEEE 19th International Workshop on Quality of Service",
note = "2011 IEEE 19th International Workshop on Quality of Service, IWQoS 2011 ; Conference date: 06-06-2011 Through 07-06-2011",

}

Download

TY - GEN

T1 - Leveraging Statistical Multiplexing Gainsin Single- and Multi-hop Networks

AU - Rizk, Amr

AU - Fidler, Markus

PY - 2011/6

Y1 - 2011/6

N2 - Packet switched networks achieve significant resource savings due to statistical multiplexing. In this work we explore statistical multiplexing gains in single and multi-hop networks. To this end, we analyze performance metrics such as delay bounds for a through flow comparing different results from the stochastic network calculus. We distinguish different multiplexing gains that stem from independence assumptions between flows at a single hop as well as flows at consecutive hops of a network path. Further, we show corresponding numerical results. In addition to deriving the benefits of various statistical multiplexing models on performance bounds, we contribute insights into the scaling of end-to-end delay bounds in the number of hops n of a network path under statistical independence.

AB - Packet switched networks achieve significant resource savings due to statistical multiplexing. In this work we explore statistical multiplexing gains in single and multi-hop networks. To this end, we analyze performance metrics such as delay bounds for a through flow comparing different results from the stochastic network calculus. We distinguish different multiplexing gains that stem from independence assumptions between flows at a single hop as well as flows at consecutive hops of a network path. Further, we show corresponding numerical results. In addition to deriving the benefits of various statistical multiplexing models on performance bounds, we contribute insights into the scaling of end-to-end delay bounds in the number of hops n of a network path under statistical independence.

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

U2 - 10.1109/IWQOS.2011.5931352

DO - 10.1109/IWQOS.2011.5931352

M3 - Conference contribution

AN - SCOPUS:79960681868

SN - 9781457701030

T3 - IEEE International Workshop on Quality of Service, IWQoS

BT - 2011 IEEE 19th International Workshop on Quality of Service

T2 - 2011 IEEE 19th International Workshop on Quality of Service, IWQoS 2011

Y2 - 6 June 2011 through 7 June 2011

ER -

By the same author(s)