Efficient Differentiated Storage Architecture for Large-Scale Flow Tables in OpenFlow Networks

Abstract

As a novel network paradigm, Software Defined Networking (SDN) decouples control logic functions from data forwarding devices, and introduces a separate control plane to manipulate underlying switches via southbound interfaces like OpenFlow. However, it leads to large-scale flow tables and poses serious challenges on their storage resources and lookup performance in OpenFlow switches. This paper is thus motivated to propose an efficient differentiated storage architecture for large-scale flow tables in OpenFlow networks. Firstly, we investigate into the impact of wildcards in match fields on packet-in-batch property within a flow based on network traffic locality. Then, packet flows are dynamically distinguished into active ones and idle ones in terms of their short-term states. Subsequently, we store the match fields of active flows and idle flows respectively in TCAM and SRAM, and the content fields of both types of flows in DRAM, to effectively relieve the insufficiency of TCAM capacity. Finally, we evaluate the performance of our proposed flow table storage architecture with real network traffic traces by experiments. The experimental results indicate that our proposed storage architecture obviously outperforms the traditional one applying the elephant/mice flow differentiation method in terms of TCAM hit rates and average flow table access time.