{"title":"SCOR: Constraint Programming-based Northbound Interface for SDN","authors":"S. Layeghy, Farzaneh Pakzad, M. Portmann","doi":"10.1109/ATNAC.2016.7878788","DOIUrl":null,"url":null,"abstract":"In this paper, we introduce SCOR (Software-defined Constrained Optimal Routing), a new SDN Northbound Interface for QoS routing and traffic engineering. SCOR is based on constraint programming techniques and is implemented in the MiniZinc modelling language. It provides a powerful, high level abstraction, consisting of 9 basic constraint programming predicates. A key feature of SCOR is that it is declarative, where only the constraints and utility function of the routing problem need to be expressed, and the complexity of solving the problem is hidden from the user, and handled by a powerful generic solver. We show that the interface (set of predicates) of SCOR is sufficiently expressive to handle all the known and relevant QoS routing problems. We further demonstrate the practicality and scalability of the approach via a number of example scenarios, with varying network topologies, network sizes and number of flows.","PeriodicalId":317649,"journal":{"name":"2016 26th International Telecommunication Networks and Applications Conference (ITNAC)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 26th International Telecommunication Networks and Applications Conference (ITNAC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ATNAC.2016.7878788","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 8
Abstract
In this paper, we introduce SCOR (Software-defined Constrained Optimal Routing), a new SDN Northbound Interface for QoS routing and traffic engineering. SCOR is based on constraint programming techniques and is implemented in the MiniZinc modelling language. It provides a powerful, high level abstraction, consisting of 9 basic constraint programming predicates. A key feature of SCOR is that it is declarative, where only the constraints and utility function of the routing problem need to be expressed, and the complexity of solving the problem is hidden from the user, and handled by a powerful generic solver. We show that the interface (set of predicates) of SCOR is sufficiently expressive to handle all the known and relevant QoS routing problems. We further demonstrate the practicality and scalability of the approach via a number of example scenarios, with varying network topologies, network sizes and number of flows.