Stochastic Worst Case Analysis of Window Flow Controlled Systems

This paper applies stochastic network calculus (SNC) to window flow controllers. These controllers limit the arrivals to a protected part of the queueing system. Although deterministic network calculus (DNC) provides a worst-case analysis, a probabilistic extension has been unavailable so far. This paper presents two methods to treat window flow controlled systems within SNC: The first is a topological change to enforce a subadditive feedback loop. The second method, instead, bounds the probability to not have a subadditive feedback loop. A numerical example demonstrates how both methods significantly improve the deterministic results.