NETWORK INTRUSION DETECTION SYSTEM USING MODIFIED BLOOM FILTER

This paper presents an efficient implementation of the commonly used hash algorithm selfpostulated in a modified bloom filter along with the details of standard bloom filter, with the counter bloom filter implementation. We have extended the report with a way of improvising the bloom filter in the network layer so that the threats are blocked in the network as well as to make the network safer. A Bloom filter is a simple space-efficient randomized data structure for representing a set in order to support membership queries. Bloom filters allow false positives but the space savings often outweigh this drawback when the probability of an error is controlled. In this paper, we the architectural benefits of hybridizing the filter is clearly given, along with the way to construct it in an efficient manner. By future applications we mainly mean Network based intrusion detectors, which can help in controlling the advanced forms of intrusions threat detection. The aim of this report is to survey the ways in which Bloom filters have been used and modified in a variety of network problems, with the aim of providing a unified mathematical and practical framework for understanding them and stimulating their use in future applications.