Design and analysis of a multipacket signature detection system
by N. Sertac Artan, H. Jonathan Chao
International Journal of Security and Networks (IJSN), Vol. 2, No. 1/2, 2007

Abstract: Worm epidemics in the last few years have shown that manual defences against worm epidemics are not practical. Recently, various automatic worm identification methods have been proposed to be deployed at high-speed 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 multipacket signature detection problem is addressed using a defragmentation-free, space-efficient solution. A new data structure – Prefix Bloom Filters (PBFs) – along with a new heuristic, called the Chain Heuristic (CH) is proposed to significantly reduce the storage requirement of the problem, so that multipacket signature detection becomes feasible for high-speed network nodes.

Online publication date: Fri, 16-Mar-2007

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Security and Networks (IJSN):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com