{"title":"随机C-RAN中前传和虚拟基站的经济有效联合建立","authors":"Yunyi Wu, Yongbing Zhang","doi":"10.1109/ICCCN58024.2023.10230143","DOIUrl":null,"url":null,"abstract":"Cloud radio access network (CRAN) offers low-latency and high-speed services to mobile end-users by locating remote radio heads (RRHs) near end-users and centralizing the baseband units (BBUs) corresponding to the RRHs in a central cloud. However, considering the time-varying traffic loads, a self-adjustable base station (BS) can respond to changing traffic loads for meeting user demands is needed. This paper focuses on minimizing the cost of fronthaul establishment and bandwidth consumption in forming a self-adjustable virtual BS (VBS). Since the fronthaul is critical infrastructure of CRAN connecting BBUs and RRHs that affects the VBS formation but cannot be adjusted dynamically, we jointly consider their decision making and formulate it as a two-stage stochastic problem. Since this problem can be linearized to an integer linear program (ILP) but is difficult to solve given a large network scale, we propose an approach called FEBD inspired by Benders decomposition (BD) to achieve the optimal fronthaul connection. Furthermore, we propose a heuristic approach that can quickly adjust the VBS formation in response to user demand. The numerical experiments show that the combined use of FEBD and the heuristic approach provides results that are close to the ILP results with a significantly shorter computation time.","PeriodicalId":132030,"journal":{"name":"2023 32nd International Conference on Computer Communications and Networks (ICCCN)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2023-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Cost-Effective Joint Establishment of Fronthaul and Virtual Base Stations in a Stochastic C-RAN\",\"authors\":\"Yunyi Wu, Yongbing Zhang\",\"doi\":\"10.1109/ICCCN58024.2023.10230143\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Cloud radio access network (CRAN) offers low-latency and high-speed services to mobile end-users by locating remote radio heads (RRHs) near end-users and centralizing the baseband units (BBUs) corresponding to the RRHs in a central cloud. However, considering the time-varying traffic loads, a self-adjustable base station (BS) can respond to changing traffic loads for meeting user demands is needed. This paper focuses on minimizing the cost of fronthaul establishment and bandwidth consumption in forming a self-adjustable virtual BS (VBS). Since the fronthaul is critical infrastructure of CRAN connecting BBUs and RRHs that affects the VBS formation but cannot be adjusted dynamically, we jointly consider their decision making and formulate it as a two-stage stochastic problem. Since this problem can be linearized to an integer linear program (ILP) but is difficult to solve given a large network scale, we propose an approach called FEBD inspired by Benders decomposition (BD) to achieve the optimal fronthaul connection. Furthermore, we propose a heuristic approach that can quickly adjust the VBS formation in response to user demand. The numerical experiments show that the combined use of FEBD and the heuristic approach provides results that are close to the ILP results with a significantly shorter computation time.\",\"PeriodicalId\":132030,\"journal\":{\"name\":\"2023 32nd International Conference on Computer Communications and Networks (ICCCN)\",\"volume\":\"12 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2023-07-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2023 32nd International Conference on Computer Communications and Networks (ICCCN)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCCN58024.2023.10230143\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2023 32nd International Conference on Computer Communications and Networks (ICCCN)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCCN58024.2023.10230143","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Cost-Effective Joint Establishment of Fronthaul and Virtual Base Stations in a Stochastic C-RAN
Cloud radio access network (CRAN) offers low-latency and high-speed services to mobile end-users by locating remote radio heads (RRHs) near end-users and centralizing the baseband units (BBUs) corresponding to the RRHs in a central cloud. However, considering the time-varying traffic loads, a self-adjustable base station (BS) can respond to changing traffic loads for meeting user demands is needed. This paper focuses on minimizing the cost of fronthaul establishment and bandwidth consumption in forming a self-adjustable virtual BS (VBS). Since the fronthaul is critical infrastructure of CRAN connecting BBUs and RRHs that affects the VBS formation but cannot be adjusted dynamically, we jointly consider their decision making and formulate it as a two-stage stochastic problem. Since this problem can be linearized to an integer linear program (ILP) but is difficult to solve given a large network scale, we propose an approach called FEBD inspired by Benders decomposition (BD) to achieve the optimal fronthaul connection. Furthermore, we propose a heuristic approach that can quickly adjust the VBS formation in response to user demand. The numerical experiments show that the combined use of FEBD and the heuristic approach provides results that are close to the ILP results with a significantly shorter computation time.