A forward-backward algorithm for nested hidden semi-markov model and application to network traffic

Computer Journal

Volumn 56, Issue 2, 2013, Pages 229-238

  Xie, Yi ^a   Hu, J ^b   Tang, S ^c   Huang, X ^a  

^a SUN YAT SEN UNIVERSITY   (China)

^b UNIVERSITY OF NEW SOUTH WALES   (Australia)

^c MISSOURI WESTERN STATE UNIVERSITY   (United States)

Author keywords

forward backward algorithm; nested HsMM; network traffic

Indexed keywords

APPLICATION ENVIRONMENT; ARRIVAL PROCESS; CORE LAYERS; CROSS CORRELATIONS; DRIVING FACTORS; DWELL TIME; EXPONENTIAL DISTRIBUTIONS; FORWARD BACKWARD ALGORITHMS; HIDDEN SEMI-MARKOV MODELS; NESTED HSMM; NETWORK TRAFFIC; PERFORMANCE EVALUATION; REAL TRAFFIC; RECURSIONS; SELF-SIMILARITIES; SEMI-MARKOV CHAIN; STATE PROCESS; STATISTICAL DISTRIBUTION; SYSTEM STATE; TEMPORAL STRUCTURES; TIME DYNAMIC; VARIABLE PERIOD;

ALGORITHMS; HIDDEN MARKOV MODELS; RANDOM PROCESSES;

COMPUTER SIMULATION;

EID: 84873379218     PISSN: 00104620     EISSN: 14602067     Source Type: Journal    
DOI: 10.1093/comjnl/bxs124     Document Type: Article

References (24)

1. Fine, S., Singer,Y. and Tishby, N. (1998) The hierarchical hidden Markov model: analysis and applications. Mach. Learn., 32, 41-62.
2. Xie,Y.,Yu, S.,Tang, S. and Huang, X. (2011)ATwo-layer Hidden Markov Model for The Arrival Process ofWeb Traffic. The 19th Int. Symp. on Modeling, Analysis and Simulation of Computer and Telecommunication Systems (MASCOTS), Singapore, July 25-27, pp. 469-471. IEEE Computer Society, Los Alamitos, CA, USA.
3. Zhao, J. and Liu, F. (2008) Product named entity recognition in Chinese text. Lang. Res. Eval., 42, 197-217.
4. Kawanaka, D., Okatani, T. and Deguchi, K. (2006) HHMM based recognition of human activity. IEICE Trans. Inf. Syst., 89, 2180-2185.
5. Zhong, S. and Ghosh, J. (2002) HMMs and Coupled HMMs for Multi-Channel EEG Classification. Proc. 2002 Int. Joint Conf. on Neural Networks, Honolulu, HI, May 12-17, pp. 1154-1159. IEEE, Piscataway, NJ, USA.
6. Shi, J. and Zhang,Y. (2010) Using Hierarchical Hidden Markov Models to Perform Sequence-Based Classification of Protein Structure. The 10th Int. Conf. on Signal Processing, Beijing, China, October 24-28, pp. 1789-1792. IEEE.
7. Rabiner, L. (1989) A tutorial on hidden Markov models and selected applications in speech recognition. Proc. IEEE, 77, 257-286.
8. Barbu, V. and Limnios, N. (2008) Semi-Markov Chains and Hidden Semi-Markov Models Toward Applications: Their Use in Reliability and DNA Analysis. Springer.
9. Yu, S. (2010) Hidden semi-Markov models. Artif. Intell., 174, 215-243.
10. Bui, H., Venkatesh, S. and West, G. (2002) Policy recognition in the abstract hidden Markov model. J. Artif. Intell. Res., 17, 451-499.
11. Brand, M., Oliver, N. and Pentland, A. (1997) Coupled Hidden Markov Models for Complex Action Recognition. Proc. Computer Vision and Pattern Recognition, San Juan, June 17-19, pp. 994-999. IEEE Computer Society.
12. Scott, S. and Hann, I. (2006) A Nested Hidden Markov Model for Internet Browsing Behavior. http://stevethebayesian. com/nested-hmm.pdf. (accessed August 25, 2012).
13. Adibi, J. and Shen, W.-M. (2001) Self-Similar Layered Hidden Markov Models. Principles of Data Mining and Knowledge Discovery, Lecture Notes in Computer Science, Vol. 2168, pp. 1-15. Springer, Berlin/Heidelberg.
14. Dománska, J., Dománski, A. and Czachórski, T. (2011) Internet Traffic Source Based on Hidden Markov Model. Smart Spaces and Next Generation Wired/Wireless Networking, Lecture Notes in Computer Science, Vol. 6869, pp. 395-404. Springer, Berlin/Heidelberg.
15. Nogueira, A., Salvador, P., Valadas, R. and Pacheco, A. (2011) Markovian modelling of internet traffic. Netw. Perform. Eng., 5233, 98-124.
16. Kobayashi, H. and Mark, B.L. (2009) System Modeling and Analysis: Foundations of System Performance Evaluation. Prentice Hall.
17. Popescu, A. (1999) Traffic Self-Similarity. Technical Report. Blekinge Institute of Technology, Karlskrona, Sweden. white paper.
18. Akaike, H. (1973) Information Theory and an Extension of the Maximum Likelihood Principle. 2nd Int. Symp. on Information Theory, Tsahkadsor, Armenia, USSR, September 2-8, pp. 267-281. Springer.
19. Hannan, E. and Quinn, B. (1979) The determination of the order of an autoregression. J. R. Stat. Soc. Ser. B (Methodol.), 41, 190-195.
20. Schwarz, G. (1978) Estimating the dimension of a model. Ann. Statist., 6, 461-464.
21. Biernacki, C., Celeux, G. and Govaert, G. (2000) Assessing a mixture model for clustering with the integrated completed likelihood. IEEE Trans. Pattern Anal. Mach. Intell., 22, 719-725.
22. Yang, Z. and Zwolinski, M. (2001) Mutual information theory for adaptive mixture models. IEEE Trans. Pattern Anal. Mach. Intell., 23, 396-403.
23. Likas, A., Vlassis, N. and JVerbeek, J. (2003) The global k-means clustering algorithm. Pattern Recognit., 36, 451-461.
24. McLachlan, G. and Peel, D. (2000) Finite Mixture Models.Wiley- Interscience.