Network traffic shaping based on prediction of polynomial trend self-similar time series
Анотація
In the present paper shaping algorithms development is considered. Most attention is paid to shaping algorithms based on network traffic prediction. Estimates of prediction-based shapers efficiency for different forecasting techniques are obtained. It is shown that a shaping algorithm should take into account both the prehistory and future values of the traffic in order to achieve the maximum of its operation efficiency. The paper presents an adaptive linear predictor of the fractal network traffic and compares it to the simple autoregressive predictor. According to our simulation results, the autoregressive shaper grants significantly smoother output while the adaptive predictor grants significantly lower packet loss ratio.
Класифікація
Ідентифікатори
Рецензії (0)
Написати рецензіюРецензій ще немає. Будьте першим!
Схожі роботи
Multifractality of Self-Avoiding Walks on Percolation Clusters
Схоже за: Theoretical and Computational Physics · Complex Systems and Time Series Analysis
Multifractality of Brownian motion near absorbing polymers
Схоже за: Theoretical and Computational Physics · Complex Systems and Time Series Analysis
On the Relationships between Some Approaches to the Solution of Kirkwood–Salsburg Equations
Схоже за: Theoretical and Computational Physics · Complex Systems and Time Series Analysis
Non-additive properties of finite 1D Ising chains with long-range interactions
Схоже за: Theoretical and Computational Physics · Complex Systems and Time Series Analysis
Field theory of self-organization
Схоже за: Theoretical and Computational Physics · Complex Systems and Time Series Analysis
Superconducting quantum interference in fractal percolation films. Problem of 1/f; noise
Схоже за: Theoretical and Computational Physics · Complex Systems and Time Series Analysis