Recursive EM algorithm for finite mixture models with application to Internet traffic modeling

In the past decade, many 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 distributio...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Second Annual Conference on Communication Networks and Services Research : proceedings : 19-21 May, 2004, Fredericton, N.B., Canada s. 198 - 207
Hlavní autoři: Liu, Z., Almhana, J., Choulakian, V., McGorman, R.
Médium: Konferenční příspěvek
Jazyk:angličtina
Vydáno: IEEE 2004
Témata:
Approximation algorithms
Bayesian methods
Hidden Markov models
Internet
Maximum likelihood estimation
Probability density function
Probability distribution
Random variables
Telecommunication traffic
Traffic control
ISBN:0769520960, 9780769520964
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:In the past decade, many 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, the paper uses mixture distributions to model 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, the paper proposes a recursive EM algorithm to fit 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.
ISBN:0769520960
9780769520964
DOI:10.1109/DNSR.2004.1344729