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.
CITATION STYLE
Aït-Salaht, F., Castel-Taleb, H., Fourneau, J. M., & Pekergin, N. (2016). Stochastic bounds and histograms for active queues management and networks analysis. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9845 LNCS, pp. 1–16). Springer Verlag. https://doi.org/10.1007/978-3-319-43904-4_1
Mendeley helps you to discover research relevant for your work.