Stochastic bounds and histograms for active queues management and networks analysis

Abstract : We present an extension of a methodology based on monotonicity of various networking elements and measurements performed on real networks. Assuming the stationarity of flows, we obtain histograms (distributions) for the arrivals. Unfortunately, these distributions have a large number of values and the numerical analysis is extremely time-consuming. Using the stochastic bounds and the monotonicity of the networking elements, we show how we can obtain, in a very efficient manner, guarantees on performance measures. Here, we present two extensions: the merge element which combine several flows into one, and some Active Queue Management (AQM) mechanisms. This extension allows to study networks with a feed-forward topology
Document type :
Conference papers
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-01449260
Contributor : Médiathèque Télécom Sudparis & Institut Mines-Télécom Business School <>
Submitted on : Monday, January 30, 2017 - 11:44:26 AM
Last modification on : Thursday, March 21, 2019 - 1:07:44 PM

Identifiers

Citation

Farah Ait Salaht, Hind Castel-Taleb, Jean-Michel Fourneau, Nihal Pekergin. Stochastic bounds and histograms for active queues management and networks analysis. ASMTA 2016 : 23rd International Conference on Analytical and Stochastic Modelling Techniques and Applications, Aug 2016, Cardiff United Kingdom. Springer, Proceedings ASMTA 2016 : 23rd International Conference on Analytical and Stochastic Modelling Techniques and Applications, pp.1 - 16, 2016, 〈10.1007/978-3-319-43904-4_1〉. 〈hal-01449260〉

Share

Metrics

Record views

166