Solving virtual network resource allocation problems using a constraint satisfaction problem model

摘要

We define virtualization as a set of techniques to run multiple operating systems on the same physical machine (physical node) sharing its resources. These technologies have a huge success because they improve safety, reliability and flexibility. Several studies in the field have been made by different teams, but the allocation of physical resources remains an open problem in the field of network virtualization. We identified this problem as a graph matching problem. We express and solve it like a Constraint Satisfaction Problem (CSP). Our CSP model includes Qos requirements and energy saving. To our knowledge, no previous work used CSP approach and combined Qos and Green aspects to allocate resources.