Optimal mapping of virtual networks considering reactive reconfiguration

Publikationstyp
Conference Paper
Date Issued
2012-12-01
Sprache
English
Author(s)
Tran, Phuong Nga  
Casucci, Leonardo  
Timm-Giel, Andreas  orcid-logo
Institut
Kommunikationsnetze E-4  
TORE-URI
http://hdl.handle.net/11420/11668
Start Page
35
End Page
40
Article Number
6483651
Citation
1st IEEE International Conference on Cloud Networking, CLOUDNET 2012 - Proceedings: 6483651, 35-40 (2012-12-01)
Contribution to Conference
1st IEEE International Conference on Cloud Networking, CLOUDNET 2012  
Publisher DOI
10.1109/CloudNet.2012.6483651
Scopus ID
2-s2.0-84876104627
Publisher
IEEE
Network Virtualization (NV) has recently been considered as a key feature of the Future Internet because it allows easy transition from existing IPv4 based Internet to new mechanisms and protocols, and a more efficient usage of infrastructure by sharing it with different virtual network operators while deploying new services. However, Network Virtualization also raises new challenges for network operators [1]. One of the main challenges is the efficient resource allocation, known as virtual network mapping problem, in which virtual nodes and links are embedded to specific substrate nodes and paths. In this paper, we study this problem for the online scenario, where virtual network requests come and leave dynamically while considering the ability to reconfigure (re-arrange) the currently mapped virtual networks. All the recent research on this topic just focuses on the acceptance ratio of the virtual networks but do not address the possible service disruption during the reconfiguration. This paper proposes a so-called reactive reconfiguration mechanism, which reacts to any rejection of new coming virtual network requests. If a virtual network is rejected due to the lack of physical resources, the mechanism is triggered to reconfigure the currently-mapped networks so that the new request can be embedded. At the same time, it minimizes the number of necessary changes to reduce the service disruption. The mechanism is mathematically formulated as Integer Linear Programming (ILP) problem and solved by CPLEX [2]. Its performance is then evaluated through extensive simulations and compared with the case of no reconfiguration. A heuristic is then proposed to speed up the solving time of the ILP problem while maintaining its performance. © 2012 IEEE.
Subjects
ILP
network reconfiguration
Network Virtualization
virtual network mapping
DDC Class
004: Informatik