{"title":"基于效用算法和随机优化的动态网络切片","authors":"Sidharth Sharma, A. Gumaste, M. Tatipamula","doi":"10.1109/HPSR48589.2020.9098981","DOIUrl":null,"url":null,"abstract":"Network slicing is a key enabler for next-generation 5G services. Slices are designed to offer different services by conjoining virtual network functions (VNFs) through a logical network. We propose a dynamic slicing algorithm, which is based on utility theory and facilitates the growth, provisioning, dimensioning and deletion of network slices. The proposed algorithm is based on a utility model that regulates the virtual topology of VNFs in data-centers. The algorithm optimizes the number of slices as well as instantiated VNFs, thereby creating/modifying and destroying network slices of appropriate granularity. In addition, we also propose a stochastic optimization formulation, which handles uncertainty in service requests. We simulate the algorithm for a multi-data-center model with a large set of slices. Our results indicate dynamism, robustness and scalability of the proposed algorithm.","PeriodicalId":163393,"journal":{"name":"2020 IEEE 21st International Conference on High Performance Switching and Routing (HPSR)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Dynamic Network Slicing Using Utility Algorithms and Stochastic Optimization\",\"authors\":\"Sidharth Sharma, A. Gumaste, M. Tatipamula\",\"doi\":\"10.1109/HPSR48589.2020.9098981\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Network slicing is a key enabler for next-generation 5G services. Slices are designed to offer different services by conjoining virtual network functions (VNFs) through a logical network. We propose a dynamic slicing algorithm, which is based on utility theory and facilitates the growth, provisioning, dimensioning and deletion of network slices. The proposed algorithm is based on a utility model that regulates the virtual topology of VNFs in data-centers. The algorithm optimizes the number of slices as well as instantiated VNFs, thereby creating/modifying and destroying network slices of appropriate granularity. In addition, we also propose a stochastic optimization formulation, which handles uncertainty in service requests. We simulate the algorithm for a multi-data-center model with a large set of slices. Our results indicate dynamism, robustness and scalability of the proposed algorithm.\",\"PeriodicalId\":163393,\"journal\":{\"name\":\"2020 IEEE 21st International Conference on High Performance Switching and Routing (HPSR)\",\"volume\":\"9 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-05-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2020 IEEE 21st International Conference on High Performance Switching and Routing (HPSR)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/HPSR48589.2020.9098981\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 IEEE 21st International Conference on High Performance Switching and Routing (HPSR)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/HPSR48589.2020.9098981","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Dynamic Network Slicing Using Utility Algorithms and Stochastic Optimization
Network slicing is a key enabler for next-generation 5G services. Slices are designed to offer different services by conjoining virtual network functions (VNFs) through a logical network. We propose a dynamic slicing algorithm, which is based on utility theory and facilitates the growth, provisioning, dimensioning and deletion of network slices. The proposed algorithm is based on a utility model that regulates the virtual topology of VNFs in data-centers. The algorithm optimizes the number of slices as well as instantiated VNFs, thereby creating/modifying and destroying network slices of appropriate granularity. In addition, we also propose a stochastic optimization formulation, which handles uncertainty in service requests. We simulate the algorithm for a multi-data-center model with a large set of slices. Our results indicate dynamism, robustness and scalability of the proposed algorithm.