Probabilistic Performance Analysis of Networks using an Improved Network Service Envelope Approach

TL;DR

This paper introduces an improved stochastic network service envelope that provides tighter end-to-end delay and backlog bounds in networks, enhancing the accuracy of probabilistic performance analysis using stochastic network calculus.

Contribution

It proposes a new definition of stochastic service envelopes that simplifies analysis and yields tighter bounds compared to existing methods.

Findings

Tighter end-to-end performance bounds are achieved.

Performance bounds are bounded by O(H log H), improving over previous methods.

The new envelope is effective for σ(θ), ρ(θ)-constrained traffic models.

Abstract

Stochastic network calculus is an evolving theory which accounts for statistical multiplexing and uses an envelope approach for probabilistic delay and backlog analysis of networks. One of the key ideas of stochastic network calculus is the possibility to describe service offered at network node as a stochastic service envelope, which in turn can be used to describe the stochastic service available in a network of nodes and determine end-to-end probabilistic delay and backlog bounds. This paper introduces a new definition of stochastic service envelopes which yield a simple network service envelope and tighter end-to-end performance bounds. It is shown for ($\sigma(\theta), \rho(\theta)$) - constrained traffic model that the end-to-end performance measures computed using the new stochastic network service envelope are tight in comparison to the ones obtained using the existing start-of-the-art definition of statistical network service envelope and are bounded by ${\cal O}(H \log{H})$, where $H$ is the number of nodes traversed by the arrival traffic.