@inproceedings{14021f0fe0a543c8a2c1cd25ae2c599e,
title = "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.",
keywords = "Histogram-based traffic models, Network QoS, Stochastic Comparison",
author = "Farah A{\"i}t-Salaht and Hind Castel-Taleb and Fourneau, \{Jean Michel\} and Nihal Pekergin",
year = "2013",
month = jan,
day = "1",
doi = "10.1007/978-3-642-40725-3\_3",
language = "English",
isbn = "9783642407246",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "13--27",
booktitle = "Computer Performance Engineering - 10th European Workshop, EPEW 2013, Proceedings",
note = "10th European Workshop on Performance Engineering, EPEW 2013 ; Conference date: 16-09-2013 Through 17-09-2013",
}