Stochastic bounds and histograms for network performance analysis

Abstract : Exact analysis of queueing networks under real traffic histograms becomes quickly intractable due to the state explosion. In this paper, we propose to apply the stochastic comparison method to derive performance measure bounds under histogram-based traffics. We apply an algorithm based on dynamic programming to derive bounding traffic histograms on reduced state spaces. We indeed obtain easier bounding stochastic processes providing stochastic upper and lower bounds on buffer occupancy histograms (queue length distributions) for finite queue models. We evaluate the proposed method under real traffic traces, and we compare the results with those obtained by an approximative method. Numerical results illustrate that the proposed method provides more accurate results with a tradeoff between computation time and accuracy. Moreover, the derived performance bounds are very relevant in network dimensioning.
Type de document :
Communication dans un congrès
EPEW '13 : 10th European Workshop on Performance Engineering, Sep 2013, Venice, Italy. Springer, 8168, pp.13-27, 2013, 〈10.1007/978-3-642-40725-3_3〉
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-00859795
Contributeur : Médiathèque Télécom Sudparis & Institut Mines-Télécom Business School <>
Soumis le : lundi 9 septembre 2013 - 14:43:11
Dernière modification le : jeudi 3 mai 2018 - 16:58:02

Identifiants

Collections

Citation

Farah Ait Salaht, Hind Castel-Taleb, Jean-Michel Fourneau, Nihal Pekergin. Stochastic bounds and histograms for network performance analysis. EPEW '13 : 10th European Workshop on Performance Engineering, Sep 2013, Venice, Italy. Springer, 8168, pp.13-27, 2013, 〈10.1007/978-3-642-40725-3_3〉. 〈hal-00859795〉

Partager

Métriques

Consultations de la notice

199