Co-Scaler:软件定义NFV业务功能链的协同扩展

Bin Zhang, Pengfei Zhang, Yusu Zhao, Yongkun Wang, Xuan Luo, Yaohui Jin
{"title":"Co-Scaler:软件定义NFV业务功能链的协同扩展","authors":"Bin Zhang, Pengfei Zhang, Yusu Zhao, Yongkun Wang, Xuan Luo, Yaohui Jin","doi":"10.1109/NFV-SDN.2016.7919472","DOIUrl":null,"url":null,"abstract":"Modern network functions (NFs) are able to scale out conveniently with the help of network function virtualization (NFV). When network traffic rises, NFV can provide more instances easily for migrating network flows to new instances to balance the traffic on the existing ones. However, the main challenge is to select which subset of existing flows to migrate when scale out, minimizing the negative impact of flow migration. In this paper, we propose the Co-Scaler, which is a heuristic algorithm to find out an optimized solution quickly. It employs two-step flow selection when a service function chain (SFC) with multiple NFs needs to scale out. We evaluated Co-Scaler by the real trace from data center network with several NFs. The results show that Co-Scaler can significantly decrease the number of packets affected by buffering, and minimize the latency introduced by flow migration.","PeriodicalId":448203,"journal":{"name":"2016 IEEE Conference on Network Function Virtualization and Software Defined Networks (NFV-SDN)","volume":"187 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"23","resultStr":"{\"title\":\"Co-Scaler: Cooperative scaling of software-defined NFV service function chain\",\"authors\":\"Bin Zhang, Pengfei Zhang, Yusu Zhao, Yongkun Wang, Xuan Luo, Yaohui Jin\",\"doi\":\"10.1109/NFV-SDN.2016.7919472\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Modern network functions (NFs) are able to scale out conveniently with the help of network function virtualization (NFV). When network traffic rises, NFV can provide more instances easily for migrating network flows to new instances to balance the traffic on the existing ones. However, the main challenge is to select which subset of existing flows to migrate when scale out, minimizing the negative impact of flow migration. In this paper, we propose the Co-Scaler, which is a heuristic algorithm to find out an optimized solution quickly. It employs two-step flow selection when a service function chain (SFC) with multiple NFs needs to scale out. We evaluated Co-Scaler by the real trace from data center network with several NFs. The results show that Co-Scaler can significantly decrease the number of packets affected by buffering, and minimize the latency introduced by flow migration.\",\"PeriodicalId\":448203,\"journal\":{\"name\":\"2016 IEEE Conference on Network Function Virtualization and Software Defined Networks (NFV-SDN)\",\"volume\":\"187 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2016-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"23\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2016 IEEE Conference on Network Function Virtualization and Software Defined Networks (NFV-SDN)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/NFV-SDN.2016.7919472\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 IEEE Conference on Network Function Virtualization and Software Defined Networks (NFV-SDN)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/NFV-SDN.2016.7919472","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 23

摘要

借助网络功能虚拟化(NFV),现代网络功能(NFs)可以方便地向外扩展。当网络流量增加时,NFV可以很容易地提供更多的实例,以便将网络流迁移到新的实例上,以平衡现有实例上的流量。然而,主要的挑战是选择在扩展时迁移现有流的哪个子集,以最小化流迁移的负面影响。本文提出了一种启发式算法——协标量算法,它能快速找到最优解。当具有多个NFs的业务功能链(SFC)需要向外扩展时,采用两步流选择。我们通过对数据中心网络中多个NFs的真实跟踪来评估协标量。结果表明,Co-Scaler可以显著减少受缓冲影响的数据包数量,并最大限度地减少流迁移带来的延迟。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Co-Scaler: Cooperative scaling of software-defined NFV service function chain
Modern network functions (NFs) are able to scale out conveniently with the help of network function virtualization (NFV). When network traffic rises, NFV can provide more instances easily for migrating network flows to new instances to balance the traffic on the existing ones. However, the main challenge is to select which subset of existing flows to migrate when scale out, minimizing the negative impact of flow migration. In this paper, we propose the Co-Scaler, which is a heuristic algorithm to find out an optimized solution quickly. It employs two-step flow selection when a service function chain (SFC) with multiple NFs needs to scale out. We evaluated Co-Scaler by the real trace from data center network with several NFs. The results show that Co-Scaler can significantly decrease the number of packets affected by buffering, and minimize the latency introduced by flow migration.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信