Memory cost analysis for OpenFlow multiple table lookup

Multiple Table Lookup architectures in Software Defined Networking (SDN) open the door for exciting new network applications. The development of the OpenFlow protocol supported the SDN paradigm. However, the first version of the OpenFlow protocol specified a single table lookup model with the associated constraints in flow entry numbers and search capabilities. With the introduction of multiple table lookup in OpenFlow v1.1, flexible and efficient search to support SDN application innovation became possible. However, implementation of multiple table lookup in hardware to meet high performance requirements is non-trivial. One possible approach involves the use of multi-dimensional lookup algorithms. A high lookup performance can be achieved by using embedded memory for flow entry storage. A detailed study of OpenFlow flow filters for multi-dimensional lookup is presented in this paper. Based on a proposed multiple table lookup architecture, the memory consumption and update performance using parallel single field searches are evaluated. The results demonstrate an efficient multi-table lookup implementation with minimum memory usage.

[1]  Viktor K. Prasanna,et al.  Multi-dimensional packet classification on FPGA: 100 Gbps and beyond , 2010, 2010 International Conference on Field-Programmable Technology.

[2]  Jonathan S. Turner,et al.  Scalable packet classification using distributed crossproducing of field labels , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[3]  Gergely Pongrácz,et al.  Removing Roadblocks from SDN: OpenFlow Software Switch Performance on Intel DPDK , 2013, 2013 Second European Workshop on Software Defined Networks.

[4]  Yves Lemieux,et al.  A 100Gig network processor platform for openflow , 2011, 2011 7th International Conference on Network and Service Management.

[5]  Sakir Sezer,et al.  Queen ' s University Belfast-Research Portal Are We Ready for SDN ? Implementation Challenges for Software-Defined Networks , 2016 .

[6]  Haitao Wu,et al.  ServerSwitch: A Programmable and High Performance Platform for Data Center Networks , 2011, NSDI.

[7]  Venkatachary Srinivasan,et al.  Packet classification using tuple space search , 1999, SIGCOMM '99.

[8]  Xin Yang,et al.  An improvement of IP address lookup based on rule filter analysis , 2014, 2014 IEEE International Conference on Communications Workshops (ICC).

[9]  T. V. Lakshman,et al.  High-speed policy-based packet forwarding using efficient multi-dimensional range matching , 1998, SIGCOMM '98.

[10]  R. Avudaiammal,et al.  TTSS Packet Classification Algorithm to enhance Multimedia Applications in Network Processor based Router , 2009, ArXiv.

[11]  Sakir Sezer,et al.  A configurable packet classification architecture for Software-Defined Networking , 2014, 2014 27th IEEE International System-on-Chip Conference (SOCC).

[12]  Haoyu Song,et al.  Protocol-oblivious forwarding: unleash the power of SDN through a future-proof forwarding plane , 2013, HotSDN '13.

[13]  Jose Flich,et al.  Switch Architecture , 2011, Encyclopedia of Parallel Computing.

[14]  Viktor K. Prasanna,et al.  Scalable Packet Classification on FPGA , 2012, IEEE Transactions on Very Large Scale Integration (VLSI) Systems.

[15]  George Varghese,et al.  Packet classification using multidimensional cutting , 2003, SIGCOMM '03.

[16]  George Varghese,et al.  Programming Protocol-Independent Packet Processors , 2013, ArXiv.

[17]  Nick McKeown,et al.  Packet classification on multiple fields , 1999, SIGCOMM '99.