A Foundation for Stochastic Bandwidth Estimation of Networks with Random Service

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 publication2011 Proceedings IEEE INFOCOM
Pages1817-1825
Number of pages9
Publication statusPublished - Jun 2011
EventIEEE INFOCOM 2011 - Shanghai, China
Duration: 10 Apr 201115 Apr 2011

Publication series

NameProceedings - IEEE INFOCOM
ISSN (Print)0743-166X

Abstract

We develop a stochastic foundation for bandwidth estimation of networks with random service, where bandwidth availability is expressed in terms of bounding functions with a defined violation probability. Exploiting properties of a stochastic max-plus algebra and system theory, the task of bandwidth estimation is formulated as inferring an unknown bounding function from measurements of probing traffic. We derive an estimation methodology that is based on iterative constant rate probes. Our solution provides evidence for the utility of packet trains for bandwidth estimation in the presence of variable cross traffic. Taking advantage of statistical methods, we show how our estimation method can be realized in practice, with adaptive train lengths of probe packets, probing rates, and replicated measurements required to achieve both high accuracy and confidence levels. We evaluate our method in a controlled testbed network, where we show the impact of cross traffic variability on the time-scales of service availability, and provide a comparison with existing bandwidth estimation tools.

ASJC Scopus subject areas

Cite this

A Foundation for Stochastic Bandwidth Estimation of Networks with Random Service. / Lübben, Ralf; Fidler, Markus; Liebeherr, Jörg.
2011 Proceedings IEEE INFOCOM. 2011. p. 1817-1825 5934981 (Proceedings - IEEE INFOCOM).

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

Lübben, R, Fidler, M & Liebeherr, J 2011, A Foundation for Stochastic Bandwidth Estimation of Networks with Random Service. in 2011 Proceedings IEEE INFOCOM., 5934981, Proceedings - IEEE INFOCOM, pp. 1817-1825, IEEE INFOCOM 2011, Shanghai, China, 10 Apr 2011. https://doi.org/10.1109/INFCOM.2011.5934981
Lübben, R., Fidler, M., & Liebeherr, J. (2011). A Foundation for Stochastic Bandwidth Estimation of Networks with Random Service. In 2011 Proceedings IEEE INFOCOM (pp. 1817-1825). Article 5934981 (Proceedings - IEEE INFOCOM). https://doi.org/10.1109/INFCOM.2011.5934981
Lübben R, Fidler M, Liebeherr J. A Foundation for Stochastic Bandwidth Estimation of Networks with Random Service. In 2011 Proceedings IEEE INFOCOM. 2011. p. 1817-1825. 5934981. (Proceedings - IEEE INFOCOM). Epub 2010 Jul 31. doi: 10.1109/INFCOM.2011.5934981
Lübben, Ralf ; Fidler, Markus ; Liebeherr, Jörg. / A Foundation for Stochastic Bandwidth Estimation of Networks with Random Service. 2011 Proceedings IEEE INFOCOM. 2011. pp. 1817-1825 (Proceedings - IEEE INFOCOM).
Download
@inproceedings{e1c679dc9c5b4466932b93b99c8a7580,
title = "A Foundation for Stochastic Bandwidth Estimation of Networks with Random Service",
abstract = "We develop a stochastic foundation for bandwidth estimation of networks with random service, where bandwidth availability is expressed in terms of bounding functions with a defined violation probability. Exploiting properties of a stochastic max-plus algebra and system theory, the task of bandwidth estimation is formulated as inferring an unknown bounding function from measurements of probing traffic. We derive an estimation methodology that is based on iterative constant rate probes. Our solution provides evidence for the utility of packet trains for bandwidth estimation in the presence of variable cross traffic. Taking advantage of statistical methods, we show how our estimation method can be realized in practice, with adaptive train lengths of probe packets, probing rates, and replicated measurements required to achieve both high accuracy and confidence levels. We evaluate our method in a controlled testbed network, where we show the impact of cross traffic variability on the time-scales of service availability, and provide a comparison with existing bandwidth estimation tools.",
author = "Ralf L{\"u}bben and Markus Fidler and J{\"o}rg Liebeherr",
year = "2011",
month = jun,
doi = "10.1109/INFCOM.2011.5934981",
language = "English",
isbn = "9781424499212",
series = "Proceedings - IEEE INFOCOM",
pages = "1817--1825",
booktitle = "2011 Proceedings IEEE INFOCOM",
note = "IEEE INFOCOM 2011 ; Conference date: 10-04-2011 Through 15-04-2011",

}

Download

TY - GEN

T1 - A Foundation for Stochastic Bandwidth Estimation of Networks with Random Service

AU - Lübben, Ralf

AU - Fidler, Markus

AU - Liebeherr, Jörg

PY - 2011/6

Y1 - 2011/6

N2 - We develop a stochastic foundation for bandwidth estimation of networks with random service, where bandwidth availability is expressed in terms of bounding functions with a defined violation probability. Exploiting properties of a stochastic max-plus algebra and system theory, the task of bandwidth estimation is formulated as inferring an unknown bounding function from measurements of probing traffic. We derive an estimation methodology that is based on iterative constant rate probes. Our solution provides evidence for the utility of packet trains for bandwidth estimation in the presence of variable cross traffic. Taking advantage of statistical methods, we show how our estimation method can be realized in practice, with adaptive train lengths of probe packets, probing rates, and replicated measurements required to achieve both high accuracy and confidence levels. We evaluate our method in a controlled testbed network, where we show the impact of cross traffic variability on the time-scales of service availability, and provide a comparison with existing bandwidth estimation tools.

AB - We develop a stochastic foundation for bandwidth estimation of networks with random service, where bandwidth availability is expressed in terms of bounding functions with a defined violation probability. Exploiting properties of a stochastic max-plus algebra and system theory, the task of bandwidth estimation is formulated as inferring an unknown bounding function from measurements of probing traffic. We derive an estimation methodology that is based on iterative constant rate probes. Our solution provides evidence for the utility of packet trains for bandwidth estimation in the presence of variable cross traffic. Taking advantage of statistical methods, we show how our estimation method can be realized in practice, with adaptive train lengths of probe packets, probing rates, and replicated measurements required to achieve both high accuracy and confidence levels. We evaluate our method in a controlled testbed network, where we show the impact of cross traffic variability on the time-scales of service availability, and provide a comparison with existing bandwidth estimation tools.

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

U2 - 10.1109/INFCOM.2011.5934981

DO - 10.1109/INFCOM.2011.5934981

M3 - Conference contribution

AN - SCOPUS:79960874062

SN - 9781424499212

T3 - Proceedings - IEEE INFOCOM

SP - 1817

EP - 1825

BT - 2011 Proceedings IEEE INFOCOM

T2 - IEEE INFOCOM 2011

Y2 - 10 April 2011 through 15 April 2011

ER -

By the same author(s)