...
首页> 外文期刊>IEEE systems journal >Cost-Efficient Service Function Chain Orchestration for Low-Latency Applications in NFV Networks
【24h】

Cost-Efficient Service Function Chain Orchestration for Low-Latency Applications in NFV Networks

机译:NFV网络中用于低延迟应用的经济高效的服务功能链编排

获取原文
获取原文并翻译 | 示例
           

摘要

With the popularization and development of cloud computing, network function virtualization and service function chain (SFC) provisioning have attracted increasing attention from researchers. Excellent and reliable network service is important for network development. Moreover, as the number of network users increases, network service construction costs become very high. Therefore, an efficient algorithm is necessary to provide an SFC with excellent performance and low resource costs. In this paper, we re-examine the problem of optimizing the deployment of an SFC to provide users with excellent and resource-saving network service. We propose a heuristic, closed-loop feedback (CLF) algorithm to find the shortest path to map an SFC. To solve the problem, we introduce and integrate a restricted Boltzmann machine and cross entropy to improve the performance of CLF. Simulation results demonstrate the excellent performance of CLF. The communication delay is reduced by approximately 20%, the accept ratio improves by approximately 15%, and the algorithm running time decreases by approximately 20%. In addition, the resource utilization ratio increases by approximately 15%, and the resource fragmentation ratio decreases by approximately 50%.
机译:随着云计算的普及和发展,网络功能虚拟化和服务功能链(SFC)设置已引起研究人员的越来越多的关注。优质可靠的网络服务对于网络发展至关重要。而且,随着网络用户数量的增加,网络服务的建设成本变得很高。因此,需要有效的算法来提供具有优异性能和低资源成本的SFC。在本文中,我们将重新研究优化SFC的部署以为用户提供出色且节省资源的网络服务的问题。我们提出一种启发式的闭环反馈(CLF)算法,以找到映射SFC的最短路径。为了解决该问题,我们引入并集成了受限的玻尔兹曼机和交叉熵来提高CLF的性能。仿真结果证明了CLF的出色性能。通信延迟减少了大约20%,接受率提高了大约15%,算法运行时间减少了大约20%。此外,资源利用率提高了约15%,资源碎片化率降低了约50%。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号