HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation
Conference papers

A bounding histogram approach for network performance analysis

Abstract : We analyze the performance of a network under general traffics derived from traces. We apply stochastic comparisons in order to derive bounding histograms with a reduced size and complexity. We prove some stochastic monotonicity properties for the network elements, in order to derive bounds on the performance measures such as delays and losses. We show clearly that this approach provides an attractive solution as a trade-off between accuracy of the results and computation times. Moreover, we compare our results with an approximative method previously published, in order to show the accuracy of the bounds, and to highlight the benefits of our approach for network dimensioning
Document type :
Conference papers
Complete list of metadata

Contributor : Médiathèque Télécom Sudparis & Institut Mines-Télécom Business School Connect in order to contact the contributor
Submitted on : Friday, February 5, 2016 - 11:44:35 AM
Last modification on : Wednesday, October 20, 2021 - 12:24:14 AM



Farah Ait Salaht, Hind Castel-Taleb, Jean-Michel Fourneau, Nihal Pekergin. A bounding histogram approach for network performance analysis. HPCC 2013 : 15th IEEE International Conference on High Performance Computing and Communications, Nov 2013, Zhangjiajie, China. pp.458 - 465, ⟨10.1109/HPCC.and.EUC.2013.72⟩. ⟨hal-01269777⟩



Record views