基于效用算法和随机优化的动态网络切片

Sidharth Sharma, A. Gumaste, M. Tatipamula
{"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}
引用次数: 3

摘要

网络切片是下一代5G服务的关键推动者。片通过逻辑网络连接虚拟网络功能(VNFs),从而提供不同的服务。本文提出了一种基于效用理论的动态切片算法,该算法能够方便地实现网络切片的增长、供给、标注和删除。该算法基于一种实用新型,该实用新型可调节数据中心VNFs的虚拟拓扑结构。该算法优化了片的数量以及实例化的VNFs,从而创建/修改和销毁适当粒度的网络片。此外,我们还提出了一种随机优化公式,以处理服务请求中的不确定性。我们模拟了一个多数据中心模型的算法,该模型具有大量的切片集。结果表明,该算法具有一定的动态性、鲁棒性和可扩展性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
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.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信