skip to main content
10.1145/863955.863972acmconferencesArticle/Chapter ViewAbstractPublication PagescommConference Proceedingsconference-collections
Article
Free Access

Automatically inferring patterns of resource consumption in network traffic

Published:25 August 2003Publication History

ABSTRACT

The Internet service model emphasizes flexibility -- any node can send any type of traffic at any time. While this design has allowed new applications and usage models to flourish, it also makes the job of network management significantly more challenging. This paper describes a new method of traffic characterization that automatically groups traffic into minimal clusters of conspicuous consumption. Rather than providing a static analysis specialized to capture flows, applications, or network-to-network traffic matrices, our approach dynamically produces hybrid traffic definitions that match the underlying usage. For example, rather than report five hundred small flows, or the amount of TCP traffic to port 80, or the "top ten hosts", our method might reveal that a certain percent of traffic was used by TCP connections between AOL clients and a particular group of Web servers. Similarly, our technique can be used to automatically classify new traffic patterns, such as network worms or peer-to-peer applications, without knowing the structure of such traffic a priori. We describe a series of algorithms for constructing these traffic clusters and minimizing their representation. In addition, we describe the design of our prototype system, AutoFocus and our experiences using it to discover the dominant and unusual modes of usage on several different production networks.

References

  1. Coralreef - workload characterization. http://www.caida.org/analysis/workload/.Google ScholarGoogle Scholar
  2. Ipmon - packet trace analysis. http://ipmon.sprintlabs.com/packstat/packetoverview.php.Google ScholarGoogle Scholar
  3. R. Agrawal, T. Imielinski, and A. Swami. Mining association rules between sets of items in large databases. In Proceedings of the ACM SIGMOD, 1993. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. N. Duffield, C. Lund, and M. Thorup. Charging from sampled network usage. In SIGCOMM Internet Measurement Workshop, November 2001. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. C. Estan, S. Savage, and G. Varghese. Automatically inferring patterns of resource consumption in network traffic. Technical report CS2003-0746, UCSD.Google ScholarGoogle Scholar
  6. C. Estan and G. Varghese. New directions in traffic measurement and accounting. In Proceedings of the ACM SIGCOMM, 2002. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. A. Gilbert, Y. Kotidis, S. Muthukrishnan, and M. Strauss. Quicksand: Quick summary and analysis of network data. Dimacs technical report, 2001.Google ScholarGoogle Scholar
  8. P. Gupta and N. Mckeown. Packet classification on multiple fields. In Proceedings of the ACM SIGCOMM, 1999. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. J. Han and Y. Fu. Discovery of multiple-level association rules from large databases. In Proceeding of VLDB, 1995. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. T. Hastie, R. Tibshirani, and J. Friedman. The elements of statistical learning. Springer, 2001. pages 453--479.Google ScholarGoogle Scholar
  11. R. Mahajan, S. Bellovin, S. Floyd, J. Ioannidis, V. Paxson, and S. Shenker. ACM SIGCOMM CCR, Vol 32, No. 3, July 2002. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. D. Moore, V. Paxson, S. Savage, C. Shannon, S. Staniford, and N. Weaver. The spread of the sapphire/slammer worm. Technical report, January 2003. http://www.caida.org/outreach/papers/2003/sapphire.Google ScholarGoogle Scholar
  13. Cisco netflow. http://www.cisco.com/warp/public/732/Tech/netflow.Google ScholarGoogle Scholar
  14. D. Plonka. Flowscan: A network traffic flow reporting and visualization tool. In Proceedings of USENIX LISA, 2000. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. S. Saroiu, K. Gummadi, R. Dunn, S. Gribble, and H. Levy. An analysis of internet content delivery systems. In Proceedings of OSDI, 2002. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Automatically inferring patterns of resource consumption in network traffic

    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
      SIGCOMM '03: Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
      August 2003
      432 pages
      ISBN:1581137354
      DOI:10.1145/863955

      Copyright © 2003 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: 25 August 2003

      Permissions

      Request permissions about this article.

      Request Permissions

      Check for updates

      Qualifiers

      • Article

      Acceptance Rates

      SIGCOMM '03 Paper Acceptance Rate34of319submissions,11%Overall Acceptance Rate554of3,547submissions,16%

    PDF Format

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader