.png){kind=icon}
返回
Joint optimization of function mapping and preemptive scheduling for service chains in network function virtualization
.png){kind=icon}
PRE
AI
DOI：10.1016/j.future.2017.12.021.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The idea of Network Function Virtualization (NFV) is to decouple of network functions from dedicated hardwares to obtain higher flexibility in terms of network management and maintenance. Although the problem of function placement and scheduling in NFV has drawn much attention in recent years, existing studies only consider the precedence constraints between network functions within a service but lacking for the interactions among services. In this paper, under the premise of satisfying the precedence conditions of forming the service chain, we study how to minimize the completion time of the whole system through efficient mapping and preemptive scheduling of functions for multiple service chains. We firstly model this issue as an Integer Linear Programming (ILP) problem. To avoid the computational complexity of ILP, an online preemptive algorithm is designed. Extensive simulations are conducted to validate the effectiveness of the proposed algorithm. The simulation results indicate that our algorithm is suitable for placement and scheduling of functions for multiple service chains in NFV. (C) 2018 Elsevier B.V. All rights reserved.
Keyword:
Network function virtualization
Function mapping
Preemptive scheduling
Service chain
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
F
IF:
6.1
论文数:
6.8K
被引数:
2.3W
机构
引用论文
.png){kind=icon}
分享收藏
Temporal Dynamics Linking Aspects of Parent Monitoring with Early Adolescent Antisocial Behavior
OAAI
OAAI分享收藏
查看更多内容