More Like this

1. Network Slicing: Market Mechanism and Competitive Equilibria

   https://doi.org/10.1109/INFOCOM53939.2023.10228856  

   Promponas, Panagiotis; Tassiulas, Leandros (May 2023, IEEE)
2. Auto-scaling edge cloud for network slicing

   https://doi.org/10.3389/fhpcp.2023.1167162  

   Mazied, EmadElDin A; Nikolopoulos, Dimitrios S; Hanafy, Yasser; Midkiff, Scott F (June 2023, Frontiers in High Performance Computing)

   This paper presents a study on resource control for autoscaling virtual radio access networks (RAN slices) in next-generation wireless networks. The dynamic instantiation and termination of on-demand RAN slices require efficient autoscaling of computational resources at the edge. Autoscaling involves vertical scaling (VS) and horizontal scaling (HS) to adapt resource allocation based on demand variations. However, the strict processing time requirements for RAN slices pose challenges when instantiating new containers. To address this issue, we propose removing resource limits from slice configuration and leveraging the decision-making capabilities of a centralized slicing controller. We introduce a resource control agent (RC) that determines resource limits as the number of computing resources packed into containers, aiming to minimize deployment costs while maintaining processing time below a threshold. The RAN slicing workload is modeled using the Low-Density Parity Check (LDPC) decoding algorithm, known for its stochastic demands. We formulate the problem as a variant of the stochastic bin packing problem (SBPP) to satisfy the random variations in radio workload. By employing chance-constrained programming, we approach the SBPP resource control (S-RC) problem. Our numerical evaluation demonstrates that S-RC maintains the processing time requirement with a higher probability compared to configuring RAN slices with predefined limits, although it introduces a 45% overall average cost overhead. 

   more » « less
3. Network Slicing in Heterogeneous Software-defined RANs

   https://doi.org/10.1109/INFOCOM41043.2020.9155532  

   Qin, Qiaofeng; Choi, Nakjung; Rahman, Muntasir Raihan; Thottan, Marina; Tassiulas, Leandros (July 2020, IEEE INFOCOM)

   null (Ed.)
4. Smart Network Slicing for Vehicular Fog-RANs

   Nassar, Almuthanna; Yilmaz, Yasin (December 2019, 2019 IEEE Global Conference on Signal and Information Processing (GlobalSIP))
5. Constrained Network Slicing Games: Achieving Service Guarantees and Network Efficiency

   https://doi.org/10.1109/TNET.2023.3262810  

   Zheng, Jiaxiao; Banchs, Albert; de Veciana, Gustavo (January 2023, IEEE/ACM Transactions on Networking)

   Abstract—Network slicing is a key capability for next gen- eration mobile networks. It enables infrastructure providers to cost effectively customize logical networks over a shared infrastructure. A critical component of network slicing is resource allocation, which needs to ensure that slices receive the resources needed to support their services while optimizing network effi- ciency. In this paper, we propose a novel approach to slice-based resource allocation named Guaranteed seRvice Efficient nETwork slicing (GREET). The underlying concept is to set up a con- strained resource allocation game, where (i) slices unilaterally optimize their allocations to best meet their (dynamic) customer loads, while (ii) constraints are imposed to guarantee that, if they wish so, slices receive a pre-agreed share of the network resources. The resulting game is a variation of the well-known Fisher mar- ket, where slices are provided a budget to contend for network resources (as in a traditional Fisher market), but (unlike a Fisher market) prices are constrained for some resources to ensure that the pre-agreed guarantees are met for each slice. In this way, GREET combines the advantages of a share-based approach (high efficiency by flexible sharing) and reservation-based ones (which provide guarantees by assigning a fixed amount of resources). We characterize the Nash equilibrium, best response dynamics, and propose a practical slice strategy with provable convergence properties. Extensive simulations exhibit substantial improvements over network slicing state-of-the-art benchmarks. 

   more » « less