Of Kernels and Queues: when network calculus meets analytic combinatorics - Archive ouverte HAL Access content directly
Conference Papers Year :

Of Kernels and Queues: when network calculus meets analytic combinatorics

(1) , (1, 2) , (1) , (1)
1
2
Anne Bouillard
Fabien Mathieu

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.
Fichier principal
Vignette du fichier
paper.pdf (178.44 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01889101 , version 1 (09-10-2018)

Identifiers

Cite

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⟩
102 View
100 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More