SDN policy-driven service chain placement in OpenStack

M. Stein, M. Scharf, V. Hilt
{"title":"SDN policy-driven service chain placement in OpenStack","authors":"M. Stein, M. Scharf, V. Hilt","doi":"10.23919/INM.2017.7987374","DOIUrl":null,"url":null,"abstract":"Network functions virtualization requires automatic deployment and scaling of components. This raises the question of where to place instances of a function, for instance in the OpenStack cloud system. Data plane functions can forward large amounts of traffic. In this case, network-aware placement can avoid an inefficient use of host bandwidth, and a chain of functions can benefit from co-locating instances on a host. However, a practical challenge is that the bandwidth utilization or traffic demand matrix is not always known before the deployment of an instance. A promising remedy is to leverage existing Software Defined Networking (SDN) policies to derive connectivity weights between components. In this paper, we present this novel solution to the online instance placement problem. We have developed an extension of the OpenStack scheduler that uses SDN forwarding policies to rank potential hosts. For a given type of virtual machine, the corresponding forwarding policies can be retrieved from an SDN controller prior to the placement decision. Our prototype identifies potential communication peers and weighs the forwarding rules to prefer hosts that already run communication peers. We present heuristics for such weighing, and we also discuss limitations of the approach. A testbed implementation proofs that even in a simple example our solution can double the service chain throughput.","PeriodicalId":119633,"journal":{"name":"2017 IFIP/IEEE Symposium on Integrated Network and Service Management (IM)","volume":"100 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-05-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 IFIP/IEEE Symposium on Integrated Network and Service Management (IM)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.23919/INM.2017.7987374","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 6

Abstract

Network functions virtualization requires automatic deployment and scaling of components. This raises the question of where to place instances of a function, for instance in the OpenStack cloud system. Data plane functions can forward large amounts of traffic. In this case, network-aware placement can avoid an inefficient use of host bandwidth, and a chain of functions can benefit from co-locating instances on a host. However, a practical challenge is that the bandwidth utilization or traffic demand matrix is not always known before the deployment of an instance. A promising remedy is to leverage existing Software Defined Networking (SDN) policies to derive connectivity weights between components. In this paper, we present this novel solution to the online instance placement problem. We have developed an extension of the OpenStack scheduler that uses SDN forwarding policies to rank potential hosts. For a given type of virtual machine, the corresponding forwarding policies can be retrieved from an SDN controller prior to the placement decision. Our prototype identifies potential communication peers and weighs the forwarding rules to prefer hosts that already run communication peers. We present heuristics for such weighing, and we also discuss limitations of the approach. A testbed implementation proofs that even in a simple example our solution can double the service chain throughput.
在OpenStack中放置SDN策略驱动的服务链
网络功能虚拟化需要自动部署和扩展组件。这就提出了一个问题,即在哪里放置函数的实例,例如在OpenStack云系统中。数据平面功能可以转发大量的流量。在这种情况下,网络感知的布局可以避免对主机带宽的低效使用,并且一系列功能可以从在主机上共同定位实例中获益。然而,一个实际的挑战是,在部署实例之前并不总是知道带宽利用率或流量需求矩阵。一种很有希望的补救方法是利用现有的软件定义网络(SDN)策略来派生组件之间的连通性权重。在本文中,我们提出了一种新的解决在线实例放置问题的方法。我们开发了OpenStack调度器的扩展,它使用SDN转发策略对潜在主机进行排名。对于给定类型的虚拟机,可以在做出放置决定之前从SDN控制器检索相应的转发策略。我们的原型识别潜在的通信对等体,并权衡转发规则,以优先选择已经运行通信对等体的主机。我们提出了这种权衡的启发式方法,并讨论了该方法的局限性。测试平台的实现证明,即使在一个简单的示例中,我们的解决方案也可以将服务链吞吐量提高一倍。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术官方微信