Of Kernels and Queues: when network calculus meets analytic combinatorics

Abstract : Stochastic network calculus is a tool for computing error bounds on the performance of queueing systems. However, deriving accurate bounds for networks consisting of several queues or subject to non-independent traffic inputs is challenging. In this paper, we investigate the relevance of the tools from analytic combinatorics, especially the kernel method, to tackle this problem. Applying the kernel method allows us to compute the generating functions of the queue state distributions in the stationary regime of the network. As a consequence, error bounds with an arbitrary precision can be computed. In this preliminary work, we focus on simple examples which are representative of the difficulties that the kernel method allows us to overcome.
Document type :
Conference papers
Liste complète des métadonnées

Cited literature [15 references]  Display  Hide  Download

Contributor : Céline Comte <>
Submitted on : Tuesday, October 9, 2018 - 9:10:54 AM
Last modification on : Sunday, October 14, 2018 - 1:01:00 AM
Document(s) archivé(s) le : Thursday, January 10, 2019 - 12:29:38 PM


Files produced by the author(s)


  • HAL Id : hal-01889101, version 1
  • ARXIV : 1810.04875



Anne Bouillard, Céline Comte, Élie de Panafieu, Fabien Mathieu. Of Kernels and Queues: when network calculus meets analytic combinatorics. NetCal 2018, Sep 2018, Vienne, Austria. ⟨hal-01889101⟩



Record views


Files downloads