Ensuring Reliability and Low Cost When Using a Parallel VNF Processing Approach to Embed Delay-Constrained Slices

Promwongsa, Nattakorn; Abu-Lebdeh, Mohammad; Kianpisheh, Somayeh; Belqasmi, Fatna; Glitho, Roch; Elbiaze, Halima; Crespi, Noël; Alfandi, Omar

doi:10.1109/tnsm.2020.3029108

Cited by 27 publications

(25 citation statements)

References 38 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We remark that when |K| ≥ 4, Gurobi failed to solve (MINLP) within 1800 seconds in most cases. This clearly demonstrates the advantage of our new way of formulating the flow conservation constraints ( 13)-( 18) for the data rates over those in [6,7] and the proposed valid inequalities ( 19)-( 20), i.e., it can effectively make the network slicing problem much more computationally solvable. Next, we shall only use and discuss formulation (MILP).…”

Section: • Comparison Of Proposed Formulations (Milp) and (Minlp)mentioning

confidence: 76%

“…Next, we follow [6,7] to present the flow conservation constraints for the data rates. To proceed, we need variable r(k, s, p) ∈ [0, 1] denoting the fraction of data rate λ k s on the p-th path of flow (k, s) and variable rij(k, s, p) ∈ [0, 1] denoting the fraction of data rate λ k s on link (i, j) (when zij(k, s, p) = 1).…”

Section: • Traffic Routingmentioning

confidence: 99%

“…Recall that in the previous section, we use ( 6) and nonlinear constraint (7) to ensure the flow conservation for the data rates of the pth path of flow (k, s). However, the intrinsic nonlinearity in it leads to an inefficient solution of formulation (MINLP).…”

Section: •New Linear Flow Conservation Constraints For Traffic Routingmentioning

confidence: 99%

“…However, the intrinsic nonlinearity in it leads to an inefficient solution of formulation (MINLP). To overcome this difficulty, we reformulate ( 6)- (7) as…”

Section: •New Linear Flow Conservation Constraints For Traffic Routingmentioning

confidence: 99%

“…The fish network topology in [2], which contains 112 nodes and 440 links, including 6 cloud nodes, is employed in evaluating the performance in our experiments. We randomly set the cloud nodes' and links' capacities to [50, 100] and [7,77], respectively. The NFV and communication delays on the cloud nodes and links are randomly selected as {3, 4, 5, 6} and {1, 2}, respectively; and the reliabilities of cloud nodes and links are randomly chosen in [0.991, 0.995] and [0.995, 0.999], respectively.…”

Section: Numerical Simulationmentioning

confidence: 99%

See 4 more Smart Citations

Optimal QoS-Aware Network Slicing for Service-Oriented Networks with Flexible Routing

Chen¹,

Liu²,

Dai³

et al. 2021

Preprint

View full text Add to dashboard Cite

In this paper, we consider the network slicing problem which attempts to map multiple customized virtual network requests (also called services) to a common shared network infrastructure and allocate network resources to meet diverse quality of service (QoS) requirements. We first propose a mixed integer nonlinear program (MINLP) formulation for this problem that optimizes the network resource consumption while jointly considers QoS requirements, flow routing, and resource budget constraints. In particular, the proposed formulation is able to flexibly route the traffic flow of the services on multiple paths and provide end-to-end (E2E) delay and reliability guarantees for all services. Due to the intrinsic nonlinearity, the MINLP formulation is computationally difficult to solve. To overcome this difficulty, we then propose a mixed integer linear program (MILP) formulation and show that the two formulations and their continuous relaxations are equivalent. Different from the continuous relaxation of the MINLP formulation which is a nonconvex nonlinear programming problem, the continuous relaxation of the MILP formulation is a polynomial time solvable linear programming problem, which makes the MILP formulation much more computationally solvable. Numerical results demonstrate the effectiveness and efficiency of the proposed formulations over existing ones.

show abstract

Section: • Comparison Of Proposed Formulations (Milp) and (Minlp)mentioning

confidence: 76%

Section: • Traffic Routingmentioning

confidence: 99%

Section: •New Linear Flow Conservation Constraints For Traffic Routingmentioning

confidence: 99%

“…However, the intrinsic nonlinearity in it leads to an inefficient solution of formulation (MINLP). To overcome this difficulty, we reformulate ( 6)- (7) as…”

Section: •New Linear Flow Conservation Constraints For Traffic Routingmentioning

confidence: 99%

Section: Numerical Simulationmentioning

confidence: 99%

See 3 more Smart Citations

Optimal QoS-Aware Network Slicing for Service-Oriented Networks with Flexible Routing

Chen¹,

Liu²,

Dai³

et al. 2021

Preprint

View full text Add to dashboard Cite

show abstract

Optimizing Placement and Scheduling for VNF by a Multi-objective Optimization Genetic Algorithm

Thien,

Wu,

Bekhit

et al. 2024

Int J Comput Intell Syst

View full text Add to dashboard Cite

Virtual network functions (VNFs) have gradually replaced the implementation of traditional network functions. Through efficient placement, the VNF placement technology strives to operate VNFs consistently to the greatest extent possible within restricted resources. Thus, VNF mapping and scheduling tasks can be framed as an optimization problem. Existing research efforts focus only on optimizing the VNFs scheduling or mapping. Besides, the existing methods focus only on one or two objectives. In this work, we proposed addressing the problem of VNFs scheduling and mapping. This work proposed framing the problem of VNFs scheduling and mapping as a multi-objective optimization problem on three objectives, namely (1) minimizing line latency of network link, (2) reducing the processing capacity of each virtual machine, and (3) reducing the processing latency of virtual machines. Then, the proposed VNF-NSGA-III algorithm, an adapted variation of the NSGA-III algorithm, was used to solve this multi-objective problem. Our proposed algorithm has been thoroughly evaluated through a series of experiments on homogeneous and heterogeneous data center environments. The proposed method was compared to several heuristic and recent meta-heuristic methods. The results reveal that the VNF-NSGA-III outperformed the comparison methods.

show abstract

Hop-by-hop bandwidth allocation and deployment for SFC with end-to-end delay QoS guarantees

Sun

Chi

et al. 2022

Computer Communications

View full text Add to dashboard Cite

Ensuring Reliability and Low Cost When Using a Parallel VNF Processing Approach to Embed Delay-Constrained Slices

Cited by 27 publications

References 38 publications

Optimal QoS-Aware Network Slicing for Service-Oriented Networks with Flexible Routing

Optimal QoS-Aware Network Slicing for Service-Oriented Networks with Flexible Routing

Optimizing Placement and Scheduling for VNF by a Multi-objective Optimization Genetic Algorithm

Hop-by-hop bandwidth allocation and deployment for SFC with end-to-end delay QoS guarantees

Contact Info

Product

Resources

About