VNR Algorithm: A Greedy Approach For Virtual Networks Reconfigurations

Ilhem Fajjari (1, 2) , Nadjib Aitsaadi (3) , Guy Pujolle (1) , Hubert Zimmermann (2)

1 Phare
2 Ginkgo networks
3 HIPERCOM - High performance communication

In this paper we address the problem of virtual network reconfiguration. In our previous work on virtual network embedding strategies, we found that most virtual network rejections were caused by bottlenecked substrate links while peak resource use is equal to 18%. These observations lead us to propose a new greedy Virtual Network Reconfiguration algorithm, VNR. The main aim of our proposal is to 'tidy up' substrate network in order to minimise the number of overloaded substrate links, while also reducing the cost of reconfiguration. We compare our 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. The results obtained show that VNR outperforms VNA-Periodic. Indeed, our research shows that the performances of VNR do not depend on the virtual network embedding strategy. Moreover, VNR minimises the rejection rate of virtual network requests by at least ' 83% while the cost of reconfiguration is lower than with VNA-Periodic.

Mots clés: Network virtualization; Embedding problem; Reconfiguration

Domaines: Réseaux et télécommunications [cs.NI]

Ilhem Fajjari, Nadjib Aitsaadi, Guy Pujolle, Hubert Zimmermann. VNR Algorithm: A Greedy Approach For Virtual Networks Reconfigurations. Globecom 2011 - IEEE Global Communications Conference, Exhibition and Industry Forum, Dec 2011, Houston, United States. pp.1-6, ⟨10.1109/GLOCOM.2011.6134006⟩. ⟨hal-00615271⟩