Flow classification by histograms or how to go on safari in the internet

Performance Evaluation Review

Volumn 32, Issue 1, 2004, Pages 49-60

  Soule, Augustin ^a   Kavé, Salamatian ^a   Taft, Nina ^b   Emiliont, Richard ^c   Papagiannaki, Konstantina ^b  

^a SORBONNE UNIVERSITÉ   (France)

^b INTEL CORPORATION   (United States)

^c UNIVERSITÉ D'ORLÉANS   (France)

Author keywords

Flow classification; Internet traffic; Parameter estimation

Indexed keywords

ALGORITHMS; COMPUTER SYSTEM FIREWALLS; GATEWAYS (COMPUTER NETWORKS); INTERNET; MATHEMATICAL MODELS; PARAMETER ESTIMATION; PROBABILITY;

FLOW CLASSIFICATION; INTERNET TRAFFIC; LOAD BALANCING; TRAFFIC CHARACTERIZATION;

TELECOMMUNICATION TRAFFIC;

EID: 8344259983     PISSN: 01635999     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1012888.1005696     Document Type: Conference Paper

References (17)

1. Jeff Bilmes. A gentle tutorial on the EM algorithm including gaussian mixtures and baum-welch. Technical Report TR-97-021, International Computer Science Institute, Berkeley, CA, 1997.
2. N. Brownlee and KC. Claffy. Understandin internet traffic streams: Dragonflies and tortoise. IEEE communication magazine, pages 110-117, October 2002.
3. Gilles Celeux, Didier Chauveau, and Jean Diebolt. On stochastic versions of the EM algorithm. Technical Report RR-2514, INRIA, 1995.
4. A. P. Dempster, N. M. Laird, and D. B. Rubin. Maximum likelihood from incomplete data via the EM algorithm. 39:1-38, 1977.
5. Michael D. Escobar. Estimating normal means with a dirichlet process prior. Journal of the American Statistical Association, 89(425):268-277, march 1994.
6. Michael D. Escobar and Mike West. Bayesian density estimation and inference using mixtures. Journal of the American Statistical Association, 90(430):577-588, 1995.
7. Cristian Estan and George Varghese. New directions in traffic measurement and accounting. In Proceedings of the First ACM SIGCOMM Workshop on Internet Measurement Workshop, pages 75-80. ACM Press, 2001.
8. R.Emilion Mixtures of orthogonal random distributions and clustering. In Compte Rendu Academie des Sciences de Paris I, 2002(335):189-193.
9. A. Lakhina, K. papagiannaki, M. Crovella, C. Diot, E. Kolaczyk, and N. Taft. Structural analysis of network traffic flows. In ACM Sigmetrics, New York, June 2004.
10. P. Muller, A. Erkanli, and M. West. Bayesian curve-fitting using multivariate normal mixtures. Biometrika, 83(1):67-79, 1996.
11. A. Oveissian, K. Salamatian, and A. Soule. Flow classification on short time scale. Technical Report*, LIP6, 2003.
12. K. Papagiannaki, N. Taft, and C. Diot. Impact of flow dynamics on traffic engineering design principles. In IEEE Infocom, Hong Kong, March 2004.
13. S. Sarvotham J. Rexford and K.Shin. Load-sensitive routing of ling-lived ip flows. In Proc. ACM SIGCOMM, September 1999.
14. Christian P. Robert. The Bayesian Choice. Springer, 2001.
15. Kavé Salamatian and Sandrine Vaton. Hidden markov modeling for network communication channels. In Proceedings of the 2001 ACM BIOMETRICS international conference on Measurement and modeling of computer systems, pages 92-101. ACM Press, 2001.
16. Shriram Sarvotham, Rudolf Riedi, and Richard Baraniuk, Connection-level analysis and modeling of network traffic. ACM SIGCOMM Internet Measurement Workshop, August 2002.
17. Iljitsch van Beijnum. BGP Building Reliable Networks with the Border Gateway Protocol. O'Reilly, 2002.