Bit vector algorithms enabling high-speed and memory-efficient firewall blacklisting

摘要: In a world of increasing Internet connectivity coupled with computer security risks, conscious network applications implementing blacklisting technology are becoming very prevalent because it provides the ability to prevent information exchange from known malicious sources. Current does so at application level. However, there numerous benefits for filters in firewall. These include reduced workload and bandwidth consumption. But, de facto algorithm firewalls is based on linear search first match principle, large blacklists not feasible implement due O(N) timing complexity methods. This paper addresses this issue by describing techniques that solve time without changing internal input-output behavior