Virtual network embedding under uncertainty: Exact and heuristic approaches

Coniglio, Stefano; Koster, Arie M. C. A.; Tieves, Martin

doi:10.1109/drcn.2015.7148978

Cited by 12 publications

(13 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Many papers have addressed the problem of slice/SFC resource allocation with uncertain or time-varying requirements and available physical resources, see, e.g., [9,10,[25][26][27][28]. Conservative strategies allocating resources considering worstcase peak traffic conditions [9,10] are costly and usually lead to an inefficient utilization of resources.…”

Section: Related Workmentioning

confidence: 99%

Admission Control and Resource Reservation for Prioritized Slice Requests With Guaranteed SLA Under Uncertainties

Luu

Kerboeuf

Kieffer

2022

IEEE Trans. Netw. Serv. Manage.

View full text Add to dashboard Cite

Network slicing has emerged as a key concept in 5G systems, allowing Mobile Network Operators (MNOs) to build isolated logical networks (slices) on top of shared infrastructure networks managed by Infrastructure Providers (InP). Network slicing requires the assignment of infrastructure network resources to virtual network components at slice activation time and the adjustment of resources for slices under operation. Performing these operations just-in-time, on a besteffort basis, comes with no guarantee on the availability of enough infrastructure resources to meet slice requirements.This paper proposes a prioritized admission control mechanism for concurrent slices based on an infrastructure resource reservation approach. The reservation accounts for the dynamic nature of slice requests while being robust to uncertainties in slice resource demands. Adopting the perspective of an InP, reservation schemes are proposed that maximize the number of slices for which infrastructure resources can be granted while minimizing the costs charged to the MNOs. This requires the solution of a max-min optimization problem with a nonlinear cost function and non-linear constraints induced by the robustness to uncertainties of demands and the limitation of the impact of reservation on background services. The cost and the constraints are linearized and several reduced-complexity strategies are proposed to solve the slice admission control and resource reservation problem. Simulations show that the proportion of admitted slices of different priority levels can be adjusted by a differentiated selection of the delay between the reception and the processing instants of a slice resource request.

show abstract

Section: Related Workmentioning

confidence: 99%

Admission Control and Resource Reservation for Prioritized Slice Requests With Guaranteed SLA Under Uncertainties

Luu

Kerboeuf

Kieffer

2022

IEEE Trans. Netw. Serv. Manage.

View full text Add to dashboard Cite

show abstract

“…An original robust cutting-plane algorithm is proposed in [29] to address the uncertain nature of the jamming problem in wireless networks. A robust optimization approach for the VNE problem is investigated in [30], which is based on a robust MILP formulation using the Γ−robustness model. They also propose a MILPbased two-phase heuristic but do not consider latency constraints or compute demands of the VNFs.…”

Section: Related Workmentioning

confidence: 99%

“…That path is given by the sum of the delays on each link composing the considered path (29). For each service chain c we need to ensure that the sum of the delays suffered by each demand, belonging to c, on each used possible path is not greater than the maximum tolerable one, lat c (30). Finally, the constraints (31) and (32) assure that a switch is active if and only if at least one of its ports is active, otherwise it is considered as idle.…”

Section: Latency Constrained Flow Routingmentioning

confidence: 99%

A fast robust optimization-based heuristic for the deployment of green virtual network functions

Marotta

Zola

D’Andreagiovanni

et al. 2017

Journal of Network and Computer Applications

View full text Add to dashboard Cite

Network Function Virtualization (NFV) has attracted a lot of attention in the telecommunication field because it allows to virtualize core-business network functions on top of a NFV Infrastructure. Typically, Virtual Network Functions (VNFs) can be represented as chains of Virtual Machines (VMs) or containers that exchange network traffic which are deployed inside datacenters on commodity hardware. In order to achieve cost efficiency, network operators aim at minimizing the power consumption of their NFV infrastructure. This

show abstract

“…Nevertheless, this infrastructure resource overbooking is costly and most of the time unnecessary, as all individual slice resource demands are very unlikely peaking simultaneously. In [12], the virtual network embedding problem is solved considering uncertain traffic demands. An MILP formulation is considered, where some of the constraints are required to be satisfied with high probability.…”

Section: Introductionmentioning

confidence: 99%

Uncertainty-Aware Resource Provisioning for Network Slicing

Luu

Kerboeuf

Kieffer

2021

IEEE Trans. Netw. Serv. Manage.

View full text Add to dashboard Cite

Network slicing allows Mobile Network Operators to split the physical infrastructure into isolated virtual networks (slices), managed by Service Providers to accommodate customized services. The Service Function Chains (SFCs) belonging to a slice are usually deployed on a best-effort premise: nothing guarantees that network infrastructure resources will be sufficient to support a varying number of users, each with uncertain requirements.Taking the perspective of a network Infrastructure Provider (InP), this paper proposes a resource provisioning approach for slices, robust to a partly unknown number of users with random usage of the slice resources. The provisioning scheme aims to maximize the total earnings of the InP, while providing a probabilistic guarantee that the amount of provisioned network resources will meet the slice requirements. Moreover, the proposed provisioning approach is performed so as to limit its impact on low-priority background services, which may co-exist with slices in the infrastructure network.A Mixed Integer Linear Programming formulation of the slice resource provisioning problem is proposed. Optimal joint and suboptimal sequential solutions are proposed. These solutions are compared to a provisioning scheme that does not account for best-effort services sharing the common infrastructure network.

show abstract

Virtual network embedding under uncertainty: Exact and heuristic approaches

Cited by 12 publications

References 9 publications

Admission Control and Resource Reservation for Prioritized Slice Requests With Guaranteed SLA Under Uncertainties

Admission Control and Resource Reservation for Prioritized Slice Requests With Guaranteed SLA Under Uncertainties

A fast robust optimization-based heuristic for the deployment of green virtual network functions

Uncertainty-Aware Resource Provisioning for Network Slicing

Contact Info

Product

Resources

About