SCOR: Constraint Programming-based Northbound Interface for SDN

Layeghy, Siamak; Pakzad, Farzaneh; Portmann, Marius

doi:10.1109/atnac.2016.7878788

Cited by 8 publications

(15 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Through the use of powerful generic constraint programming solvers, solutions to complex routing problems can be found faster than through traditional procedural programming solutions, in some cases by orders of magnitude, as shown [86].…”

Section: Software-defined Constrained Optimal Routing (Scor)mentioning

confidence: 99%

“…However, the implementation does not rely on any POX specific feature, and can easily be adapted to other SDN controller platforms [86].…”

Section: Scor Framework Implementation In Pox Sdn Controllermentioning

confidence: 99%

“…Below, we discuss the subset of SCOR predicates that we have used in our work on WMN routing. A more complete discussion of SCOR and its predicates is available in [86].…”

Section: Scor Predicatesmentioning

confidence: 99%

“…Traffic Engineering (TE) [86]. SCOR is based on Constraint Programming (CP) techniques and is implemented in the MiniZinc modelling language [103] to provide Software-defined Constrained Optimal Routing (SCOR).…”

Section: Software-defined Constrained Optimal Routing (Scor)mentioning

confidence: 99%

“…For our use case, we consider delay as the path metric, which allows us to implement minimum delay routing, as discussed below. By assigning the link delay as the link cost in the path cost predicate, the least cost path routing model shown in Model 1, defines the minimum delay routing problem [86].…”

Section: Sdn-based Wmn Routing Use Case 1: Least Cost Path Routingmentioning

confidence: 99%

See 4 more Smart Citations

Towards Software Defined Wireless Mesh Networks

Pakzad¹

Self Cite

View full text Add to dashboard Cite

Software Defined Networking (SDN) is a new approach to configure and manage computer networks, based on its core idea of separating the data plane from the control plane. Through this, SDN provides a higher level of abstraction and allows better and simpler programmability and management of networks, thereby enabling faster innovation. The benefits of SDN have clearly been demonstrated for wired networks, in particular for wide area and data centre networks. The goal of this research was to explore how the concepts of SDN can be applied to wireless networks, in particular Wireless Mesh Networks (WMNs). The focus of our research was on exploring the feasibility of SDN-based routing and load balancing of traffic in WMNs. For this, we leveraged key SDN features such as centralised view of the network state, fine grained and flow-based traffic forwarding, and abstraction. Working towards this goal, we have addressed a number of key research challenges. Firstly, we have designed and implemented a new topology discovery mechanism with greatly reduced overhead compared to the state-of-the-art approach. Topology discovery is an essential service in any Software Defined Network, but an efficient mechanism with low overhead is particularly important for typically resource constrained WMNs. Another critical component for SDN-based routing in WMNs is link monitoring, in particular link capacity monitoring. In contrast to wired networks, where the link capacity is typically known and constant, it can be highly dynamic in wireless networks. We have designed, implemented and evaluated a new, SDN-based link capacity estimation approach, based on the concept of packet pair/train probing. Building on our topology discovery and link capacity estimation methods, we have developed a new SDN-based routing framework for WMNs. For this, we have leveraged a new northbound interface called SCOR (Software-defined Constrained Optimal Routing) for QoS routing and Traffic Engineering (TE). Using the abstraction provided by a small number of high level SCOR routing primitives, we have demonstrated the feasibility, simplicity and efficiency of this approach to implement relatively complex routing problems in WMNs. Finally, we have also provided critical evaluations of new potential testbeds for the evaluation of SDN-based WMNs. We believe this is an important contribution in its own right, since experimental validation is a key research methodology in this context, and trust in the validity of experimental results is absolutely critical.

show abstract

Section: Software-defined Constrained Optimal Routing (Scor)mentioning

confidence: 99%

“…However, the implementation does not rely on any POX specific feature, and can easily be adapted to other SDN controller platforms [86].…”

Section: Scor Framework Implementation In Pox Sdn Controllermentioning

confidence: 99%

“…Below, we discuss the subset of SCOR predicates that we have used in our work on WMN routing. A more complete discussion of SCOR and its predicates is available in [86].…”

Section: Scor Predicatesmentioning

confidence: 99%

Section: Software-defined Constrained Optimal Routing (Scor)mentioning

confidence: 99%

Section: Sdn-based Wmn Routing Use Case 1: Least Cost Path Routingmentioning

confidence: 99%

See 3 more Smart Citations

Towards Software Defined Wireless Mesh Networks

Pakzad¹

Self Cite

View full text Add to dashboard Cite

show abstract

Constraint Games for stable and optimal allocation of demands in SDN

2019

View full text Add to dashboard Cite

Software Defined Networking (or SDN) allows to apply a centralized control over a network of commuters in order to provide better global performances. One of the problem to solve is the multicommodity flow routing where a set of demands have to be routed at minimum cost. In contrast with other versions of this problem, we consider here problems with congestion that change the cost of a link according to the capacity used. We propose here to study centralized routing with Constraint Programming and Column Generation approaches. Furthermore, selfish routing is studied through with Constraint Games. Selfish routing is important for the perceived quality of the solution since no user is able to improve his cost by changing only his own path. We present real and synthetic benchmarks that show a good scalability.

show abstract