Too Many SDN Rules? Compress Them with MINNIE

Rifai, Myriana; Huin, Nicolas; Caillouet, Christelle; Giroire, Frédéric; Lopez-Pacheco, Dino; Mouliérac, Joanna; Urvoy-Keller, Guillaume

doi:10.1109/glocom.2015.7417661

Cited by 49 publications

(22 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…TCAM-based energy-aware SDN issues received significant attention as shown in [31]. Some of the works address the problem of rule placement without considering energy savings, see [32], [33] and [34]. In other works, such as [30] and [35], Our main contribution in this work is to model SDNbased, energy-aware routing in carrier Ethernet networks while respecting the memory limitations in an Openflow switch, which is also known as rule of space capacity.…”

Section: Optimizing Rule Space In Openflow Forwarding Nodementioning

confidence: 99%

Energy-Aware Routing in Carrier-Grade Ethernet Using SDN Approach

Mâaloul

Taktak

Fourati

et al. 2018

IEEE Trans. on Green Commun. Netw.

View full text Add to dashboard Cite

Soft-Defined Networking (SDN) is a new approach that enables operators to easily manage all the network elements.In this paper, we address the problem of energy-aware routing in SDN-based carrier-grade Ethernet networks. Our approach is based on turning off network nodes and links to reduce energy consumption, while respecting the rule space capacity for each Openflow switch, and maintaining an allowable maximum link utilization. The problem of identifying the optimal set of network elements to be turned off is NP-hard. We first present an exact model based on an Integer Linear Programming formulation for the problem. Then, we describe a set of firstfit heuristic algorithms suitable for large-sized networks. The exact and heuristic approaches are tested on SNDlib-based instances. Experimentations show the efficiency of both exact and heuristic methods for different network topologies. In particular, our heuristic algorithms are able to achieve a good balance between energy consumption, resource utilization, and network performance.

show abstract

Section: Optimizing Rule Space In Openflow Forwarding Nodementioning

confidence: 99%

Energy-Aware Routing in Carrier-Grade Ethernet Using SDN Approach

Mâaloul

Taktak

Fourati

et al. 2018

IEEE Trans. on Green Commun. Netw.

View full text Add to dashboard Cite

show abstract

“…To compress and to resolve conflicts, the Expresso heuristic [50] borrowed from logical minimization can be applied to obtain an equivalent but smaller sets, which is then transformed to corresponding rules. Forwarding rules can also be compressed based on source or destination IP address [51].…”

Section: B Compressionmentioning

confidence: 99%

Rules Placement Problem in OpenFlow Networks: A Survey

Nguyen

Saucez

Barakat

et al. 2016

IEEE Commun. Surv. Tutorials

123

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

“…We also provide a second heuristic, Global Heuristic, which is a 3-approximation for List Reduction. Note that this heuristic has been tested for data center scenarios in [20]. Similarly, we believe however that the approximation of 3 is not best possible for List Reduction.…”

Section: Problem 5 What Is the Best Approximation Ratio For Without-gmentioning

confidence: 99%

On the Complexity of Compressing Two Dimensional Routing Tables with Order

2016

View full text Add to dashboard Cite

Motivated by routing in telecommunication network using Software Defined Network (SDN) technologies, we consider the following problem of finding short routing lists using aggregation rules. We are given a set of communications X , which are distinct pairs (s, t) ⊆ S × T , (typically S is the set of sources and T the set of destinations), and a port function π : X → P where P is the set of ports. A routing list R is an ordered list of triples which are of the form (s, t, p), (* , t, p), (s, * , p) or (* , * , p) with s ∈ S, t ∈ T and p ∈ P. It routes the communication (s, t) to the port r(s, t) = p which appears on the first triple in the list R that is of the form (s, t, p), (* , t, p), (s, * , p) or (* , * , p). If r(s, t) = π(s, t), then we say that (s, t) is properly routed by R and if all communications of X are properly routed, we say that R emulates (X , π). The aim is to find a shortest routing list emulating (X , π). In this paper, we carry out a study of the complexity of the two dual decision problems associated to it. Given a set of communication X , a port function π and an integer k, the

show abstract

Too Many SDN Rules? Compress Them with MINNIE

Cited by 49 publications

References 15 publications

Energy-Aware Routing in Carrier-Grade Ethernet Using SDN Approach

Energy-Aware Routing in Carrier-Grade Ethernet Using SDN Approach

Rules Placement Problem in OpenFlow Networks: A Survey

On the Complexity of Compressing Two Dimensional Routing Tables with Order

Contact Info

Product

Resources

About