skip to main content
10.1145/1368436.1368445acmconferencesArticle/Chapter ViewAbstractPublication PagesconextConference Proceedingsconference-collections
research-article

Early application identification

Published:04 December 2006Publication History

ABSTRACT

The automatic detection of applications associated with network traffic is an essential step for network security and traffic engineering. Unfortunately, simple port-based classification methods are not always efficient and systematic analysis of packet payloads is too slow. Most recent research proposals use flow statistics to classify traffic flows once they are finished, which limit their applicability for online classification. In this paper, we evaluate the feasibility of application identification at the beginning of a TCP connection. Based on an analysis of packet traces collected on eight different networks, we find that it is possible to distinguish the behavior of an application from the observation of the size and the direction of the first few packets of the TCP connection. We apply three techniques to cluster TCP connections: K-Means, Gaussian Mixture Model and spectral clustering. Resulting clusters are used together with assignment and labeling heuristics to design classifiers. We evaluate these classifiers on different packet traces. Our results show that the first four packets of a TCP connection are sufficient to classify known applications with an accuracy over 90% and to identify new applications as unknown with a probability of 60%.

References

  1. Community Resource for Archiving Wireless Data At Dartmouth: http://crawdad.cs.dartmouth.edu/.Google ScholarGoogle Scholar
  2. M2C Measurement Data Repository: http://m2c-a.ewi.utwente.nl/repository/.Google ScholarGoogle Scholar
  3. L. E. Baum, T. Petrie, G. Soules, and N. Weiss. A maximization technique occurring in the statistical analysis of probabilistic functions of markov chains. The Annals of Mathematical Statistics, 1970.Google ScholarGoogle ScholarCross RefCross Ref
  4. L. Bernaille, A. Soule, M.-I. Jeannin, and K. Salamatian. Blind application flow recognition through behavioral classification. Technical report, Laboratoire d'Informatique de Paris 6, Université Pierre et Marie Curie, http://www-rp.lip6.fr/~bernaill/techreport.pdf, 2005.Google ScholarGoogle Scholar
  5. L. Bernaille, R. Teixeira, I. Akodkenou, A. Soule, and K. Salamatian. Traffic classification on the fly. SIGCOMM Comput. Commun. Rev., 2006. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. H. Binsztok, T. Artires, and P. Gallinari. A model-based approach to sequence clustering. In ECAI, Madrid, 2004.Google ScholarGoogle Scholar
  7. R. Boyer and J. Moore. A fast string searching algorithm. Communications of the ACM, 1977. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. A. P. Dempster, N. M. Laird, and D. B. Rubin. Maximum likelihood from incomplete data via the em algorithm. Journal of the Royal Statistical Society. Series B (Methodological), 39(1):1--38, 1977.Google ScholarGoogle ScholarCross RefCross Ref
  9. Endace. http://www.endace.com.Google ScholarGoogle Scholar
  10. J. Erman, M. Arlitt, and A. Mahanti. Traffic classification using clustering algorithms. In MineNet'06: Proceedings of the 2006 SIGCOMM workshop on Mining network data, pages 281--286, New York, NY, USA, 2006. ACM Press. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. I. Fischer and J. Poland. New methods for spectral clustering. Technical report, IDISA, June 2004.Google ScholarGoogle Scholar
  12. T. Henderson, D. Kotz, and I. Abyzov. The changing usage of a mature campus-wide wireless network. In MobiCom '04: Proceedings of the 10th annual international conference on Mobile computing and networking, pages 187--201, New York, NY, USA, 2004. ACM Press. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. N. Hohn and D. Veitch. Inverting sampled traffic. In Proceedings of the 3rd ACM SIGCOMM conference on Internet measurement, 2003. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. IPMON. ipmon.sprintlabs.com.Google ScholarGoogle Scholar
  15. T. Karagiannis, A. Broido, N. Brownlee, K. Claffy, and M. Faloutsos. Is p2p dying or just hiding? In Globecom, 2004.Google ScholarGoogle ScholarCross RefCross Ref
  16. T. Karagiannis, D. Papagiannaki, and M. Faloutsos. Blinc: Multilevel traffic classification in the dark. In SIGCOMM, 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. Ma, Levchenko, Kreibich, Savage, and Voelker. Unexpected means of protocol inference. In Internet Measurement Confererence, 2006. Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. A. McGregor, M. Hall, P. Lorier, and J. Brunskill. Flow clustering using machine learning techniques. In Passive and Active Measurement, 2004.Google ScholarGoogle ScholarCross RefCross Ref
  19. A. Moore and D. Zuev. Internet traffic classification using bayesian analysis. In Sigmetrics, 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. A. Ng, M. Jordan, and Y. Weiss. On spectral clustering : analysis and an algorithm. In NIPS, 2001.Google ScholarGoogle Scholar
  21. F. Porikli. Trajectory distance metric using hidden markov model based representation. In IEEE European Conference on Computer Vision, PETS Workshop, 2004.Google ScholarGoogle Scholar
  22. Qosmos. http://www.qosmos.com.Google ScholarGoogle Scholar
  23. M. Roughan, S. Sen, O. Spatscheck, and N. Duffield. A statistical signature-based approach to ip traffic classification. In IMC, 2004. Google ScholarGoogle ScholarDigital LibraryDigital Library
  24. P. Smyth. Clustering sequences with hidden markov models. In Advances in Neural Information Processing, 1997.Google ScholarGoogle Scholar
  25. Snort. http://www.snort.org.Google ScholarGoogle Scholar
  26. A. Strehl and J. Ghosh. Cluster ensembles --- a knowledge reuse framework for combining multiple partitions. Journal on Machine Learning Research (JMLR), 2002. Google ScholarGoogle ScholarDigital LibraryDigital Library
  27. K. Suh, D. R. Figueiredo, J. Kurose, and D. Towsley. Characterizing and detecting relayed traffic: A case study using skype. In IEEE Infocom, 2006.Google ScholarGoogle Scholar
  28. D. Zuev and A. Moore. Traffic classification using a statistical approach. In Passive and Active Measurement, 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Early application identification

      Recommendations

      Comments

      Login options

      Check if you have access through your login credentials or your institution to get full access on this article.

      Sign in
      • Published in

        cover image ACM Conferences
        CoNEXT '06: Proceedings of the 2006 ACM CoNEXT conference
        December 2006
        318 pages
        ISBN:1595934561
        DOI:10.1145/1368436

        Copyright © 2006 ACM

        Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

        Publisher

        Association for Computing Machinery

        New York, NY, United States

        Publication History

        • Published: 4 December 2006

        Permissions

        Request permissions about this article.

        Request Permissions

        Check for updates

        Qualifiers

        • research-article

        Acceptance Rates

        Overall Acceptance Rate198of789submissions,25%

      PDF Format

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader