Abstract
As a key technology of 5G, network slicing can meet the diverse needs of users. In this research, we study network slicing resource allocation in radio access networks (RAN) by case-based reasoning (CBR). We treat the user distribution scenario as a case and stored a massive number of cases in the library. CBR is used to match a new case with cases in the case library to find similar cases and determine the best slice bandwidth ratio of the new case based on these similar cases. In the matching process, the k-nearest neighbors (KNN) algorithm is used to retrieve similar cases, the nearest k neighbors being determined by considering sparsity reduction and locality-preserving projections. Although only an initial study, the results confirm that the proposed architecture is capable of allocating resources efficiently in terms of prediction error and computational cost.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
