52 research outputs found

    Side Channel Attack-Aware Resource Allocation for URLLC and eMBB Slices in 5G RAN

    Get PDF
    Network slicing is a key enabling technology to realize the provisioning of customized services in 5G paradigm. Due to logical isolation instead of physical isolation, network slicing is facing a series of security issues. Side Channel Attack (SCA) is a typical attack for slices that share resources in the same hardware. Considering the risk of SCA among slices, this paper investigates how to effectively allocate heterogeneous resources for the slices under their different security requirements. Then, a SCA-aware Resource Allocation (SCA-RA) algorithm is proposed for Ultra-reliable and Low-latency Communications (URLLC) and Enhanced Mobile Broadband (eMBB) slices in 5G RAN. The objective is to maximize the number of slices accommodated in 5G RAN. With dynamic slice requests, simulation is conducted to evaluate the performance of the proposed algorithm in two different network scenarios. Simulation results indicate that compared with benchmark, SCA-RA algorithm can effectively reduce blocking probability of slice requests. In addition, the usage of IT and transport resources is also optimized

    Wireless access network optimization for 5G

    Get PDF

    Resource management with adaptive capacity in C-RAN

    Get PDF
    This work was supported in part by the Spanish ministry of science through the projectRTI2018-099880-B-C32, with ERFD funds, and the Grant FPI-UPC provided by theUPC. It has been done under COST CA15104 IRACON EU project.Efficient computational resource management in 5G Cloud Radio Access Network (CRAN) environments is a challenging problem because it has to account simultaneously for throughput, latency, power efficiency, and optimization tradeoffs. This work proposes the use of a modified and improved version of the realistic Vienna Scenario that was defined in COST action IC1004, to test two different scale C-RAN deployments. First, a large-scale analysis with 628 Macro-cells (Mcells) and 221 Small-cells (Scells) is used to test different algorithms oriented to optimize the network deployment by minimizing delays, balancing the load among the Base Band Unit (BBU) pools, or clustering the Remote Radio Heads (RRH) efficiently to maximize the multiplexing gain. After planning, real-time resource allocation strategies with Quality of Service (QoS) constraints should be optimized as well. To do so, a realistic small-scale scenario for the metropolitan area is defined by modeling the individual time-variant traffic patterns of 7000 users (UEs) connected to different services. The distribution of resources among UEs and BBUs is optimized by algorithms, based on a realistic calculation of the UEs Signal to Interference and Noise Ratios (SINRs), that account for the required computational capacity per cell, the QoS constraints and the service priorities. However, the assumption of a fixed computational capacity at the BBU pools may result in underutilized or oversubscribed resources, thus affecting the overall QoS. As resources are virtualized at the BBU pools, they could be dynamically instantiated according to the required computational capacity (RCC). For this reason, a new strategy for Dynamic Resource Management with Adaptive Computational capacity (DRM-AC) using machine learning (ML) techniques is proposed. Three ML algorithms have been tested to select the best predicting approach: support vector machine (SVM), time-delay neural network (TDNN), and long short-term memory (LSTM). DRM-AC reduces the average of unused resources by 96 %, but there is still QoS degradation when RCC is higher than the predicted computational capacity (PCC). For this reason, two new strategies are proposed and tested: DRM-AC with pre-filtering (DRM-AC-PF) and DRM-AC with error shifting (DRM-AC-ES), reducing the average of unsatisfied resources by 99.9 % and 98 % compared to the DRM-AC, respectively

    Traffic Steering for eMBB and uRLLC Coexistence in Open Radio Access Networks

    Get PDF
    Existing radio access network (RAN) architectures are lack of sufficient openness, flexibility, and intelligence to meet the diverse demands of emerging services in beyond 5G and 6G wireless networks, including enhanced mobile broadband (eMBB) and ultra-reliable and low-latency (uRLLC). Open RAN (ORAN) is a promising paradigm that allows building a virtualized and intelligent architecture. In this paper, we focus on traffic steering (TS) scheme based on multi-connectivity (MC) and network slicing (NS) techniques to efficiently allocate heterogeneous network resources in “NextG” cellular networks. We formulate the RAN resource allocation problem to simultaneously maximize the weighted sum eMBB throughput and minimize the worst-user uRLLC latency subject to QoS requirements, and orthogonality, power, and limited fronthaul constraints. Since the formulated problem is categorized as a mixed integer

    Evaluation of a multi-cell and multi-tenant capacity sharing solution under heterogeneous traffic distributions

    Get PDF
    One of the key features of the 5G architecture is network slicing, which allows the simultaneous support of diverse service types with heterogeneous requirements over a common network infrastructure. In order to support this feature in the Radio Access Network (RAN), it is required to have capacity sharing mechanisms that distribute the available capacity in each cell among the existing RAN slices while satisfying their requirements and efficiently using the available resources. Deep Reinforcement Learning (DRL) techniques are good candidates to deal with the complexity of capacity sharing in multi-cell scenarios where the traffic in the different cells can be heterogeneously distributed in the time and space domains. In this paper, a multi-agent reinforcement learning-based solution for capacity sharing in multi-cell scenarios is discussed and assessed under heterogeneous traffic conditions. Results show the capability of the solution to satisfy the requirements of the RAN slices while using the resources in the different cells efficiently.This work has been supported by the Spanish Research Council and FEDER funds under SONAR 5G grant (ref.TEC2017-82651-R), by the European Commission’s Horizon 2020 5G-CLARITY project under grant agreement 871428 and by the Secretariat for Universities and Research of the Ministry of Business and Knowledge of the Government of Catalonia under grant 2020FI_B2 00075.Peer ReviewedPostprint (author's final draft

    A Survey of Scheduling in 5G URLLC and Outlook for Emerging 6G Systems

    Get PDF
    Future wireless communication is expected to be a paradigm shift from three basic service requirements of 5th Generation (5G) including enhanced Mobile Broadband (eMBB), Ultra Reliable and Low Latency communication (URLLC) and the massive Machine Type Communication (mMTC). Integration of the three heterogeneous services into a single system is a challenging task. The integration includes several design issues including scheduling network resources with various services. Specially, scheduling the URLLC packets with eMBB and mMTC packets need more attention as it is a promising service of 5G and beyond systems. It needs to meet stringent Quality of Service (QoS) requirements and is used in time-critical applications. Thus through understanding of packet scheduling issues in existing system and potential future challenges is necessary. This paper surveys the potential works that addresses the packet scheduling algorithms for 5G and beyond systems in recent years. It provides state of the art review covering three main perspectives such as decentralised, centralised and joint scheduling techniques. The conventional decentralised algorithms are discussed first followed by the centralised algorithms with specific focus on single and multi-connected network perspective. Joint scheduling algorithms are also discussed in details. In order to provide an in-depth understanding of the key scheduling approaches, the performances of some prominent scheduling algorithms are evaluated and analysed. This paper also provides an insight into the potential challenges and future research directions from the scheduling perspective

    Intelligent resource management for eMBB and URLLC in 5G and beyond wireless networks

    Get PDF
    In the era of 5G and beyond wireless networks, the simultaneous support of enhanced Mobile Broadband (eMBB) and Ultra-Reliable Low Latency Communications (URLLC) poses significant challenges in managing radio resources efficiently. By leveraging the puncturing technique, we propose an intelligent resource management framework for meeting the strict latency and reliability requirement of URLLC services and the high data rate for eMBB services. In particular, a semi-supervised learning and deep reinforcement learning (DRL) based architecture is proposed to manage the resources intelligently. We decompose the optimization problem into two subproblems: 1) resource block allocation (RBA) strategy for eMBB slice, and 2) URLLC scheduling. Through extensive simulations and performance evaluations, we demonstrate the effectiveness of the proposed technique in optimizing resource utilization, minimizing latency for URLLC users, and maximizing the throughput for eMBB services. Simulation findings demonstrate that the proposed methodology can ensure the URLLC reliability requirements while maintaining higher average sum rate for eMBB and higher convergence rate. The proposed framework paves the way for the efficient coexistence of diverse services, enabling wireless network operators to optimize resource allocation, improve user experience, and meet the specific requirements of eMBB and URLLC applications

    A Comprehensive Survey of the Tactile Internet: State of the art and Research Directions

    Get PDF
    The Internet has made several giant leaps over the years, from a fixed to a mobile Internet, then to the Internet of Things, and now to a Tactile Internet. The Tactile Internet goes far beyond data, audio and video delivery over fixed and mobile networks, and even beyond allowing communication and collaboration among things. It is expected to enable haptic communication and allow skill set delivery over networks. Some examples of potential applications are tele-surgery, vehicle fleets, augmented reality and industrial process automation. Several papers already cover many of the Tactile Internet-related concepts and technologies, such as haptic codecs, applications, and supporting technologies. However, none of them offers a comprehensive survey of the Tactile Internet, including its architectures and algorithms. Furthermore, none of them provides a systematic and critical review of the existing solutions. To address these lacunae, we provide a comprehensive survey of the architectures and algorithms proposed to date for the Tactile Internet. In addition, we critically review them using a well-defined set of requirements and discuss some of the lessons learned as well as the most promising research directions

    Statistical Multiplexing and Traffic Shaping Games for Network Slicing

    Full text link
    Next generation wireless architectures are expected to enable slices of shared wireless infrastructure which are customized to specific mobile operators/services. Given infrastructure costs and the stochastic nature of mobile services' spatial loads, it is highly desirable to achieve efficient statistical multiplexing amongst such slices. We study a simple dynamic resource sharing policy which allocates a 'share' of a pool of (distributed) resources to each slice-Share Constrained Proportionally Fair (SCPF). We give a characterization of SCPF's performance gains over static slicing and general processor sharing. We show that higher gains are obtained when a slice's spatial load is more 'imbalanced' than, and/or 'orthogonal' to, the aggregate network load, and that the overall gain across slices is positive. We then address the associated dimensioning problem. Under SCPF, traditional network dimensioning translates to a coupled share dimensioning problem, which characterizes the existence of a feasible share allocation given slices' expected loads and performance requirements. We provide a solution to robust share dimensioning for SCPF-based network slicing. Slices may wish to unilaterally manage their users' performance via admission control which maximizes their carried loads subject to performance requirements. We show this can be modeled as a 'traffic shaping' game with an achievable Nash equilibrium. Under high loads, the equilibrium is explicitly characterized, as are the gains in the carried load under SCPF vs. static slicing. Detailed simulations of a wireless infrastructure supporting multiple slices with heterogeneous mobile loads show the fidelity of our models and range of validity of our high load equilibrium analysis
    • …
    corecore