OpenFlow flow table memory space compression method

Abstract

The invention relates to an OpenFlow flow table memory space compression method. The method includes the steps of analyzing the structural features of OpenFlow flow tables, carrying out classification on the OpenFlow flow tables according to the collision relation and coexistence relation of flow table item fields, dividing initial flow table items in different classes to be stored and converting a flow table which is large in scale and complex in structure into a plurality of flow tables which are smaller in scale and simple in structure, in addition, setting a dynamic adjusting threshold value according to the frequent and fast updating features of the OpenFlow flow tables, and optimizing a flow table memory space by carrying out splitting or merging operation on the existing classes. The OpenFlow flow table memory space compression method can effectively reduce the flow table memory space, adapt to the dynamic and fast updating of the OpenFlow flow tables and enable the compression ratio of the flow table memory space to be stabilized by around 70%, and therefore the memory compression ratio similar to that of the best method by using less running time can be achieved.

Description

technical field [0001] The invention belongs to the field of information technology, and relates to an efficient heuristic OpenFlow flow table storage space compression method. According to the conflict and coexistence relationship between flow table item fields, large-scale and complex structure flow tables are converted into multiple smaller-scale, The flow table has a simple structure, and the dynamic adjustment threshold is set according to the frequent and fast update characteristics of the OpenFlow flow table to optimize the storage space of the flow table. Background technique [0002] With the rapid expansion of the network scale and the continuous enrichment of application types, the structure and functions of the traditional Internet have become increasingly complex and rigid, and the ability to manage and control the network has gradually weakened. The application and the network are relatively separated. The application cannot perceive the state of the network an...

AI Technical Summary

Problems solved by technology

[0006] Traditional packet classification algorithms are mainly used in low-dimensional small rule bases, and are not suitable for dynamic update of rule bases, and cannot directly and effectively solve the search problem of large-scale and complex OpenFlow flow tables

The optimization algorithm for routing table and ACL storage space is mainly proposed for the specific structure of routing table entries and ACL entries, which is not scalable

Images