Multi-packet signature detection using prefix bloom filters

N. Sertac Artan, H. Jonathan Chao

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

Abstract

It is now a fact that manual defenses against worm epidemics are not practical. Recently, various automatic worm identification methods are proposed to be deployed at highspeed network nodes to respond in time to fast infection rates of worms. Unfortunately, these methods can easily be evaded by fragmentation of the worm packets. The straightforward defragmentation method is not applicable for these high-speed nodes, due to its high storage (memory) requirement. In this paper, this problem, namely the multi-packet signature detection problem is addressed using a defragmentation-free, spaceefficient solution. A new data structure - Prefix Bloom Filters along with a new heuristic, called the chain heuristic is proposed to significantly reduce the storage requirement of the problem, so that multi-packet signature detection becomes feasible for highspeed network nodes.

Original languageEnglish (US)
Title of host publicationGLOBECOM'05: IEEE Global Telecommunications Conference, 2005
Pages1811-1816
Number of pages6
Volume3
DOIs
StatePublished - 2005
EventGLOBECOM'05: IEEE Global Telecommunications Conference, 2005 - St. Louis, MO, United States
Duration: Nov 28 2005Dec 2 2005

Other

OtherGLOBECOM'05: IEEE Global Telecommunications Conference, 2005
CountryUnited States
CitySt. Louis, MO
Period11/28/0512/2/05

Fingerprint

Data structures
Data storage equipment

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Artan, N. S., & Chao, H. J. (2005). Multi-packet signature detection using prefix bloom filters. In GLOBECOM'05: IEEE Global Telecommunications Conference, 2005 (Vol. 3, pp. 1811-1816). [1577961] https://doi.org/10.1109/GLOCOM.2005.1577961

Multi-packet signature detection using prefix bloom filters. / Artan, N. Sertac; Chao, H. Jonathan.

GLOBECOM'05: IEEE Global Telecommunications Conference, 2005. Vol. 3 2005. p. 1811-1816 1577961.

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

Artan, NS & Chao, HJ 2005, Multi-packet signature detection using prefix bloom filters. in GLOBECOM'05: IEEE Global Telecommunications Conference, 2005. vol. 3, 1577961, pp. 1811-1816, GLOBECOM'05: IEEE Global Telecommunications Conference, 2005, St. Louis, MO, United States, 11/28/05. https://doi.org/10.1109/GLOCOM.2005.1577961
Artan NS, Chao HJ. Multi-packet signature detection using prefix bloom filters. In GLOBECOM'05: IEEE Global Telecommunications Conference, 2005. Vol. 3. 2005. p. 1811-1816. 1577961 https://doi.org/10.1109/GLOCOM.2005.1577961
Artan, N. Sertac ; Chao, H. Jonathan. / Multi-packet signature detection using prefix bloom filters. GLOBECOM'05: IEEE Global Telecommunications Conference, 2005. Vol. 3 2005. pp. 1811-1816
@inproceedings{0382f00f9b2e4cc49ef606b7601d5068,
title = "Multi-packet signature detection using prefix bloom filters",
abstract = "It is now a fact that manual defenses against worm epidemics are not practical. Recently, various automatic worm identification methods are proposed to be deployed at highspeed network nodes to respond in time to fast infection rates of worms. Unfortunately, these methods can easily be evaded by fragmentation of the worm packets. The straightforward defragmentation method is not applicable for these high-speed nodes, due to its high storage (memory) requirement. In this paper, this problem, namely the multi-packet signature detection problem is addressed using a defragmentation-free, spaceefficient solution. A new data structure - Prefix Bloom Filters along with a new heuristic, called the chain heuristic is proposed to significantly reduce the storage requirement of the problem, so that multi-packet signature detection becomes feasible for highspeed network nodes.",
author = "Artan, {N. Sertac} and Chao, {H. Jonathan}",
year = "2005",
doi = "10.1109/GLOCOM.2005.1577961",
language = "English (US)",
isbn = "0780394143",
volume = "3",
pages = "1811--1816",
booktitle = "GLOBECOM'05: IEEE Global Telecommunications Conference, 2005",

}

TY - GEN

T1 - Multi-packet signature detection using prefix bloom filters

AU - Artan, N. Sertac

AU - Chao, H. Jonathan

PY - 2005

Y1 - 2005

N2 - It is now a fact that manual defenses against worm epidemics are not practical. Recently, various automatic worm identification methods are proposed to be deployed at highspeed network nodes to respond in time to fast infection rates of worms. Unfortunately, these methods can easily be evaded by fragmentation of the worm packets. The straightforward defragmentation method is not applicable for these high-speed nodes, due to its high storage (memory) requirement. In this paper, this problem, namely the multi-packet signature detection problem is addressed using a defragmentation-free, spaceefficient solution. A new data structure - Prefix Bloom Filters along with a new heuristic, called the chain heuristic is proposed to significantly reduce the storage requirement of the problem, so that multi-packet signature detection becomes feasible for highspeed network nodes.

AB - It is now a fact that manual defenses against worm epidemics are not practical. Recently, various automatic worm identification methods are proposed to be deployed at highspeed network nodes to respond in time to fast infection rates of worms. Unfortunately, these methods can easily be evaded by fragmentation of the worm packets. The straightforward defragmentation method is not applicable for these high-speed nodes, due to its high storage (memory) requirement. In this paper, this problem, namely the multi-packet signature detection problem is addressed using a defragmentation-free, spaceefficient solution. A new data structure - Prefix Bloom Filters along with a new heuristic, called the chain heuristic is proposed to significantly reduce the storage requirement of the problem, so that multi-packet signature detection becomes feasible for highspeed network nodes.

UR - http://www.scopus.com/inward/record.url?scp=33846612446&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=33846612446&partnerID=8YFLogxK

U2 - 10.1109/GLOCOM.2005.1577961

DO - 10.1109/GLOCOM.2005.1577961

M3 - Conference contribution

SN - 0780394143

SN - 9780780394148

VL - 3

SP - 1811

EP - 1816

BT - GLOBECOM'05: IEEE Global Telecommunications Conference, 2005

ER -