基于显著性的网络切片演化虚拟网络功能放置方法

Takahiro Hirayama, M. Jibiki, Ved P. Kafle
{"title":"基于显著性的网络切片演化虚拟网络功能放置方法","authors":"Takahiro Hirayama, M. Jibiki, Ved P. Kafle","doi":"10.1109/CCNC46108.2020.9045322","DOIUrl":null,"url":null,"abstract":"Network function virtualization (NFV) technology enables us to deploy a distinct network slice composed of various virtualized network functions (VNFs) required for a given service, such as video on demand (VoD) and Internet-of-things (IoT). As a result, application service providers (ASPs) can easily deploy and provide their services to end users (EUs) by leasing resources formed as network slices. However, as the user population or the network traffic volume fluctuates, the capacity of network slices has to be adjusted dynamically. It requires to take decision about placing NFs in appropriate locations so that the quality of services (QoS), such as transmission or processing latency is guaranteed while optimally utilizing the reserved resources. One can address the above challenge by solving an optimization problem such as integer linear programming. However, the optimization problem takes much time to solve. In this paper, we propose a network function placement algorithm based on salience, which is one of characteristic metrics of links in graphs. Our objectives are two folds: keeping the slice reconstruction cost low, and avoiding the cases of QoS degradation. The simulation results show that our scheme performs equally well for different sizes of slices (i.e., the number of EUs). When slices are reconstructed with our scheme in a 200-node network, we found that the network reconfiguration costs are low and almost the same value for various sizes of slices.","PeriodicalId":443862,"journal":{"name":"2020 IEEE 17th Annual Consumer Communications & Networking Conference (CCNC)","volume":"37 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Virtual Network Function Placement Method for Evolving Network Slices based on Salience\",\"authors\":\"Takahiro Hirayama, M. Jibiki, Ved P. Kafle\",\"doi\":\"10.1109/CCNC46108.2020.9045322\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Network function virtualization (NFV) technology enables us to deploy a distinct network slice composed of various virtualized network functions (VNFs) required for a given service, such as video on demand (VoD) and Internet-of-things (IoT). As a result, application service providers (ASPs) can easily deploy and provide their services to end users (EUs) by leasing resources formed as network slices. However, as the user population or the network traffic volume fluctuates, the capacity of network slices has to be adjusted dynamically. It requires to take decision about placing NFs in appropriate locations so that the quality of services (QoS), such as transmission or processing latency is guaranteed while optimally utilizing the reserved resources. One can address the above challenge by solving an optimization problem such as integer linear programming. However, the optimization problem takes much time to solve. In this paper, we propose a network function placement algorithm based on salience, which is one of characteristic metrics of links in graphs. Our objectives are two folds: keeping the slice reconstruction cost low, and avoiding the cases of QoS degradation. The simulation results show that our scheme performs equally well for different sizes of slices (i.e., the number of EUs). When slices are reconstructed with our scheme in a 200-node network, we found that the network reconfiguration costs are low and almost the same value for various sizes of slices.\",\"PeriodicalId\":443862,\"journal\":{\"name\":\"2020 IEEE 17th Annual Consumer Communications & Networking Conference (CCNC)\",\"volume\":\"37 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2020 IEEE 17th Annual Consumer Communications & Networking Conference (CCNC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CCNC46108.2020.9045322\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 IEEE 17th Annual Consumer Communications & Networking Conference (CCNC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CCNC46108.2020.9045322","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

网络功能虚拟化(NFV)技术使我们能够为特定的业务(如视频点播(VoD)和物联网(IoT))部署由各种虚拟网络功能(vnf)组成的独特网络切片。因此,应用服务提供商(asp)可以通过租赁以网络片形式形成的资源,方便地向终端用户(eu)部署和提供服务。但是,随着用户数量或网络流量的变化,网络切片的容量需要动态调整。它需要决定是否将NFs放置在适当的位置,以便保证服务质量(QoS),例如传输或处理延迟,同时最佳地利用保留资源。我们可以通过解决最优化问题(如整数线性规划)来解决上述挑战。然而,优化问题需要大量的时间来解决。本文提出了一种基于显著性的网络函数放置算法,显著性是图中链路的特征度量之一。我们的目标有两个方面:保持低的切片重建成本,避免QoS退化的情况。仿真结果表明,对于不同大小的切片(即EUs的数量),我们的方案具有相同的性能。在一个200节点的网络中,用我们的方案重构切片时,我们发现网络重构成本很低,对于不同大小的切片,网络重构成本几乎相同。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Virtual Network Function Placement Method for Evolving Network Slices based on Salience
Network function virtualization (NFV) technology enables us to deploy a distinct network slice composed of various virtualized network functions (VNFs) required for a given service, such as video on demand (VoD) and Internet-of-things (IoT). As a result, application service providers (ASPs) can easily deploy and provide their services to end users (EUs) by leasing resources formed as network slices. However, as the user population or the network traffic volume fluctuates, the capacity of network slices has to be adjusted dynamically. It requires to take decision about placing NFs in appropriate locations so that the quality of services (QoS), such as transmission or processing latency is guaranteed while optimally utilizing the reserved resources. One can address the above challenge by solving an optimization problem such as integer linear programming. However, the optimization problem takes much time to solve. In this paper, we propose a network function placement algorithm based on salience, which is one of characteristic metrics of links in graphs. Our objectives are two folds: keeping the slice reconstruction cost low, and avoiding the cases of QoS degradation. The simulation results show that our scheme performs equally well for different sizes of slices (i.e., the number of EUs). When slices are reconstructed with our scheme in a 200-node network, we found that the network reconfiguration costs are low and almost the same value for various sizes of slices.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信