Flexible Association and Placement for Open-RAN. Hojeij, H., Ricardo, G. I., Sharara, M., Hoteit, S., Vèque, V., & Secci, S. In IEEE INFOCOM 2024 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS), pages 1–6, Vancouver, BC, Canada, May, 2024. IEEE. ![Flexible Association and Placement for Open-RAN [link]](https://bibbase.org/img/filetypes/link.svg "link")
Paper doi abstract bibtex In modern Open RAN architectures, the classic gNB radio protocol stack is disaggregated and implemented in different virtualized components, the Centralized Unit (CU), the Distributed Unit (DU), and the Radio Unit (RU). Each of these units is deployed throughout the cloud-enabled RAN infrastructure in order to achieve users’ required Quality of Service (QoS). Within this framework, our study is dedicated to maximizing the admission of User Equipments (UEs) into the system while ensuring their specific QoS needs. We focus on two primary tasks: (i) establishing an association between UEs and RUs and (ii) placing CUs and DUs across the network’s cloud hosts. We initially address these tasks by formulating the joint association-placement optimization problem, subject to the system’s available resources and QoS-related constraints. Although it is an NP-Hard problem, we discuss how we can frame it into an Integer Linear Programming (ILP) model. Then, we propose an approximation algorithm based on the decomposition of the original ILP model. We show through exhaustive simulations that our proposed ILP model provides higher admissibility levels than other baseline models. Moreover, it significantly minimizes the deployment costs and increases the overall fairness. Finally, we remark that our decomposition algorithm presents a short optimality gap in practice, with up to 6% less admissions, while reducing the solution time by up to 98%.
@inproceedings{hojeij_flexible_2024,
address = {Vancouver, BC, Canada},
title = {Flexible {Association} and {Placement} for {Open}-{RAN}},
copyright = {https://doi.org/10.15223/policy-029},
isbn = {9798350384475},
url = {https://ieeexplore.ieee.org/document/10620754/},
doi = {10.1109/INFOCOMWKSHPS61880.2024.10620754},
abstract = {In modern Open RAN architectures, the classic gNB radio protocol stack is disaggregated and implemented in different virtualized components, the Centralized Unit (CU), the Distributed Unit (DU), and the Radio Unit (RU). Each of these units is deployed throughout the cloud-enabled RAN infrastructure in order to achieve users’ required Quality of Service (QoS). Within this framework, our study is dedicated to maximizing the admission of User Equipments (UEs) into the system while ensuring their specific QoS needs. We focus on two primary tasks: (i) establishing an association between UEs and RUs and (ii) placing CUs and DUs across the network’s cloud hosts. We initially address these tasks by formulating the joint association-placement optimization problem, subject to the system’s available resources and QoS-related constraints. Although it is an NP-Hard problem, we discuss how we can frame it into an Integer Linear Programming (ILP) model. Then, we propose an approximation algorithm based on the decomposition of the original ILP model. We show through exhaustive simulations that our proposed ILP model provides higher admissibility levels than other baseline models. Moreover, it significantly minimizes the deployment costs and increases the overall fairness. Finally, we remark that our decomposition algorithm presents a short optimality gap in practice, with up to 6\% less admissions, while reducing the solution time by up to 98\%.},
language = {en},
urldate = {2024-08-17},
booktitle = {{IEEE} {INFOCOM} 2024 - {IEEE} {Conference} on {Computer} {Communications} {Workshops} ({INFOCOM} {WKSHPS})},
publisher = {IEEE},
author = {Hojeij, Hiba and Ricardo, Guilherme Iecker and Sharara, Mahdi and Hoteit, Sahar and Vèque, Véronique and Secci, Stefano},
month = may,
year = {2024},
pages = {1--6},
}
Downloads: 0
{"_id":"JYrMpmSgA8ThxDmqc","bibbaseid":"hojeij-ricardo-sharara-hoteit-vque-secci-flexibleassociationandplacementforopenran-2024","author_short":["Hojeij, H.","Ricardo, G. I.","Sharara, M.","Hoteit, S.","Vèque, V.","Secci, S."],"bibdata":{"bibtype":"inproceedings","type":"inproceedings","address":"Vancouver, BC, Canada","title":"Flexible Association and Placement for Open-RAN","copyright":"https://doi.org/10.15223/policy-029","isbn":"9798350384475","url":"https://ieeexplore.ieee.org/document/10620754/","doi":"10.1109/INFOCOMWKSHPS61880.2024.10620754","abstract":"In modern Open RAN architectures, the classic gNB radio protocol stack is disaggregated and implemented in different virtualized components, the Centralized Unit (CU), the Distributed Unit (DU), and the Radio Unit (RU). Each of these units is deployed throughout the cloud-enabled RAN infrastructure in order to achieve users’ required Quality of Service (QoS). Within this framework, our study is dedicated to maximizing the admission of User Equipments (UEs) into the system while ensuring their specific QoS needs. We focus on two primary tasks: (i) establishing an association between UEs and RUs and (ii) placing CUs and DUs across the network’s cloud hosts. We initially address these tasks by formulating the joint association-placement optimization problem, subject to the system’s available resources and QoS-related constraints. Although it is an NP-Hard problem, we discuss how we can frame it into an Integer Linear Programming (ILP) model. Then, we propose an approximation algorithm based on the decomposition of the original ILP model. We show through exhaustive simulations that our proposed ILP model provides higher admissibility levels than other baseline models. Moreover, it significantly minimizes the deployment costs and increases the overall fairness. Finally, we remark that our decomposition algorithm presents a short optimality gap in practice, with up to 6% less admissions, while reducing the solution time by up to 98%.","language":"en","urldate":"2024-08-17","booktitle":"IEEE INFOCOM 2024 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","publisher":"IEEE","author":[{"propositions":[],"lastnames":["Hojeij"],"firstnames":["Hiba"],"suffixes":[]},{"propositions":[],"lastnames":["Ricardo"],"firstnames":["Guilherme","Iecker"],"suffixes":[]},{"propositions":[],"lastnames":["Sharara"],"firstnames":["Mahdi"],"suffixes":[]},{"propositions":[],"lastnames":["Hoteit"],"firstnames":["Sahar"],"suffixes":[]},{"propositions":[],"lastnames":["Vèque"],"firstnames":["Véronique"],"suffixes":[]},{"propositions":[],"lastnames":["Secci"],"firstnames":["Stefano"],"suffixes":[]}],"month":"May","year":"2024","pages":"1–6","bibtex":"@inproceedings{hojeij_flexible_2024,\n\taddress = {Vancouver, BC, Canada},\n\ttitle = {Flexible {Association} and {Placement} for {Open}-{RAN}},\n\tcopyright = {https://doi.org/10.15223/policy-029},\n\tisbn = {9798350384475},\n\turl = {https://ieeexplore.ieee.org/document/10620754/},\n\tdoi = {10.1109/INFOCOMWKSHPS61880.2024.10620754},\n\tabstract = {In modern Open RAN architectures, the classic gNB radio protocol stack is disaggregated and implemented in different virtualized components, the Centralized Unit (CU), the Distributed Unit (DU), and the Radio Unit (RU). Each of these units is deployed throughout the cloud-enabled RAN infrastructure in order to achieve users’ required Quality of Service (QoS). Within this framework, our study is dedicated to maximizing the admission of User Equipments (UEs) into the system while ensuring their specific QoS needs. We focus on two primary tasks: (i) establishing an association between UEs and RUs and (ii) placing CUs and DUs across the network’s cloud hosts. We initially address these tasks by formulating the joint association-placement optimization problem, subject to the system’s available resources and QoS-related constraints. Although it is an NP-Hard problem, we discuss how we can frame it into an Integer Linear Programming (ILP) model. Then, we propose an approximation algorithm based on the decomposition of the original ILP model. We show through exhaustive simulations that our proposed ILP model provides higher admissibility levels than other baseline models. Moreover, it significantly minimizes the deployment costs and increases the overall fairness. Finally, we remark that our decomposition algorithm presents a short optimality gap in practice, with up to 6\\% less admissions, while reducing the solution time by up to 98\\%.},\n\tlanguage = {en},\n\turldate = {2024-08-17},\n\tbooktitle = {{IEEE} {INFOCOM} 2024 - {IEEE} {Conference} on {Computer} {Communications} {Workshops} ({INFOCOM} {WKSHPS})},\n\tpublisher = {IEEE},\n\tauthor = {Hojeij, Hiba and Ricardo, Guilherme Iecker and Sharara, Mahdi and Hoteit, Sahar and Vèque, Véronique and Secci, Stefano},\n\tmonth = may,\n\tyear = {2024},\n\tpages = {1--6},\n}\n\n\n\n\n\n\n\n","author_short":["Hojeij, H.","Ricardo, G. I.","Sharara, M.","Hoteit, S.","Vèque, V.","Secci, S."],"key":"hojeij_flexible_2024","id":"hojeij_flexible_2024","bibbaseid":"hojeij-ricardo-sharara-hoteit-vque-secci-flexibleassociationandplacementforopenran-2024","role":"author","urls":{"Paper":"https://ieeexplore.ieee.org/document/10620754/"},"metadata":{"authorlinks":{}},"downloads":0,"html":""},"bibtype":"inproceedings","biburl":"https://bibbase.org/zotero/wmarshedi","dataSources":["6oX56jrCWfxNpSJQs"],"keywords":[],"search_terms":["flexible","association","placement","open","ran","hojeij","ricardo","sharara","hoteit","vèque","secci"],"title":"Flexible Association and Placement for Open-RAN","year":2024}