A clustering-based approach for Virtual Network Function Mapping and Assigning

Zenan Wang, Jiao Zhang, Tao Huang, Yun-jie Liu
{"title":"A clustering-based approach for Virtual Network Function Mapping and Assigning","authors":"Zenan Wang, Jiao Zhang, Tao Huang, Yun-jie Liu","doi":"10.1109/IWQoS.2017.7969143","DOIUrl":null,"url":null,"abstract":"Network Function Virtualization has attracted attention from both academia and industry as it can help the service provider to obtain agility and flexibility in network service deployment. In general, the enterprises require their flows to pass through a specific sequence of virtual network function (VNF) that varies from service to service. In addition, for each VNF required in the coming service demands, the operator can either launch a new instance for it or assign it to an established instance. This makes the network service deployment tasks even more complicated. In this paper, we first propose a method based on min-K-cut to cluster the VNFs. With clustering results as guidance, we determine whether to launch or reuse the instance to improve utilization rate of the VNF instance. Furthermore, for purpose of decreasing link bandwidth occupation, we aggregate the instances that are deployed with VNFs from the same cluster into the same server or rack. We evaluate our approach considering the average link bandwidth occupied by every accepted demand, the instance utilization rate and the total number of served demands. The simulation shows that our approach reduces link occupation effectively, and, meanwhile, guarantees the VNF instance utilization rate advantageously.","PeriodicalId":422861,"journal":{"name":"2017 IEEE/ACM 25th International Symposium on Quality of Service (IWQoS)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 IEEE/ACM 25th International Symposium on Quality of Service (IWQoS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IWQoS.2017.7969143","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 7

Abstract

Network Function Virtualization has attracted attention from both academia and industry as it can help the service provider to obtain agility and flexibility in network service deployment. In general, the enterprises require their flows to pass through a specific sequence of virtual network function (VNF) that varies from service to service. In addition, for each VNF required in the coming service demands, the operator can either launch a new instance for it or assign it to an established instance. This makes the network service deployment tasks even more complicated. In this paper, we first propose a method based on min-K-cut to cluster the VNFs. With clustering results as guidance, we determine whether to launch or reuse the instance to improve utilization rate of the VNF instance. Furthermore, for purpose of decreasing link bandwidth occupation, we aggregate the instances that are deployed with VNFs from the same cluster into the same server or rack. We evaluate our approach considering the average link bandwidth occupied by every accepted demand, the instance utilization rate and the total number of served demands. The simulation shows that our approach reduces link occupation effectively, and, meanwhile, guarantees the VNF instance utilization rate advantageously.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于聚类的虚拟网络功能映射与分配方法
网络功能虚拟化技术能够帮助服务提供商在网络业务部署中获得敏捷性和灵活性,因此受到了学术界和业界的广泛关注。一般情况下,企业要求其业务流通过特定的VNF序列,这些VNF序列在不同的业务中是不同的。此外,对于未来服务需求中所需的每个VNF,运营商可以为其启动一个新实例,也可以将其分配给已建立的实例。这使得网络服务部署任务更加复杂。本文首先提出了一种基于min-K-cut的vnf聚类方法。以聚类结果为指导,我们决定是否启动或重用实例,以提高VNF实例的利用率。此外,为了减少链路带宽占用,我们将同一集群中使用VNFs部署的实例聚合到同一服务器或机架中。我们评估我们的方法,考虑每个接受的需求占用的平均链路带宽,实例利用率和服务需求的总数。仿真结果表明,该方法有效地减少了链路占用,同时很好地保证了VNF实例的利用率。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
When privacy meets economics: Enabling differentially-private battery-supported meter reporting in smart grid Task assignment with guaranteed quality for crowdsourcing platforms Social media stickiness in Mobile Personal Livestreaming service Multicast scheduling algorithm in software defined fat-tree data center networks A cooperative mechanism for efficient inter-domain in-network cache sharing
×
引用
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