Modified collision packet classification using counting bloom filter in tuple space

Packet classification continues to be an important challenge in network processing. It requires matching each packet against a database of rules and forwarding the packet according to the highest priority matching rule. Within the packet classification hash-based algorithms, an algorithm that is gaining interest is the tuple space search algorithm that groups the rules into a set of tuple spaces according to their prefix lengths. An incoming packet can now be matched to the rules in a group by taking into consideration only those prefixes specified by the tuples. More importantly, matching of an incoming packet can now be performed in parallel over all tuples. Within these tuple spaces, a drawback of utilizing hashing is that certain rules will be mapped to the same location, also called collision. The negative effect of such collision is that it will result in multiple memory accesses and subsequently longer processing time. In this paper, we propose to use a pruned counting Blo...

• Type: Conference
• Year: 2007
• Where: PDCN
• Authors: Mahmood Ahmadi, Stephan Wong
• Keywords: Distributed And Parallel Computing, Packet Classification, PDCN 2007, Pruned Counting Bloom, Tuple Space