%0 Conference Paper %1 Guillemin18ITC30 %A Guillemin, Fabrice %A Mazumdar, Ravi R. %A Rosenberg, Catherine %A Ying, Yu %B 30th International Teletraffic Congress (ITC 30) %C Vienna, Austria %D 2018 %K NetCal_2018_-_Session_III:_Analysis_Techniques itc itc30 %T Network Calculus for Mean Delay Analysis Through a Network %U https://gitlab2.informatik.uni-wuerzburg.de/itc-conference/itc-conference-public/-/raw/master/itc30/Guillemin18ITC30.pdf?inline=true %X In this paper, a framework is developed to estimate the mean delay performance of \$($\backslash$pi, $\backslash$rho,$\backslash$sigma)\$ regulated flows in networks with acyclic routing. We first show that the mean delay performance can be bounded by \textiton-off type processes with exponentially distributed periods. We then obtain per-flow bounds on the mean delay. We show that when there is no peak rate constraint, the Pollaczek-Khinchine formula for \$M/G/1\$ queues provides a tight bound thus establishing the Better-than-Poisson property for such flows. We then consider flows inside a network and show that they can be characterized by a stochastic burstiness parameter and show how the aggregate performance can be bounded from the asymptotic Better-than-Poisson property of regulated flows.

@inproceedings{Guillemin18ITC30, abstract = {In this paper, a framework is developed to estimate the mean delay performance of \$($\backslash$pi, $\backslash$rho,$\backslash$sigma)\$ regulated flows in networks with acyclic routing. We first show that the mean delay performance can be bounded by \textiton-off type processes with exponentially distributed \textitoff periods. We then obtain per-flow bounds on the mean delay. We show that when there is no peak rate constraint, the Pollaczek-Khinchine formula for \$M/G/1\$ queues provides a tight bound thus establishing the Better-than-Poisson property for such flows. We then consider flows inside a network and show that they can be characterized by a stochastic burstiness parameter and show how the aggregate performance can be bounded from the asymptotic Better-than-Poisson property of regulated flows.}, added-at = {2018-09-12T17:41:00.000+0200}, address = {Vienna, Austria}, author = {Guillemin, Fabrice and Mazumdar, Ravi R. and Rosenberg, Catherine and Ying, Yu}, biburl = {https://www.bibsonomy.org/bibtex/206e4d3ff975977b2c356bcb163a48da0/itc}, booktitle = {30th International Teletraffic Congress (ITC 30)}, interhash = {94632e52221c72ecc091c162dcd94eb7}, intrahash = {06e4d3ff975977b2c356bcb163a48da0}, keywords = {NetCal_2018_-_Session_III:_Analysis_Techniques itc itc30}, timestamp = {2020-05-24T20:14:34.000+0200}, title = {Network Calculus for Mean Delay Analysis Through a Network}, url = {https://gitlab2.informatik.uni-wuerzburg.de/itc-conference/itc-conference-public/-/raw/master/itc30/Guillemin18ITC30.pdf?inline=true}, year = 2018 }