Communication Networks and Services Research, Annual Conference on (2004)
Fredericton, N.B., Canada
May 19, 2004 to May 21, 2004
Z. Liu , University of Moncton
J. Almhana , University of Moncton
V. Choulakian , University of Moncton
R. McGorman , Nortel Networks
In the past decade, a lot of quantities characterizing high-speed telecommunication network performance have been reported to have heavy-tailed distributions, namely, with tails decreasing hyperbolically rather than exponentially. Since mixture distributions can approximate many heavy-tailed distributions with high precision, this paper uses mixture distributions to model the Internet traffic and applies the EM algorithm to fit the models. Making use of the fact that at each iteration of the EM algorithm the parameter increment has a positive projection on the gradient of the likelihood function, this paper proposes a recursive EM algorithm to .t the models, and the Bayesian Information Criterion is applied to select the best model. To illustrate the efficiency of the proposed algorithm, numerical results and experimental results on real traffic are provided.
Internet traffic, EM Algorithm, mixture distribution, stochastic approximation, Bayesian information criterion
R. McGorman, J. Almhana, V. Choulakian and Z. Liu, "Recursive EM Algorithm for Finite Mixture Models with Application to Internet Traffic Modeling," Communication Networks and Services Research, Annual Conference on(CNSR), Fredericton, N.B., Canada, 2004, pp. 198-207.