Model-driven implementation of services on a software-defined network

Abstract

A method includes receiving, at a model and optimization framework, a request, rendered in a first format, for a service to be implemented on a subset of a software-defined network. The request includes at least one constraint affecting implementation of the service. The method includes producing an optimized solution, rendered in a second format, for implementing the service based on the at least one constraint. The method includes translating the optimized solution to the first format and providing instructions for a cloud manager to implement the service consistent with the translated optimized solution.

What is claimed: 
     
       1. A method comprising:
 receiving, at a model and optimization framework, a request, rendered in a first format, for a service to be implemented on a software-defined network, wherein the request comprises at least one constraint affecting implementation of the service; 
 producing an optimized solution, rendered in a second format, for implementing the service based on the at least one constraint; 
 translating the optimized solution to the first format; and 
 providing instructions for a cloud manager to implement the service consistent with the translated optimized solution. 
 
     
     
       2. The method of  claim 1 , further comprising obtaining an auxiliary mathematical model, wherein the optimized solution is further based on the auxiliary mathematical model. 
     
     
       3. The method of  claim 2 , further comprising selecting the optimization engine from a plurality of engines based on at least one auxiliary mathematical model. 
     
     
       4. The method of  claim 3 , wherein the plurality of engines comprises at least one of a mixed integer programming engine, a constraint programming engine, an evolutionary computation engine, a swarm optimization engine, or a metaheuristics engine. 
     
     
       5. The method of  claim 1 , further comprising:
 designing a mathematical model based on the request, the mathematical model rendered in the second format, 
 wherein producing the optimized solution is based on the mathematical model. 
 
     
     
       6. The method of  claim 1 , further comprising implementing the service based on the translated optimized solution. 
     
     
       7. The method of  claim 1 , wherein the constraint comprises a schedule constraint that restricts timing of implementing the optimized solution on the software-defined network. 
     
     
       8. A system comprising:
 a model and optimization framework communicatively coupled to a software-defined network, the model and optimization framework comprising a policy engine and an optimization engine communicatively coupled to the policy engine; 
 a processor communicatively coupled to the model and optimization framework; and 
 memory storing instructions that cause the processor to effectuate operations, the operations comprising: 
 receiving a request, rendered in a first format, for a service to be implemented on a subset of the software-defined network, wherein the request comprises at least one constraint affecting implementation of the service; 
 producing an optimized solution using the optimization engine, the optimized solution for implementing the service based on the at least one constraint, the optimized solution rendered in a second format; 
 translating the optimized solution to the first format; and 
 providing instructions for a cloud manager to implement the service consistent with the translated optimized solution. 
 
     
     
       9. The system of  claim 8 , wherein the first format is based on a business model language and translating the optimized solution into the first format comprises translating the optimized solution into the business model language. 
     
     
       10. The system of  claim 8 , the operations further comprising producing a translation key based on the request, wherein translating the optimized solution is further based on the translation key. 
     
     
       11. The system of  claim 8 , the operations further comprising facilitating implementation of the service based on the translated optimized solution. 
     
     
       12. The system of  claim 8 , the operations further comprising obtaining an auxiliary mathematical model, wherein the optimized solution is further based on the auxiliary mathematical model. 
     
     
       13. The system of  claim 12 , the operations further comprising selecting the optimization engine from a plurality of engines based on the auxiliary mathematical model. 
     
     
       14. The system of  claim 13 , wherein the plurality of engines comprises at least one of a mixed integer programming engine, a constraint programming engine, an evolutionary computation engine, a swarm optimization engine, or a metaheuristics engine. 
     
     
       15. A non-transitory computer-readable storage medium storing instructions that cause a processor executing the instructions to effectuate operations, the operations comprising:
 receiving, at a model and optimization framework, a request, rendered in a first format, for a service to be implemented on a subset of a software-defined network, wherein the request comprises at least one constraint affecting implementation of the service; 
 producing an optimized solution, rendered in a second format, for implementing the service based on the at least one constraint; 
 translating the optimized solution to the first format; and 
 providing instructions for a cloud manager to implement the service consistent with the translated optimized solution. 
 
     
     
       16. The non-transitory computer-readable storage medium of  claim 15 , wherein the first format is in a business language and translating the optimized solution comprises translating the optimized solution into the business language. 
     
     
       17. The non-transitory computer-readable storage medium of  claim 15 , wherein the constraint is a schedule-related constraint. 
     
     
       18. The non-transitory computer-readable storage medium of  claim 15 , the operations further comprising:
 obtaining an auxiliary mathematical model; and 
 selecting the optimization engine from a plurality of engines based on the auxiliary mathematical model. 
 
     
     
       19. The non-transitory computer-readable storage medium of  claim 18 , wherein the plurality of engines comprises at least one of a mixed integer programming engine, a constraint programming engine, an evolutionary computation engine, a swarm optimization engine, or a metaheuristics engine. 
     
     
       20. The non-transitory computer-readable storage medium of  claim 15 , wherein the at least one constraint comprises a first constraint and a second constraint and wherein producing the optimized solution comprises prioritizing the constraint over a second constraint if no solution exists that satisfies both the constraint and the second constraint.