9,688 research outputs found
Slice-Aware Radio Resource Management for Future Mobile Networks
The concept of network slicing has been introduced in order to enable mobile networks to accommodate multiple heterogeneous use cases that are anticipated to be served within a single physical infrastructure. The slices are end-to-end virtual networks that share the resources of a physical network, spanning the core network (CN) and the radio access network (RAN). RAN slicing can be more challenging than CN slicing as the former deals with the distribution of radio resources, where the capacity is not constant over time and is hard to extend. The main challenge in RAN slicing is to simultaneously improve multiplexing gains while assuring enough isolation between slices, meaning one of the slices cannot negatively influence other slices. In this work, a flexible and configurable framework for RAN slicing is provided, where diverse requirements of slices are taken into account, and slice management algorithms adjust the control parameters of different radio resource management (RRM) mechanisms to satisfy the slices' service level agreements (SLAs). A new entity that translates the key performance indicator (KPI) targets of the SLAs to the control parameters is introduced and is called RAN slice orchestrator. Diverse algorithms governing this entity are introduced, which range from heuristics-based to model-free methods. Besides, a protection mechanism is constructed to prevent the negative influences of slices on each other's performances. The simulation-based analysis demonstrates the feasibility of slicing the RAN with multiplexing gains and slice isolation
Joint Network Slicing, Routing, and In-Network Computing for Energy-Efficient 6G
To address the evolving landscape of next-generation mobile networks,
characterized by an increasing number of connected users, surging traffic
demands, and the continuous emergence of new services, a novel communication
paradigm is essential. One promising candidate is the integration of network
slicing and in-network computing, offering resource isolation, deterministic
networking, enhanced resource efficiency, network expansion, and energy
conservation. Although prior research has explored resource allocation within
network slicing, routing, and in-network computing independently, a
comprehensive investigation into their joint approach has been lacking. This
paper tackles the joint problem of network slicing, path selection, and the
allocation of in-network and cloud computing resources, aiming to maximize the
number of accepted users while minimizing energy consumption. First, we
introduce a Mixed-Integer Linear Programming (MILP) formulation of the problem
and analyze its complexity, proving that the problem is NP-hard. Next, a Water
Filling-based Joint Slicing, Routing, and In-Network Computing (WF-JSRIN)
heuristic algorithm is proposed to solve it. Finally, a comparative analysis
was conducted among WF-JSRIN, a random allocation technique, and two optimal
approaches, namely Opt-IN (utilizing in-network computation) and Opt-C (solely
relying on cloud node resources). The results emphasize WF-JSRIN's efficiency
in delivering highly efficient near-optimal solutions with significantly
reduced execution times, solidifying its suitability for practical real-world
applications.Comment: Accepted at the 2024 IEEE Wireless Communications and Networking
Conference (WCNC 2024
5g new radio access and core network slicing for next-generation network services and management
In recent years, fifth-generation New Radio (5G NR) has attracted much attention owing to its potential in enhancing mobile access networks and enabling better support for heterogeneous services and applications. Network slicing has garnered substantial focus as it promises to offer a higher degree of isolation between subscribers with diverse quality-of-service requirements. Integrating 5G NR technologies, specifically the mmWave waveform and numerology schemes, with network slicing can unlock unparalleled performance so crucial to meeting the demands of high throughput and sub-millisecond latency constraints.
While conceding that optimizing next-generation access network performance is extremely important, it needs to be acknowledged that doing so for the core network is equally as significant. This is majorly due to the numerous core network functions that execute control tasks to establish end-to-end user sessions and route access network traffic. Consequently, the core network has a significant impact on the quality-of-experience of the radio access network customers. Currently, the core network lacks true end-to-end slicing isolation and reliability, and thus there is a dire need to examine more stringent configurations that offer the required levels of slicing isolation for the envisioned networking landscape.
Considering the factors mentioned above, a sequential approach is adopted starting with the radio access network and progressing to the core network. First, to maximize the downlink average spectral efficiency of an enhanced mobile broadband slice in a time division duplex radio access network while meeting the quality-of-service requirements, an optimization problem is formulated to determine the duplex ratio, numerology scheme, power, and bandwidth allocation. Subsequently, to minimize the uplink transmission power of an ultra-reliable low latency communications slice while satisfying the quality-of-service constraints, a second optimization problem is formulated to determine the above-mentioned parameters and allocations. Because 5G NR supports dual-band transmissions, it also facilitates the usage of different numerology schemes and duplex ratios across bands simultaneously. Both problems, being mixed-integer non-linear programming problems, are relaxed into their respective convex equivalents and subsequently solved.
Next, shifting attention to aerial networks, a priority-based 5G NR unmanned aerial vehicle network (UAV) is considered where the enhanced mobile broadband and ultra-reliable low latency communications services are considered as best-effort and high-priority slices, correspondingly. Following the application of a band access policy, an optimization problem is formulated. The goal is to minimize the downlink quality-of-service gap for the best-effort service, while still meeting the quality-of-service constraints of the high-priority service. This involves the allocation of transmission power and assignment of resource blocks. Given that this problem is a mixed-integer nonlinear programming problem, a low-complexity algorithm, PREDICT, i.e., PRiority BasED Resource AllocatIon in Adaptive SliCed NeTwork, which considers the channel quality on each individual resource block over both bands, is designed to solve the problem with a more accurate accounting for high-frequency channel conditions.
Transitioning to minimizing the operational latency of the core network, an integer linear programming problem is formulated to instantiate network function instances, assign them to core network servers, assign slices and users to network function instances, and allocate computational resources while maintaining virtual network function isolation and physical separation of the core network control and user planes. The actor-critic method is employed to solve this problem for three proposed core network operation configurations, each offering an added degree of reliability and isolation over the default configuration that is currently standardized by the 3GPP.
Looking ahead to potential future research directions, optimizing carrier aggregation-based resource allocation across triple-band sliced access networks emerges as a promising avenue. Additionally, the integration of coordinated multi-point techniques with carrier aggregation in multi-UAV NR aerial networks is especially challenging. The introduction of added carrier frequencies and channel bandwidths, while enhancing flexibility and robustness, complicates band-slice assignments and user-UAV associations. Another layer of intriguing yet complex research involves optimizing handovers in high-mobility UAV networks, where both users and UAVs are mobile. UAV trajectory planning, which is already NP-hard even in static-user scenarios, becomes even more intricate to obtain optimal solutions in high-mobility user cases
Genetic Algorithm-based Mapper to Support Multiple Concurrent Users on Wireless Testbeds
Communication and networking research introduces new protocols and standards
with an increasing number of researchers relying on real experiments rather
than simulations to evaluate the performance of their new protocols. A number
of testbeds are currently available for this purpose and a growing number of
users are requesting access to those testbeds. This motivates the need for
better utilization of the testbeds by allowing concurrent experimentations. In
this work, we introduce a novel mapping algorithm that aims to maximize
wireless testbed utilization using frequency slicing of the spectrum resources.
The mapper employs genetic algorithm to find the best combination of requests
that can be served concurrently, after getting all possible mappings of each
request via an induced sub-graph isomorphism stage. The proposed mapper is
tested on grid testbeds and randomly generated topologies. The solution of our
mapper is compared to the optimal one, obtained through a brute-force search,
and was able to serve the same number of requests in 82.96% of testing
scenarios. Furthermore, we show the effect of the careful design of testbed
topology on enhancing the testbed utilization by applying our mapper on a
carefully positioned 8-nodes testbed. In addition, our proposed approach for
testbed slicing and requests mapping has shown an improved performance in terms
of total served requests, about five folds, compared to the simple allocation
policy with no slicing.Comment: IEEE Wireless Communications and Networking Conference (WCNC) 201
- …