虚拟网络功能链接与放置的组合选择机制

S. Araújo, F. S. Souza, G. Mateus
{"title":"虚拟网络功能链接与放置的组合选择机制","authors":"S. Araújo, F. S. Souza, G. Mateus","doi":"10.23919/CNSM46954.2019.9012746","DOIUrl":null,"url":null,"abstract":"Virtual Network Functions (VNF) reduce the complexity to deploy a Network Service (NS), yielding flexibility, and scalability to attend new market appliances and minimizing the required investments. An ordered set of VNFs to serve a NS is called a Service Function Chain (SFC). Most of the literature works deal with SFCs generation and embedding as independent problems, not taking into account the residual substrate network (SN) status during the SFCs generation stage. Furthermore, a NS can award some flexibility regarding the VNFs sequence, i.e., only a subset of VNFs have a fixed precedence requirement. Following this idea, the network operator may enjoy some options to serve a NS. In this work, we introduce a new embedding approach which selects the SFC composition that best fits the residual SN, leading to a better performance in the chaining and placement of VNFs. The results showed that the composition selection mechanism increases performance compared to traditional models that use a fixed composition, improving resources sharing, and increasing the network operator revenues. Also, we demonstrated that the generation of an optimal SFC for a NS does not always lead to the best acceptance rates in a network with partially consumed resources.","PeriodicalId":273818,"journal":{"name":"2019 15th International Conference on Network and Service Management (CNSM)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"A Composition Selection Mechanism for Chaining and Placement of Virtual Network Functions\",\"authors\":\"S. Araújo, F. S. Souza, G. Mateus\",\"doi\":\"10.23919/CNSM46954.2019.9012746\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Virtual Network Functions (VNF) reduce the complexity to deploy a Network Service (NS), yielding flexibility, and scalability to attend new market appliances and minimizing the required investments. An ordered set of VNFs to serve a NS is called a Service Function Chain (SFC). Most of the literature works deal with SFCs generation and embedding as independent problems, not taking into account the residual substrate network (SN) status during the SFCs generation stage. Furthermore, a NS can award some flexibility regarding the VNFs sequence, i.e., only a subset of VNFs have a fixed precedence requirement. Following this idea, the network operator may enjoy some options to serve a NS. In this work, we introduce a new embedding approach which selects the SFC composition that best fits the residual SN, leading to a better performance in the chaining and placement of VNFs. The results showed that the composition selection mechanism increases performance compared to traditional models that use a fixed composition, improving resources sharing, and increasing the network operator revenues. Also, we demonstrated that the generation of an optimal SFC for a NS does not always lead to the best acceptance rates in a network with partially consumed resources.\",\"PeriodicalId\":273818,\"journal\":{\"name\":\"2019 15th International Conference on Network and Service Management (CNSM)\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2019 15th International Conference on Network and Service Management (CNSM)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.23919/CNSM46954.2019.9012746\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 15th International Conference on Network and Service Management (CNSM)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.23919/CNSM46954.2019.9012746","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

虚拟网络功能(VNF)降低了部署网络服务(NS)的复杂性,提供了灵活性和可扩展性,以适应新的市场设备,并最大限度地减少了所需的投资。服务于一个NS的VNFs的有序集合称为SFC (Service Function Chain)。大多数文献都将sfc的生成和嵌入作为独立的问题来处理,没有考虑sfc生成阶段的残余衬底网络(SN)状态。此外,对于VNFs序列,NS可以授予一定的灵活性,即只有一部分VNFs具有固定的优先级要求。根据这个想法,网络运营商可能会有一些选择来提供NS。在这项工作中,我们引入了一种新的嵌入方法,该方法选择最适合残差SN的SFC组成,从而在vnf的链接和放置中获得更好的性能。结果表明,与使用固定组合的传统模型相比,组合选择机制提高了性能,改善了资源共享,增加了网络运营商的收入。此外,我们还证明,在资源部分消耗的网络中,为NS生成最优SFC并不总是导致最佳接受率。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
A Composition Selection Mechanism for Chaining and Placement of Virtual Network Functions
Virtual Network Functions (VNF) reduce the complexity to deploy a Network Service (NS), yielding flexibility, and scalability to attend new market appliances and minimizing the required investments. An ordered set of VNFs to serve a NS is called a Service Function Chain (SFC). Most of the literature works deal with SFCs generation and embedding as independent problems, not taking into account the residual substrate network (SN) status during the SFCs generation stage. Furthermore, a NS can award some flexibility regarding the VNFs sequence, i.e., only a subset of VNFs have a fixed precedence requirement. Following this idea, the network operator may enjoy some options to serve a NS. In this work, we introduce a new embedding approach which selects the SFC composition that best fits the residual SN, leading to a better performance in the chaining and placement of VNFs. The results showed that the composition selection mechanism increases performance compared to traditional models that use a fixed composition, improving resources sharing, and increasing the network operator revenues. Also, we demonstrated that the generation of an optimal SFC for a NS does not always lead to the best acceptance rates in a network with partially consumed resources.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Flow-based Throughput Prediction using Deep Learning and Real-World Network Traffic Learning From Evolving Network Data for Dependable Botnet Detection Exploring NAT Detection and Host Identification Using Machine Learning Lumped Markovian Estimation for Wi-Fi Channel Utilization Prediction An Access Control Implementation Targeting Resource-constrained Environments
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1