DMCA
Perspectives on Network Calculus -- No Free Lunch, but Still Good Value (2012)
Cached
Download Links
| Citations: | 20 - 11 self |
BibTeX
@MISC{Ciucu12perspectiveson,
author = {Florin Ciucu and Jens Schmitt},
title = {Perspectives on Network Calculus -- No Free Lunch, but Still Good Value},
year = {2012}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
ACM Sigcomm 2006 published a paper [26] which was perceived to unify the deterministic and stochastic branches of the network calculus (abbreviated throughout as DNC and SNC) [39]. Unfortunately, this seemingly fundamental unification—which has raised the hope of a straightforward transfer of all results from DNC to SNC—is invalid. To substantiate this claim, we demonstrate that for the class of stationary andergodic processes, whichis prevalentin traffic modelling, the probabilistic arrival model from [26] is quasideterministic, i.e., the underlying probabilities are either zero or one. Thus, the probabilistic framework from [26] is unable to account for statistical multiplexing gain, which is in fact the raison d’être of packet-switched networks. Other previous formulations of SNC can capture statistical multiplexing
Keyphrases
good value network calculus free lunch acm sigcomm probabilistic framework fundamental unification statistical multiplexing stationary andergodic process straightforward transfer packet-switched network stochastic branch probabilistic arrival model network calculus raison tre previous formulation statistical multiplexing gain underlying probability prevalentin traffic modelling
