Rules Placement Problem in OpenFlow Networks: A Survey

• Published in: IEEE Communications surveys and tutorials Vol. 18; no. 2; pp. 1273 - 1286
• Main Authors: Xuan-Nam Nguyen, Saucez, Damien, Barakat, Chadi, Turletti, Thierry
• Format: Journal Article
• Language: English
• Published: IEEE 01.01.2016
• Subjects: Access control; Control systems; Memory management; OpenFlow; Pattern matching; Peer-to-peer computing; Protocols; rules placement; Software-Defined Networking; survey; Tutorials; Software-defined networking; survey; rules placement; OpenFlow
• ISSN: 1553-877X
• DOI: 10.1109/COMST.2015.2506984

Software-defined networking (SDN) abstracts low-level 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 multifold. 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.