Efficient Prediction of Network Traffic for Real-Time Applications

Table 1

A comparison of compute and storage requirements of traffic predictors where R = register, q(n) = queue of size n, A = addition, S = shift, M = multiply, L = levels, and f = activation function.

Predictor	Equation	Compute	Storage
LV		0	1R
WMA		(n−1)A + 1S	q(n)
DES		6M + 4A	4R
AR		n(M + a)	q(n) + nR
ARMA		(n + m) (M + A)	q(n) + q(m) + (n + m)R
ANN		(2n+2)M + (2n)A + 3f	q(n) + (2n+2)R
Wavelet		(M + A)2L + Ln(M + A)	(L+1)q(n) + (L+1)nR + 2nR