VNR Algorithm: A Greedy Approach For Virtual Networks Reconfigurations
In this paper, the authors address the problem of virtual network reconfiguration. In their previous work on virtual network embedding strategies, they found that most virtual network rejections were caused by bottlenecked substrate links while peak resource use is equal to 18%. These observations lead them to propose a new greedy Virtual Network Reconfiguration algorithm, VNR. The main aim of their proposal is to 'Tidy Up' substrate network in order to minimize the number of overloaded substrate links, while also reducing the cost of reconfiguration. They compare their proposal with the related reconfiguration strategy VNA-Periodic, both of them are incorporated in the best existing embedding strategies VNE-AC and VNE-Greedy in terms of rejection rate.