String matching on the Internet

Hervé Brönnimann, Nasir Memon, Kulesh Shanmugasundaram

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

The problem of string matching in a stream of network packets was studied. The system is part of a larger system for facilitating network forensics across and within networks. The system that was implemented monitors network traffic, creates hash-based digests of payload, and archives them periodically. A user-friendly query mechanism provides the interface to answer post-morterm questions about the payload.

Original languageEnglish (US)
Title of host publicationLecture Notes in Computer Science
EditorsA. Lopez-Ortiz, A. Hamel
Pages75-89
Number of pages15
Volume3405
StatePublished - 2005
EventFirst Workshop on Combinatorial and Algorithmic Aspects of Networking, CAAN 2004 - Alberta, Canada
Duration: Aug 5 2004Aug 7 2004

Other

OtherFirst Workshop on Combinatorial and Algorithmic Aspects of Networking, CAAN 2004
CountryCanada
CityAlberta
Period8/5/048/7/04

    Fingerprint

ASJC Scopus subject areas

  • Computer Science (miscellaneous)

Cite this

Brönnimann, H., Memon, N., & Shanmugasundaram, K. (2005). String matching on the Internet. In A. Lopez-Ortiz, & A. Hamel (Eds.), Lecture Notes in Computer Science (Vol. 3405, pp. 75-89)