{"title":"5G网络切片中的联合带宽编排与用户关联","authors":"Ken Long, Meiling Qian, Kan Chen, Xiang Yu","doi":"10.1109/VTCSpring.2019.8746431","DOIUrl":null,"url":null,"abstract":"Network slicing requires the on-demand resource allocation according to the requirements from different slices. In this paper, we aim to incorporate an enhanced Mobile Broadband (eMBB) slice and an ultra-Reliable Low-Latency Communications (uRLLC) slice in the same substrate network, where the eMBB slice aims to receive a high throughput and the uRLLC slice requires a low transmission delay. To achieve the different requirements, we jointly consider user association and bandwidth orchestration in the substrate network, and formulate the problem as a mixed-integer programming (MIP). We propose two different approaches to solve the MIP, i.e., a high-complexity exhaustive search (ES) algorithm and a low-complexity high probability guarantee heuristic (HPGH) algorithm. Simulation results show that our proposed approach can seek the tradeoff between throughput and transmission delay, and allocate on-demand bandwidth resources dynamically.","PeriodicalId":134773,"journal":{"name":"2019 IEEE 89th Vehicular Technology Conference (VTC2019-Spring)","volume":"30 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Joint Bandwidth Orchestration and User Association in 5G Network Slicing\",\"authors\":\"Ken Long, Meiling Qian, Kan Chen, Xiang Yu\",\"doi\":\"10.1109/VTCSpring.2019.8746431\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Network slicing requires the on-demand resource allocation according to the requirements from different slices. In this paper, we aim to incorporate an enhanced Mobile Broadband (eMBB) slice and an ultra-Reliable Low-Latency Communications (uRLLC) slice in the same substrate network, where the eMBB slice aims to receive a high throughput and the uRLLC slice requires a low transmission delay. To achieve the different requirements, we jointly consider user association and bandwidth orchestration in the substrate network, and formulate the problem as a mixed-integer programming (MIP). We propose two different approaches to solve the MIP, i.e., a high-complexity exhaustive search (ES) algorithm and a low-complexity high probability guarantee heuristic (HPGH) algorithm. Simulation results show that our proposed approach can seek the tradeoff between throughput and transmission delay, and allocate on-demand bandwidth resources dynamically.\",\"PeriodicalId\":134773,\"journal\":{\"name\":\"2019 IEEE 89th Vehicular Technology Conference (VTC2019-Spring)\",\"volume\":\"30 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-04-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2019 IEEE 89th Vehicular Technology Conference (VTC2019-Spring)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/VTCSpring.2019.8746431\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 IEEE 89th Vehicular Technology Conference (VTC2019-Spring)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/VTCSpring.2019.8746431","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Joint Bandwidth Orchestration and User Association in 5G Network Slicing
Network slicing requires the on-demand resource allocation according to the requirements from different slices. In this paper, we aim to incorporate an enhanced Mobile Broadband (eMBB) slice and an ultra-Reliable Low-Latency Communications (uRLLC) slice in the same substrate network, where the eMBB slice aims to receive a high throughput and the uRLLC slice requires a low transmission delay. To achieve the different requirements, we jointly consider user association and bandwidth orchestration in the substrate network, and formulate the problem as a mixed-integer programming (MIP). We propose two different approaches to solve the MIP, i.e., a high-complexity exhaustive search (ES) algorithm and a low-complexity high probability guarantee heuristic (HPGH) algorithm. Simulation results show that our proposed approach can seek the tradeoff between throughput and transmission delay, and allocate on-demand bandwidth resources dynamically.