.png){kind=icon}
返回
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}
分享.png){kind=icon}
收藏
摘要
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.
Keyword:
Network function virtualization
VNF placement
randomly arrived traffic
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
I
IF:
7
论文数:
1.6K
被引数:
5.5K
机构
引用论文
An autonomous 16 mm/sup 3/ solar-powered node for distributed wireless sensor networks用于分布式无线传感器网络的自治16毫米/sup3/太阳能节点
PREAI
分享收藏
Vinyl 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
分享收藏分享收藏
查看更多内容