Tag-In-Tag: Efficient flow table management in SDN switches

Banerjee, Subhasis; Kannan, Kalapriya

doi:10.1109/cnsm.2014.7014147

Cited by 48 publications

(30 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…It is possible to execute 12 sequential look-ups on a single DBF. The probability of a positive match is around 0.9 for the flow table look ups [37], [39].…”

Section: Use Of Dbf In Practical Applicationsmentioning

confidence: 99%

A Fast and Accurate Hardware String Matching Module with Bloom Filters

Zengin

Schmidt

2016

IEEE Trans. Parallel Distrib. Syst.

View full text Add to dashboard Cite

Many fields of computing such as Deep Packet Inspection (DPI) employ string matching modules (SMM) that search for a given set of positive strings in their input. An SMM is expected to produce correct outcomes while scanning the input data at high rates. Furthermore the string sets that are searched for are usually large and their sizes increase steadily. Bloom Filters (BFs) are hashing data structures which are fast but their false positive results require further processing. That is, their speed can be exploited for Standard Bloom Filter SMMs (SBFs) as long as the positive probability is low. Multiple BFs in parallel can further increase the throughput. In this paper, we propose the Double Bloom Filter SMM (DBF) which achieves a higher throughput than the SBF and maintains a high throughput even for large positive probabilities. The second Bloom Filter of DBF stores a small enough subset of the positive strings such that its false positive probability is approximately zero. We develop an analytical model of the DBF and show that the throughput advantage of DBF over SBF becomes more prominent if the positive probability and the fraction of matches in the second Bloom Filter increase. Accordingly, we propose a heuristic algorithm that stores the strings that are more frequently matched in the second Bloom Filter according to localities identified in the input. Our numerical results are obtained using realistic values from an FPGA implementation and are validated by SystemC simulations.Index Terms-Bloom filter, string matching, deep packet inspection, field programmable gate array (FPGA) ! • S. Zengin is with the Defense

show abstract

“…It is possible to execute 12 sequential look-ups on a single DBF. The probability of a positive match is around 0.9 for the flow table look ups [37], [39].…”

Section: Use Of Dbf In Practical Applicationsmentioning

confidence: 99%

A Fast and Accurate Hardware String Matching Module with Bloom Filters

Zengin

Schmidt

2016

IEEE Trans. Parallel Distrib. Syst.

View full text Add to dashboard Cite

show abstract

“…This method has achieved an overhead distribution by spreading the controllers over the network, but is not practical due to handover problems between multiple controllers and an absence of a standard east-west bound API that is the interface between the controllers. [8] suggests a tag-in-tag scheme. This is a method to reduce the flow table size by routing multiple flows via specific paths.…”

Section: Related Workmentioning

confidence: 99%

Proactive-LRU: An Efficient Flow Table Management Scheme in SDNs

Kim

Lee

2016

IJFGCN

View full text Add to dashboard Cite

show abstract

“…In order to reduce the flow-table size and expedite the reading of flow-entries, two possible approaches were proposed in the literature. First, by enhancing the performance of data-plane functions or, second, using flow management with wild-card match-based techniques and flow tagging [6] [7] [2] [5]. In this section we provide a summary of both research approaches.…”

Section: Introductionmentioning

confidence: 99%

“…In [7] the authors proposed a reconfigurable match tables (RMT) which facilitates the implementation of programmable Match-Action processing in hardware. On the second research approach, authors in [5] propose a Tag-in-Tag scheme to reduce the flow table size. In their solution they reduce the flow table size using a method to route multiple flows through deterministic paths and they reduce the energy consumption of TCAM by 35% compared to L2 switches and 80% compared to OpenFlow switches.…”

Section: Introductionmentioning

confidence: 99%

“…Unfortunately, the current hardware switches, which provide line rate packet forwarding, have a limited amount of expensive and power hungry Ternary Content Addressable Memory (TCAM). Thus, TCAM with an average size of 1.5 Mbits, is not capable of accommodating the large amount of flow entries of current data center network [2] [5]. Moreover, the incremental engagement between fine-grained flow control and the number of flow-entries needs to be positively abstracted without losing granularity.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Energy efficient SDN commodity switch based practical flow forwarding method

AlGhadhban

Shihada

2016

NOMS 2016 - 2016 IEEE/IFIP Network Operations and Management Symposium

View full text Add to dashboard Cite

CitationAlGhadhban Abstract-Software Defined Network (SDN) has shown a great potential as a framework for providing fine-grained management of network resources. However, recent SDN practices suffer from over-accumulation of unhealthy flow-load. Instead, we leverage the SDN controller network view to encode the endto-end path information into the packet address. Our solution EncPath significantly reduces the flow-table size and the number of control messages. Consequently, the power consumption of network switches is in orders of magnitude less than other evaluated solutions. It also provides flow management flexibility and scalability. We compare EncPath with single and multipath routing solutions and single path solution. Also, we operated them in proactive and reactive modes. We find that EncPath flow entries in core switches in a multihomed fat-tree with 144 hosts is approximately 1000 times smaller than Equal-Cost MultiPath (ECMP) and random routing. Additionally, the number of control messages to setup the network is reduced by a factor of 200×. This, consequently, affords data-plane and control-plane devices space to process other tasks.

show abstract

Tag-In-Tag: Efficient flow table management in SDN switches

Cited by 48 publications

References 18 publications

A Fast and Accurate Hardware String Matching Module with Bloom Filters

A Fast and Accurate Hardware String Matching Module with Bloom Filters

Proactive-LRU: An Efficient Flow Table Management Scheme in SDNs

Energy efficient SDN commodity switch based practical flow forwarding method

Contact Info

Product

Resources

About