{"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.