skip to main content
10.1145/1095890.1095920acmconferencesArticle/Chapter ViewAbstractPublication PagesancsConference Proceedingsconference-collections
Article

Fast payload-based flow estimation for traffic monitoring and network security

Published:26 October 2005Publication History

ABSTRACT

Real-time IP flow estimation has many potential applications in network management, monitoring, security, and traffic engineering. Existing techniques typically rely on flow definitions being constrained as subsets of the fields in packet headers. This makes flow-membership tests relatively inexpensive. In this paper, we consider a more general flow estimation problem that needs complex packet-payload based tests for flow-membership. An example is to estimate traffic with common strings in the payload and detect potential virus signatures for early alarm generation. We develop a fast, memory efficient algorithm for solving this problem as a variant of the longest common subsequence problem. This is done via an application of Rabin fingerprinting in combination with Bloom Filters. Both analysis and simulation show the effectiveness of the developed method.

References

  1. Broder, A.Z., "Some Applications of Rabin's Fingerprinting Method", in Sequences II: Methods in Communications, Security and Computer Science, R. Capocelli, A. De Santis, U. Vaccaro (eds) 1993.]]Google ScholarGoogle Scholar
  2. Rao, C.R., Linear Statistical Inference and its Applications, John Wiley, 1973.]]Google ScholarGoogle Scholar
  3. T.S. Ferguson., A Course in Large Sampling Theory, Chapman and Hall, 1996.]]Google ScholarGoogle Scholar
  4. Chan, C, and Lu, H., "Fingerprinting using Polynomials: Rabin's Method", CMPUT690 Technical Report, University of Alberta, 2001.]]Google ScholarGoogle Scholar
  5. H. Kim and B. Karp, "Autograph: Toward Automated, Distributed Work Signature Detection", Proceedings of the 13th Usenix Security Symposium (Security 2004), 2004.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. C. Kreibich and and J. Crowcroft, "Honeycomb- Creating Intrusion Detection Signatures using Honeypots", HotnetsII, 2003.]]Google ScholarGoogle Scholar
  7. C.J. Coit, S. Staniford, and J. McAlerny, "Towards Faster String Matching for Pattern Detection or Exceeding the Speed of Snort", Proceedings of the 2nd DARPA Information Survivability Conference and Exposition (DISCEX II), 2001.]]Google ScholarGoogle ScholarCross RefCross Ref
  8. S. Dharmapurikar, P. Krishnamurthy, T. Sproull, and J. Lockwood, "Deep Packet Inspection using Parallel Bloom Filters", Symposium on High Performance Interconnects (HotI), 2003.]]Google ScholarGoogle ScholarCross RefCross Ref
  9. S. Singh, C. Estan, G. Varghese and S. Savage, "The EarlyBird System for Real-Time Detection of Unknown Works", Technical Report CS2003-0761, UCSD, 2003.]]Google ScholarGoogle Scholar
  10. C. Estan, S. Savage and G. Varghese, "Automatically Inferring Patterns of Resource Consumption in Network Traffic", Proceedings of ACM SIGCOMM, Aug. 2003.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. C. Estan, and G. Varghese, "New Directions in Traffic Measurement and Accounting", Proceedings of ACM SIGCOMM, Aug. 2002.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. C. Estan, G. Varghese, and M. Fisk, "Bitmap Algorithms for Counting Active Flows on High Speed Links", Internet Measurement Conference, Oct. 2003.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. U. Manber, "Finding Similar Files in a Large File System", USENIX Winter 1994 Technical Conference, PP. 1--10, 1994.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. M.O. Rabin "Fingerprinting by Random Polynomials", Center for Research in Computing Technology, Harvard University, Tech Report TR-CSE-03-01, 1981 .]]Google ScholarGoogle Scholar
  15. J. Twycross and M.M. Williamson, , "Implementing and Testing a New Virus Throttle", 12th USENIX Security Symposium, 2003.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. Sprint ATL, http://ipmon.sprint.com.]]Google ScholarGoogle Scholar
  17. http://www.caida.org/analysis/security/witty.]]Google ScholarGoogle Scholar
  18. http://www.clamav.net.]]Google ScholarGoogle Scholar
  19. Hao, F., Kodialam, M., Lakshman, T. V., and Zhang, H., "Fast, Memory-Efficient Traffic Estimation by Coincidence Counting", Proceedings of INFOCOM'2005.]]Google ScholarGoogle Scholar
  20. Hao, F., Kodialam, M., and Lakshman, T. V., "Real-Time Detection of Hidden Traffic Patterns", Proceedings of ICNP'2004.]] Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Fast payload-based flow estimation for traffic monitoring and network security

        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
          ANCS '05: Proceedings of the 2005 ACM symposium on Architecture for networking and communications systems
          October 2005
          230 pages
          ISBN:1595930825
          DOI:10.1145/1095890

          Copyright © 2005 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: 26 October 2005

          Permissions

          Request permissions about this article.

          Request Permissions

          Check for updates

          Qualifiers

          • Article

          Acceptance Rates

          Overall Acceptance Rate88of314submissions,28%

        PDF Format

        View or Download as a PDF file.

        PDF

        eReader

        View online with eReader.

        eReader