Skip to Main content Skip to Navigation

Contribution to an efficient and resilient embedding of virtual networks under various constraints

Abstract : Network virtualization allows to create logical or virtual networks on top of a shared physical or substrate network. The resource allocation problem is an important issue in network virtualization. It corresponds to a well known problem called virtual network embedding (VNE). VNE consists in mapping each virtual node to one substrate node and each virtual link to one or several substrate paths in a way that the objective is optimized and the constraints verified. The objective often corresponds to the optimization of the node computational resources and link bandwidth whereas the constraints generally include geographic location of nodes, CPU, bandwidth, etc. In the multi-domain context where the knowledge of routing information is incomplete, the optimization of node and link resources are difficult and often impossible to achieve. Moreover, to ensure service continuity even upon failure, VNE should cope with failures by selecting the best and resilient mappings. Inthisthesis,westudytheVNEresourceallocationproblemunderdifferentrequirements. To embed a virtual network on multi-domain substrate network, we propose a joint peering and intra domain link mapping method. With reduced and limited information disclosed by the domains, our downsizing algorithm maps the intra domain and peering links in the same stage so that the resource utilization is optimized. To enhance the reliability of virtual networks, we propose a failure avoidance approach that minimizes the failure probability of virtual networks. Exact and heuristic solutions are proposed and detailed for the infinite and limited bandwidth link models. Moreover, we combine the failure avoidance with the failure protection in our novel protection-level-aware survivable VNE in order to improve the reliability. With this last approach, the protectable then the less vulnerable links are first selected for link mapping. To determine the protectable links, we propose a maxflow based heuristic that checks for the existence of backup paths during the primary mapping stage. In case of insufficient backup resources, the failure probability is reduced.
Complete list of metadatas

Cited literature [63 references]  Display  Hide  Download
Contributor : Abes Star :  Contact
Submitted on : Tuesday, October 8, 2019 - 3:52:13 PM
Last modification on : Saturday, February 15, 2020 - 2:05:11 AM


Version validated by the jury (STAR)


  • HAL Id : tel-02308571, version 1



Shuopeng Li. Contribution to an efficient and resilient embedding of virtual networks under various constraints. Networking and Internet Architecture [cs.NI]. Université Sorbonne Paris Cité, 2017. English. ⟨NNT : 2017USPCD066⟩. ⟨tel-02308571⟩



Record views


Files downloads