Multi-protocol query structure for SDN switch based on parallel bloom filter

Parallel Bloom filter is a multi-field query structure which possess high query efficiency and less resource consumption. In this paper, we propose masked parallel Bloom filter with twice verification Hash table (MPBF-TVHT) to achieve full flexibility of multi-protocol query and lower false positive possibility (FPP) for SDN switch. We depict item store and query process of multi-protocol lookup table in all field combinations, analysis influence that different combinations have on FPP and provide effective solutions. Simulation and practical test prove the proposed structure to support adequate table entries while keeping a low FPP for SDN switch.

[1]  Sarang Dharmapurikar,et al.  Longest prefix matching using bloom filters , 2006, IEEE/ACM Transactions on Networking.

[2]  Kang Li,et al.  Approximate caches for packet classification , 2004, IEEE INFOCOM 2004.

[3]  Yu Hua,et al.  A Multi-attribute Data Structure with Parallel Bloom Filters for Network Services , 2006, HiPC.

[4]  Sarang Dharmapurikar,et al.  Implementation results of bloom filters for string matching , 2004, 12th Annual IEEE Symposium on Field-Programmable Custom Computing Machines.

[5]  Josep-Lluís Larriba-Pey,et al.  Dynamic count filters , 2006, SGMD.

[6]  Taskin Koçak,et al.  Low-power bloom filter architecture for deep packet inspection , 2006, IEEE Communications Letters.

[7]  Burton H. Bloom,et al.  Space/time trade-offs in hash coding with allowable errors , 1970, CACM.

[8]  Michael Mitzenmacher,et al.  Compressed bloom filters , 2001, PODC '01.

[9]  Gunjan Tank,et al.  Software-Defined Networking-The New Norm for Networks , 2012 .

[10]  John W. Lockwood,et al.  Deep packet inspection using parallel bloom filters , 2004, IEEE Micro.

[11]  Andrei Broder,et al.  Network Applications of Bloom Filters: A Survey , 2004, Internet Math..

[12]  Andrea Bianco,et al.  OpenFlow Switching: Data Plane Performance , 2010, 2010 IEEE International Conference on Communications.

[13]  Stefano Giordano,et al.  MultiLayer Compressed Counting Bloom Filters , 2008, IEEE INFOCOM 2008 - The 27th Conference on Computer Communications.

[14]  George Varghese,et al.  An Improved Construction for Counting Bloom Filters , 2006, ESA.

[15]  Yu Hua,et al.  Using Parallel Bloom Filters for Multiattribute Representation on Network Services , 2010, IEEE Transactions on Parallel and Distributed Systems.