Mahdieh Ahmadi;Arash Moayyedi;Muhammad Sulaiman;Mohammad A. Salahuddin;Raouf Boutaba;Aladdin Saleh
{"title":"可通用的 5G RAN/MEC 分片和接入控制,实现可靠的网络运行","authors":"Mahdieh Ahmadi;Arash Moayyedi;Muhammad Sulaiman;Mohammad A. Salahuddin;Raouf Boutaba;Aladdin Saleh","doi":"10.1109/TNSM.2024.3437217","DOIUrl":null,"url":null,"abstract":"The virtualization and distribution of 5G Radio Access Network (RAN) functions across radio unit (RU), distributed unit (DU), and centralized unit (CU) in conjunction with multi-access edge computing (MEC) enable the creation of network slices tailored for various applications with distinct quality of service (QoS) demands. Nonetheless, given the dynamic nature of slice requests and limited network resources, optimizing long-term revenue for infrastructure providers (InPs) through real-time admission and embedding of slice requests poses a significant challenge. Prior works have employed Deep Reinforcement Learning (DRL) to address this issue, but these approaches require re-training with the slightest topology changes due to node/link failure or overlook the joint consideration of slice admission and embedding problems. This paper proposes a novel method, utilizing multi-agent DRL and Graph Attention Networks (GATs), to overcome these limitations. Specifically, we develop topology-independent admission and slicing agents that are scalable and generalizable across diverse metropolitan networks. Results demonstrate substantial revenue gains-up to 35.2% compared to heuristics and 19.5% when compared to other DRL-based methods. Moreover, our approach showcases robust performance in different network failure scenarios and substrate networks not seen during training without the need for re-training or re-tuning. Additionally, we bring interpretability by analyzing attention maps, which enables InPs to identify network bottlenecks, increase capacity at critical nodes, and gain a clear understanding of the model decision-making process.","PeriodicalId":13423,"journal":{"name":"IEEE Transactions on Network and Service Management","volume":"21 5","pages":"5384-5399"},"PeriodicalIF":4.7000,"publicationDate":"2024-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Generalizable 5G RAN/MEC Slicing and Admission Control for Reliable Network Operation\",\"authors\":\"Mahdieh Ahmadi;Arash Moayyedi;Muhammad Sulaiman;Mohammad A. Salahuddin;Raouf Boutaba;Aladdin Saleh\",\"doi\":\"10.1109/TNSM.2024.3437217\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The virtualization and distribution of 5G Radio Access Network (RAN) functions across radio unit (RU), distributed unit (DU), and centralized unit (CU) in conjunction with multi-access edge computing (MEC) enable the creation of network slices tailored for various applications with distinct quality of service (QoS) demands. Nonetheless, given the dynamic nature of slice requests and limited network resources, optimizing long-term revenue for infrastructure providers (InPs) through real-time admission and embedding of slice requests poses a significant challenge. Prior works have employed Deep Reinforcement Learning (DRL) to address this issue, but these approaches require re-training with the slightest topology changes due to node/link failure or overlook the joint consideration of slice admission and embedding problems. This paper proposes a novel method, utilizing multi-agent DRL and Graph Attention Networks (GATs), to overcome these limitations. Specifically, we develop topology-independent admission and slicing agents that are scalable and generalizable across diverse metropolitan networks. Results demonstrate substantial revenue gains-up to 35.2% compared to heuristics and 19.5% when compared to other DRL-based methods. Moreover, our approach showcases robust performance in different network failure scenarios and substrate networks not seen during training without the need for re-training or re-tuning. Additionally, we bring interpretability by analyzing attention maps, which enables InPs to identify network bottlenecks, increase capacity at critical nodes, and gain a clear understanding of the model decision-making process.\",\"PeriodicalId\":13423,\"journal\":{\"name\":\"IEEE Transactions on Network and Service Management\",\"volume\":\"21 5\",\"pages\":\"5384-5399\"},\"PeriodicalIF\":4.7000,\"publicationDate\":\"2024-08-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IEEE Transactions on Network and Service Management\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://ieeexplore.ieee.org/document/10620027/\",\"RegionNum\":2,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"COMPUTER SCIENCE, INFORMATION SYSTEMS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Network and Service Management","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10620027/","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
Generalizable 5G RAN/MEC Slicing and Admission Control for Reliable Network Operation
The virtualization and distribution of 5G Radio Access Network (RAN) functions across radio unit (RU), distributed unit (DU), and centralized unit (CU) in conjunction with multi-access edge computing (MEC) enable the creation of network slices tailored for various applications with distinct quality of service (QoS) demands. Nonetheless, given the dynamic nature of slice requests and limited network resources, optimizing long-term revenue for infrastructure providers (InPs) through real-time admission and embedding of slice requests poses a significant challenge. Prior works have employed Deep Reinforcement Learning (DRL) to address this issue, but these approaches require re-training with the slightest topology changes due to node/link failure or overlook the joint consideration of slice admission and embedding problems. This paper proposes a novel method, utilizing multi-agent DRL and Graph Attention Networks (GATs), to overcome these limitations. Specifically, we develop topology-independent admission and slicing agents that are scalable and generalizable across diverse metropolitan networks. Results demonstrate substantial revenue gains-up to 35.2% compared to heuristics and 19.5% when compared to other DRL-based methods. Moreover, our approach showcases robust performance in different network failure scenarios and substrate networks not seen during training without the need for re-training or re-tuning. Additionally, we bring interpretability by analyzing attention maps, which enables InPs to identify network bottlenecks, increase capacity at critical nodes, and gain a clear understanding of the model decision-making process.
期刊介绍:
IEEE Transactions on Network and Service Management will publish (online only) peerreviewed archival quality papers that advance the state-of-the-art and practical applications of network and service management. Theoretical research contributions (presenting new concepts and techniques) and applied contributions (reporting on experiences and experiments with actual systems) will be encouraged. These transactions will focus on the key technical issues related to: Management Models, Architectures and Frameworks; Service Provisioning, Reliability and Quality Assurance; Management Functions; Enabling Technologies; Information and Communication Models; Policies; Applications and Case Studies; Emerging Technologies and Standards.