Chi-Hung Lin, Wei-Che Chien, Jen-Yeu Chen, Chin-Feng Lai, H. Chao
{"title":"具有灵活BBU资源分配的高效雾RAN (F-RAN),用于延迟感知移动边缘计算(MEC)服务","authors":"Chi-Hung Lin, Wei-Che Chien, Jen-Yeu Chen, Chin-Feng Lai, H. Chao","doi":"10.1109/VTCFall.2019.8891486","DOIUrl":null,"url":null,"abstract":"Cloud RAN (C-RAN) where Base Band Units (BBUs) are collocated in a computing/processing center remotely away from their correspondent Remote Radio Heads (RRHs) for the efficient resource sharing is the prevailing RAN (Radio Access Network) design for next generation mobile networks. However, in C- RAN, the possible high latency from a RRH to the centralized Cloud BBU pool is not desirable for some latency critical applications. Thus, several local and smaller BBU pools are necessary to be deployed close to the RRHs to constrain the latency. This RAN architecture is so-call Fog RAN (F-RAN). A Mobile Edge Computing (MEC) center can be deployed beside or nearby a F-RAN BBU pool for timely processing. In this paper, we tackle the BBU resource allocation problem (a modified bin packing problem) between the set of RRHs and the set of BBU pools in F-RAN so that only a minimal number of BBU pools, i.e., the bins in a bin packing problem, will be turned on to serve all RRHs and so to save the energy consumption. Also, for the stability and fault tolerance, in addition to saving energy, the proposed algorithms also perform load balancing amid serving BBU pools. Our extensive simulation results show that the proposed scheme for energy efficient BBU resource allocation is able to achieve the goal of saving energy consumption and load balancing.","PeriodicalId":6713,"journal":{"name":"2019 IEEE 90th Vehicular Technology Conference (VTC2019-Fall)","volume":"87 1","pages":"1-6"},"PeriodicalIF":0.0000,"publicationDate":"2019-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Energy Efficient Fog RAN (F-RAN) with Flexible BBU Resource Assignment for Latency Aware Mobile Edge Computing (MEC) Services\",\"authors\":\"Chi-Hung Lin, Wei-Che Chien, Jen-Yeu Chen, Chin-Feng Lai, H. Chao\",\"doi\":\"10.1109/VTCFall.2019.8891486\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Cloud RAN (C-RAN) where Base Band Units (BBUs) are collocated in a computing/processing center remotely away from their correspondent Remote Radio Heads (RRHs) for the efficient resource sharing is the prevailing RAN (Radio Access Network) design for next generation mobile networks. However, in C- RAN, the possible high latency from a RRH to the centralized Cloud BBU pool is not desirable for some latency critical applications. Thus, several local and smaller BBU pools are necessary to be deployed close to the RRHs to constrain the latency. This RAN architecture is so-call Fog RAN (F-RAN). A Mobile Edge Computing (MEC) center can be deployed beside or nearby a F-RAN BBU pool for timely processing. In this paper, we tackle the BBU resource allocation problem (a modified bin packing problem) between the set of RRHs and the set of BBU pools in F-RAN so that only a minimal number of BBU pools, i.e., the bins in a bin packing problem, will be turned on to serve all RRHs and so to save the energy consumption. Also, for the stability and fault tolerance, in addition to saving energy, the proposed algorithms also perform load balancing amid serving BBU pools. Our extensive simulation results show that the proposed scheme for energy efficient BBU resource allocation is able to achieve the goal of saving energy consumption and load balancing.\",\"PeriodicalId\":6713,\"journal\":{\"name\":\"2019 IEEE 90th Vehicular Technology Conference (VTC2019-Fall)\",\"volume\":\"87 1\",\"pages\":\"1-6\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-09-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2019 IEEE 90th Vehicular Technology Conference (VTC2019-Fall)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/VTCFall.2019.8891486\",\"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 90th Vehicular Technology Conference (VTC2019-Fall)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/VTCFall.2019.8891486","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4
摘要
云RAN (C-RAN)是下一代移动网络的主流RAN(无线接入网)设计,其中基带单元(BBUs)配置在远离其对应的远程无线电头(RRHs)的计算/处理中心,以实现有效的资源共享。然而,在C- RAN中,从RRH到集中式Cloud BBU池可能存在的高延迟对于某些延迟关键型应用程序来说是不可取的。因此,需要在靠近rrh的地方部署几个较小的本地BBU池,以限制延迟。这种RAN架构就是所谓的Fog RAN (F-RAN)。移动边缘计算(MEC)中心可以部署在F-RAN BBU池旁边或附近,以便及时处理。在本文中,我们解决了在F-RAN中,一组rrh和一组BBU池之间的BBU资源分配问题(一个改进的bin packing问题),使得只有最少数量的BBU池,即一个bin packing问题中的bin,会被打开来服务所有的rrh,从而节省能源消耗。此外,为了提高系统的稳定性和容错性,除了节能之外,该算法还可以实现BBU池之间的负载均衡。大量的仿真结果表明,所提出的高效BBU资源分配方案能够达到节能和负载均衡的目的。
Energy Efficient Fog RAN (F-RAN) with Flexible BBU Resource Assignment for Latency Aware Mobile Edge Computing (MEC) Services
Cloud RAN (C-RAN) where Base Band Units (BBUs) are collocated in a computing/processing center remotely away from their correspondent Remote Radio Heads (RRHs) for the efficient resource sharing is the prevailing RAN (Radio Access Network) design for next generation mobile networks. However, in C- RAN, the possible high latency from a RRH to the centralized Cloud BBU pool is not desirable for some latency critical applications. Thus, several local and smaller BBU pools are necessary to be deployed close to the RRHs to constrain the latency. This RAN architecture is so-call Fog RAN (F-RAN). A Mobile Edge Computing (MEC) center can be deployed beside or nearby a F-RAN BBU pool for timely processing. In this paper, we tackle the BBU resource allocation problem (a modified bin packing problem) between the set of RRHs and the set of BBU pools in F-RAN so that only a minimal number of BBU pools, i.e., the bins in a bin packing problem, will be turned on to serve all RRHs and so to save the energy consumption. Also, for the stability and fault tolerance, in addition to saving energy, the proposed algorithms also perform load balancing amid serving BBU pools. Our extensive simulation results show that the proposed scheme for energy efficient BBU resource allocation is able to achieve the goal of saving energy consumption and load balancing.