Dynamic Bloom Filter for Intelligent Routing

Abstract - Enterprise networks that operate at high speeds need routing techniques which are able to efficiently handle large IP forwarding tables and at the same time identify and filter out suspicious traffic. Typically, the traditional routing and security mechanisms rely on separate look-up structures, and as the size of the network and the type of traffic evolve, this results in increased memory access and processing overhead. This paper proposes a Dynamic Bloom Filter for Intelligent Routing (D-BF). D-BF is a hybrid solution, which combines a longest-prefix matching via Patricia-Trie and a packet screening via dynamically managed Bloom filter. The Patricia Trie supports efficient and guaranteed IP route queries and the Dynamic Bloom Filter enables maintaining compact representations of the current flow states and making simple security decisions. The framework is designed to enable dynamic updates, scalable routing and intrusion detection in a varying traffic scenario. The experimental evaluation considers the routing throughput, the look-up latency, the memory utilization, the false positive rate, packet-filtering performance and scalability. The result demonstrates the capability of the integrated routing and security architecture to achieve high throughput in forwarding and at the same time provide an efficient way to perform stateful packet filtering. The method proposed offers a viable framework to integrate intelligent routing and network security in a unique packet-processing mechanism.