{"title":"Cost-Efficient Resource Sharing in Ethernet-based 5G Mobile Fronthaul Networks","authors":"Yuehua Wu, M. Tornatore, B. Mukherjee","doi":"10.1109/ANTS.2018.8710075","DOIUrl":null,"url":null,"abstract":"In 5G, Mobile Fronthaul (MF) is referred to as the connection between Remote Radio Head (RRH) and BaseBand processing Unit (BBU) pool. To save cost while satisfying its rising bandwidth demand, we propose a MF Resource-Sharing (MFRS) scheme that allows to share (1) the capacity of the Ethernet network among MF traffic and background traffic and (2) the Baseband Processing Functions (BPFs) among various RRHs. To estimate the resource savings achievable with MFRS, we formulate a routing and BPF placement problem. The goal is to minimize cost in terms of required BPFs under the constraints of latency and network capacity. Simulation results show significant improvement in terms of number of supported RRHs and required BPFs compared to two baseline schemes.","PeriodicalId":273443,"journal":{"name":"2018 IEEE International Conference on Advanced Networks and Telecommunications Systems (ANTS)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 IEEE International Conference on Advanced Networks and Telecommunications Systems (ANTS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ANTS.2018.8710075","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
In 5G, Mobile Fronthaul (MF) is referred to as the connection between Remote Radio Head (RRH) and BaseBand processing Unit (BBU) pool. To save cost while satisfying its rising bandwidth demand, we propose a MF Resource-Sharing (MFRS) scheme that allows to share (1) the capacity of the Ethernet network among MF traffic and background traffic and (2) the Baseband Processing Functions (BPFs) among various RRHs. To estimate the resource savings achievable with MFRS, we formulate a routing and BPF placement problem. The goal is to minimize cost in terms of required BPFs under the constraints of latency and network capacity. Simulation results show significant improvement in terms of number of supported RRHs and required BPFs compared to two baseline schemes.