2019
DOI: 10.3390/s19102341
|View full text |Cite
|
Sign up to set email alerts
|

Entry Aggregation and Early Match Using Hidden Markov Model of Flow Table in SDN

Abstract: The usage of multiple flow tables (MFT) has significantly extended the flexibility and applicability of software-defined networking (SDN). However, the size of MFT is usually limited due to the use of expensive ternary content addressable memory (TCAM). Moreover, the pipeline mechanism of MFT causes long flow processing time. In this paper a novel approach called Agg-ExTable is proposed to efficiently manage the MFT. Here the flow entries in MFT are periodically aggregated by applying pruning and the Quine–Mcc… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
14
0

Year Published

2020
2020
2023
2023

Publication Types

Select...
7
1

Relationship

0
8

Authors

Journals

citations
Cited by 16 publications
(14 citation statements)
references
References 29 publications
(44 reference statements)
0
14
0
Order By: Relevance
“…The study also introduced a novel flow management project for MFTs for Open vSwitch in SDN. The memory requirement of the research shows that the Ex table requires a large memory space [11].…”
Section: Analysis and Discussionmentioning
confidence: 99%
“…The study also introduced a novel flow management project for MFTs for Open vSwitch in SDN. The memory requirement of the research shows that the Ex table requires a large memory space [11].…”
Section: Analysis and Discussionmentioning
confidence: 99%
“…At present, most researches on the flow table overflow of OpenFlow switch focus on how to solve the flow table overflow problem caused by large traffic flows in a normal network environment. For example, set an appropriate timeout value of flow entries to reduce the total number of flow entries in the flow table space [25][26][27]; balance the utilization of flow table space by redirecting flows from switches with high flow table space utilization to switches with sufficient free flow table space [28][29][30]; aggregate flow entries [31][32][33]; find out the most suitable flow entry to delete when the flow table space is in its saturation status [34][35][36].…”
Section: Security and Communication Networkmentioning
confidence: 99%
“…Another solution is Agg-ExTable [27], which can be classified under the category of routing scheme-based approaches. Since OpenFlow has evolved to the usage of multiple flow tables (MFT), different solutions take advantage of this development.…”
Section: Routing Scheme Based Optimizationmentioning
confidence: 99%
“…Some works adopts mechanisms related approaches, one of these mechanisms is the use of the Parallelism-based Optimization [23][24][25], in which the performance of the controller is improved through using multi-core systems that uses parallelism multithreading in order to reduce data latency. Another mechanism is the use Routing Scheme-based Optimization [26,27], where the processed event resulted from routing decisions is reduced. These approaches aim at optimizing the routing scheme in terms of their flow tables.…”
Section: Introductionmentioning
confidence: 99%