Infinite CacheFlow in software-defined networks

Katta, Naga Praveen Kumar; Alipourfard, Omid; Rexford, Jennifer; Walker, David

doi:10.1145/2620728.2620734

Cited by 153 publications

(119 citation statements)

References 17 publications

Supporting

Mentioning

118

Contrasting

Order By: Relevance

“…Therefore, we define two rules as directly independent if and only iff the predicates of two rules are disjoint or their intersection is entirely shadowed by other rules they both depend on. This is different from the dependency defined in several other works [11,4], which do not consider the shadowing area.…”

Section: Rule Dependencycontrasting

confidence: 83%

“…The forwarding policies generated by the controller modules often have to dynamically react to network events with changes to the forwarding behaviors. Static forwarding policies that are too large to fit in a single flow table may also need dynamic swapping in reaction to the changing traffic patterns [4]. Although SDN allows a centralized approach to modify the forwarding policies installed in distributed switches, it does not avoid the significant latency overhead in altering the states of switches.…”

Section: Introductionmentioning

confidence: 99%

“…Missing rule dependency clue. Although OF rules are associated with sequential priority values, the dependency relationship among rules actually forms a directed acyclic graph (DAG) [4]. Unlike the DAG representation that characterizes the minimum set of dependencies, the sequential representation actually brings in plenty of non-existent dependencies and oftentimes makes avoidable priority updates necessary.…”

Section: Introductionmentioning

confidence: 99%

“…Intuitively, we can restore the dependency DAG directly from the output rules of the compiler with an existing algorithm [4]. However, we find such algorithm entails unacceptable O(n 4 ) worst case computation complexity, where n is the size of the flow table.…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Compiling minimum incremental update for modular SDN languages

Wen

Diao

Zhao

et al. 2014

Proceedings of the Third Workshop on Hot Topics in Software Defined Networking

View full text Add to dashboard Cite

Measurement results show that updating rules on switches poses major latency overhead during the course of the policy update. However, current SDN policy compilers do not handle policy updates well and generate large amount of redundant rule updates, most of which modify only the priority field. Our analysis shows that the lack of knowledge on the rule dependency and the consecutively distributed priority numbers are the fundamental problems behind the redundancy. In this paper, we propose to tackle the problems through 1) an extended policy compiler that builds rule dependency along with the compilation, and 2) an online optimization algorithm that maintains a scattered priority distribution. Our preliminary evaluation demonstrates that our proposed patch can eliminate nearly all the priority updates.

show abstract

Section: Rule Dependencycontrasting

confidence: 83%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Compiling minimum incremental update for modular SDN languages

Wen

Diao

Zhao

et al. 2014

Proceedings of the Third Workshop on Hot Topics in Software Defined Networking

View full text Add to dashboard Cite

show abstract

“…As for flow table overflow defending strategy, Shelly et al [28] and Katta et al [29] introduce flow entry caching mechanism into SDN/Openflow network by inserting a transparent intermediate layer between controller and switch. Yan et al [9] use CAB to generate wildcard flow entries dynamically and reactively to handle bursting network traffic.…”

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

Priority‐based online flow scheduling for network throughput maximization in software defined networking

Liu

Guo

Liu

et al. 2019

Concurrency and Computation

View full text Add to dashboard Cite

Summary Data transmission in current networks is usually associated with strict priority enforcement for the purpose of quality of service (QoS). Under the case that priority flow requests are injected into the network sequentially without the information of future flow request arrivals, it is a challenging to achieve network throughput maximization for on‐line flow requests under the joint constraints of the flow's priority, bandwidth demand, and resource capacity. Software Defined Networking (SDN) can effectively solve the flow scheduling equilibrium problem between the priority of dynamic flow requests and the maximization of network throughput. Therefore, in this paper, we study on‐line flow request admission in SDN, the goal of which is to maximize the network throughput under the constraints of critical network bandwidth resources, flow priority, and bandwidth demands. First, we present the concept of flow routing cost and profit and a model to characterize the cost of using link resources and routing paths. Then, we propose an efficient on‐line priority flow scheduling algorithm (OPFSA) to solve priority flow request scheduling problem and analyze the competitive ratio of OPFSA. Our on‐line algorithm can reach throughput within Ofalse(1normallnormalonormalgnfalse) of the highest possible throughput that can be achieved by an off‐line algorithm, where n is the number of node in the network. Finally, experimental results demonstrate that compared with SHORTEST‐SC, our proposed algorithm can enhance the cumulative bandwidth about 9% and 40% when general network size is 30 and 170 nodes, respectively, and improve the throughput about 25% in Fat‐tree network when pod size is 4.

show abstract

Infinite CacheFlow in software-defined networks

Cited by 153 publications

References 17 publications

Compiling minimum incremental update for modular SDN languages

Compiling minimum incremental update for modular SDN languages

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

Priority‐based online flow scheduling for network throughput maximization in software defined networking

Contact Info

Product

Resources

About