Sebastian A. Henningsen

Learn More
TTL cache models provide an attractive unified approximation framework for caching policies like LRU and FIFO, whose exact analysis is notoriously hard. In this paper, we advance the understanding of TTL models by explicitly considering stochastic capacity constraints. We find in particular that reducing the variance of the cache occupancy is instrumental(More)
—The stochastic network calculus (SNC) has become an attractive methodology to derive probabilistic performance bounds. So far the SNC is based on (tacitly assumed) exact probabilistic assumptions about the arrival processes. Yet, in practice, these are only true approximately–at best. In many situations it is hard, if possible at all, to make such(More)
The stochastic network calculus (SNC) has become an attractive methodology to derive probabilistic performance bounds. So far the SNC is based on (tacitly assumed) exact probabilistic assumptions about the arrival processes. Yet, in practice, these are only true approximately-at best. In many situations it is hard, if possible at all, to make such(More)
The deterministic network calculus (DNC) and its probabilistic counterpart stochastic network calculus (SNC) are promising theories which provide methodologies to analyse and design networked systems. As the " little brother " of queuing theory, the main goal of network calculus has always been the well-founded design of future networks, since its origins(More)
In this technical report, we provide an in-depth description of the Stochastic Network Calculator tool, henceforth just called “Calculator”. This tool is designed to compute and automatically optimize performance bounds in queueing networks using the methodology of stochastic network calculus (SNC). For a detailed introduction to SNC, see the publicly(More)
  • 1