A bounding histogram approach for network performance analysis - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2013

A bounding histogram approach for network performance analysis

Résumé

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
Fichier non déposé

Dates et versions

hal-01269777 , version 1 (05-02-2016)

Identifiants

Citer

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⟩
109 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More