.png){kind=icon}
Return
Network Function Placement Under Randomly Arrived Networking Traffic
.png){kind=icon}
PRE
AI
DOI：10.1109/TCCN.2021.3091711.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Y The virtual network functions (VNFs) placement problem has drawn significant attention from both academia and industry in recent years. Most of the researchers have ignored the fact that the probability of traffic flows through VNFs cannot always be 100%. In this paper, we study the placement scheme for virtual network function considering randomized data traffic (VNFPRAT). Our objective is to determine optimal deployment locations for VNFs and minimize total end-to-end delay. We formulate the VNFPRAT problem as a 0-1 nonlinear programming problem and prove its NP-hardness. This formulation is linearized to obtain the optimal solution for small scale networks. Besides, two efficient metaheuristics, i.e., greedy and simulated annealing, are proposed quickly find a near-optimal placement solution. Extensive simulations demonstrate that our proposed approach achieves 38.8% less end-to-end delay than the generic algorithm.
Keywords:
Network function virtualization
VNF placement
randomly arrived traffic
Journal
I
IF:
7
Papers:
1.6K
Citations:
5.5K
Organization
Cited Papers
ShareSave
ShareSaveVinyl polymers containing amido and carboxylic groups as side substituents: I. Synthesis of N-acryloyl-glycine and N-acryloyl-6-caproic acid and their grafting on cellulose membranes.png)
Polymer
PolymerIF0
PREAI
ShareSaveShareSave
View more