Paper Info
Title
Memory Cost Analysis For Openflow Multiple Table Lookup
Abstract
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.
Year
Venue
Keywords
2015
2015 28TH IEEE INTERNATIONAL SYSTEM-ON-CHIP CONFERENCE (SOCC)
Packet Classification, Lookup Algorithms, Software-Defined Networking, OpenFlow, Multi Table Lookup
Field
DocType
Citations 
Computer architecture,Computer science,Decision support system,Computer network,OpenFlow,Openflow flow,Cost analysis,Software-defined networking,Packet classification,Embedded memory
Conference
0
PageRank 
References 
Authors
0.34
12
4
Name
Order
Citations
PageRank
Keissy Guerra Perez120.84
Sandra Scott-Hayward220.84
Xin Yang3224.91
Sakir Sezer4101084.22