虚拟网络功能的复杂性与路由问题

Bernardetta Addis, Meihui Gao, Giuliana Carello
{"title":"虚拟网络功能的复杂性与路由问题","authors":"Bernardetta Addis,&nbsp;Meihui Gao,&nbsp;Giuliana Carello","doi":"10.1016/j.endm.2018.07.026","DOIUrl":null,"url":null,"abstract":"<div><p>The demand for network services, such as proxy or firewall, is ever increasing due to the massive diffusion of applications, both on computers and mobile devices. Virtual Network Functions allow to instantiate network services on clouds in a software based manner, thus allowing to dynamically provide services at a reasonable cost. In this work we consider the problem of placing Virtual Network Function instances (services) and routing the demands so as to guarantee that demands can reach the requested services. We discuss the complexity of a particular version of the Virtual Network Function placement and routing problem and the impact of the network topology on the problem complexity.</p></div>","PeriodicalId":35408,"journal":{"name":"Electronic Notes in Discrete Mathematics","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/j.endm.2018.07.026","citationCount":"10","resultStr":"{\"title\":\"On the complexity of a Virtual Network Function Placement and Routing problem\",\"authors\":\"Bernardetta Addis,&nbsp;Meihui Gao,&nbsp;Giuliana Carello\",\"doi\":\"10.1016/j.endm.2018.07.026\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>The demand for network services, such as proxy or firewall, is ever increasing due to the massive diffusion of applications, both on computers and mobile devices. Virtual Network Functions allow to instantiate network services on clouds in a software based manner, thus allowing to dynamically provide services at a reasonable cost. In this work we consider the problem of placing Virtual Network Function instances (services) and routing the demands so as to guarantee that demands can reach the requested services. We discuss the complexity of a particular version of the Virtual Network Function placement and routing problem and the impact of the network topology on the problem complexity.</p></div>\",\"PeriodicalId\":35408,\"journal\":{\"name\":\"Electronic Notes in Discrete Mathematics\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-08-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://sci-hub-pdf.com/10.1016/j.endm.2018.07.026\",\"citationCount\":\"10\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Electronic Notes in Discrete Mathematics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S1571065318301707\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"Mathematics\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Electronic Notes in Discrete Mathematics","FirstCategoryId":"1085","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S1571065318301707","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"Mathematics","Score":null,"Total":0}
引用次数: 10

摘要

由于应用程序在计算机和移动设备上的大规模扩散,对网络服务(如代理或防火墙)的需求不断增加。虚拟网络功能允许以基于软件的方式在云上实例化网络服务,从而允许以合理的成本动态地提供服务。在这项工作中,我们考虑了放置虚拟网络功能实例(服务)和路由需求的问题,以保证需求能够到达所请求的服务。我们讨论了特定版本的虚拟网络功能的复杂性和路由问题,以及网络拓扑结构对问题复杂性的影响。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
On the complexity of a Virtual Network Function Placement and Routing problem

The demand for network services, such as proxy or firewall, is ever increasing due to the massive diffusion of applications, both on computers and mobile devices. Virtual Network Functions allow to instantiate network services on clouds in a software based manner, thus allowing to dynamically provide services at a reasonable cost. In this work we consider the problem of placing Virtual Network Function instances (services) and routing the demands so as to guarantee that demands can reach the requested services. We discuss the complexity of a particular version of the Virtual Network Function placement and routing problem and the impact of the network topology on the problem complexity.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Electronic Notes in Discrete Mathematics
Electronic Notes in Discrete Mathematics Mathematics-Discrete Mathematics and Combinatorics
CiteScore
1.30
自引率
0.00%
发文量
0
期刊介绍: Electronic Notes in Discrete Mathematics is a venue for the rapid electronic publication of the proceedings of conferences, of lecture notes, monographs and other similar material for which quick publication is appropriate. Organizers of conferences whose proceedings appear in Electronic Notes in Discrete Mathematics, and authors of other material appearing as a volume in the series are allowed to make hard copies of the relevant volume for limited distribution. For example, conference proceedings may be distributed to participants at the meeting, and lecture notes can be distributed to those taking a course based on the material in the volume.
期刊最新文献
Preface Minimal condition for shortest vectors in lattices of low dimension Enumerating words with forbidden factors Polygon-circle and word-representable graphs On an arithmetic triangle of numbers arising from inverses of analytic functions
×
引用
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