A flow entry management scheme for reducing controller overhead

Kim, Eundo; Lee, Seung-Ik; Choi, Yun-Chul; Shin, Myung-Ki; Kim, Hyoung-Jun

doi:10.1109/icact.2014.6779063

Cited by 31 publications

(15 citation statements)

References 2 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In addition to that, flow counters are also reduced by 75% on average. A flow entry management scheme for reducing controller overhead [30] proposes a cache algorithm strategy "Least Recently Used (LRU)" for flow rules stored at the data plane to minimize the communication overhead between controller and data plane. By using this strategy, a switch can keep the recently used flow entries in the table to avoid the cache-miss problem.…”

Section: Related Workmentioning

confidence: 99%

Graph-Based Policy Change Detection and Implementation in SDN

2019

View full text Add to dashboard Cite

Software Defined Networking (SDN), as a cutting-edge network, splits control and management planes from the data plane for simplifying network manageability as well as programmability. In SDN, network policies change with the passage of time due to changes in the application environment, topology or user/admin requirements. As a result, modifications at the control plane take place. In existing research works, packet violations occur due to already installed flow rules at the data plane (switches) that are not modified in case of a change of the Access Control List (ACL) policies at the SDN controller. There has been no research carried out that identifies packet violations and network inefficiencies in case of policy change. Our novel approach stores generated flow rules at the SDN controller and detects policy change, along with conflicting flow rules, to resolve the identified problem of policy change. Afterwards, the conflicting flow rules are removed from switches and new flow rules are installed along the new path according to new ACL policies. It helps to minimize packet violations, which increases network efficiency. In this research work, we deal with the inefficiencies of policy change detection with respect to access time, cost and space. In this regard, we used abstractions to formalize and detect network policies with the help of multi-attributed graphs. We utilized intent-based policies for the representation and implementation of our proposed approach. In addition, we used extended performance metrics for the analysis of our proposed approach. The simulation results show that our proposed approach performs better as compared to the existing approach, by varying the number of policy change and packet transmission rate. The results clearly indicate that our proposed approach helps to increase network performance and efficiency.

show abstract

Section: Related Workmentioning

confidence: 99%

Graph-Based Policy Change Detection and Implementation in SDN

2019

View full text Add to dashboard Cite

show abstract

“…If the flag OFPFF SEND FLOW REM is set when the rule is installed, on rule removal, the switch returns a message containing the removal reason (e.g., timeout) and the statistics (e.g., flow duration, number of packets) at the removal time to the controller [13]. From OpenFlow 1.4, the controller can get early warning about the current flow table occupation and react in advance to avoid flow table full [35]. The desired warning threshold is defined by the controller.…”

Section: A Evictionmentioning

confidence: 99%

“…Among replacement algorithms, LRU outperforms others and improves flow table hit ratio, by keeping recently used rules in flow table, according to studies [37], [35]. However, the abundance of mice flow in data center traffic can cause elephant flows' rules to be evicted from the flow table [38].…”

Section: A Evictionmentioning

confidence: 99%

Rules Placement Problem in OpenFlow Networks: A Survey

Nguyen

Saucez

Barakat

et al. 2016

IEEE Commun. Surv. Tutorials

121

View full text Add to dashboard Cite

Software-Defined Networking (SDN) abstracts lowlevel network functionalities to simplify network management and reduce costs. The OpenFlow protocol implements the SDN concept by abstracting network communications as flows to be processed by network elements. In OpenFlow, the high-level policies are translated into network primitives called rules that are distributed over the network. While the abstraction offered by OpenFlow allows to potentially implement any policy, it raises the new question of how to define the rules and where to place them in the network while respecting all technical and administrative requirements. In this paper, we propose a comprehensive study of the so-called OpenFlow rules placement problem with a survey of the various proposals intending to solve it. Our study is multi-fold. First, we define the problem and its challenges. Second, we overview the large number of solutions proposed, with a clear distinction between solutions focusing on memory management and those proposing to reduce signaling traffic to ensure scalability. Finally, we discuss potential research directions around the OpenFlow rules placement problem.

show abstract

“…This algorithm uses flow entry tags instead of matching fields as forwarding rules. Kim et al [31] develop a new flow entry management scheme to reduce the controller overhead.…”

Section: Related Workmentioning

confidence: 99%

Exploiting the Vulnerability of Flow Table Overflow in Software-Defined Network: Attack Model, Evaluation, and Defense

Zhou

Chen

Zhang

et al. 2018

Security and Communication Networks

View full text Add to dashboard Cite

As the most competitive solution for next-generation network, SDN and its dominant implementation OpenFlow are attracting more and more interests. But besides convenience and flexibility, SDN/OpenFlow also introduces new kinds of limitations and security issues. Of these limitations, the most obvious and maybe the most neglected one is the flow table capacity of SDN/OpenFlow switches. In this paper, we proposed a novel inference attack targeting at SDN/OpenFlow network, which is motivated by the limited flow table capacities of SDN/OpenFlow switches and the following measurable network performance decrease resulting from frequent interactions between data and control plane when the flow table is full. To the best of our knowledge, this is the first proposed inference attack model of this kind for SDN/OpenFlow. We implemented an inference attack framework according to our model and examined its efficiency and accuracy. The evaluation results demonstrate that our framework can infer the network parameters (flow table capacity and usage) with an accuracy of 80% or higher. We also proposed two possible defense strategies for the discovered vulnerability, including routing aggregation algorithm and multilevel flow table architecture. These findings give us a deeper understanding of SDN/OpenFlow limitations and serve as guidelines to future improvements of SDN/OpenFlow.

show abstract

A flow entry management scheme for reducing controller overhead

Cited by 31 publications

References 2 publications

Graph-Based Policy Change Detection and Implementation in SDN

Graph-Based Policy Change Detection and Implementation in SDN

Rules Placement Problem in OpenFlow Networks: A Survey

Exploiting the Vulnerability of Flow Table Overflow in Software-Defined Network: Attack Model, Evaluation, and Defense

Contact Info

Product

Resources

About