2017 · 191 citations · 13 references
ComputingDecision SciencesInformation TechnologyComputer NetworksMarkov Decision ProcessesOptimizationMobile NetworkingMobile NetworksNetwork OptimizationNetwork Revenue ManagementResource ProvisioningResource Scheduling5G NetworksNetwork AllocationNetwork Resource AllocationNetwork ResourcesNetwork SlicingSemi-markov Decision ProcessesSemi-markov ModellingService Guarantees
Future 5G networks will transform the mobile ecosystem by enabling network slicing, which allows independent logical networks and opens the market to infrastructure providers and tenant operators. The study seeks to develop resource‑allocation algorithms that account for these new market participants. We propose an analytical admissibility model, a Semi‑Markov Decision Process analysis for revenue optimization, and a Q‑learning based adaptive algorithm that approaches optimal performance.
In addition to providing substantial performance enhancements, future 5G networks will also change the mobile network ecosystem. Building on the network slicing concept, 5G allows to "slice" the network infrastructure into separate logical networks that may be operated independently and targeted at specific services. This opens the market to new players: the infrastructure provider, which is the owner of the infrastructure, and the tenants, which may acquire a network slice from the infrastructure provider to deliver a specific service to their customers. In this new context, we need new algorithms for the allocation of network resources that consider these new players. In this paper, we address this issue by designing an algorithm for the admission and allocation of network slices requests that (i) maximises the infrastructure provider's revenue and (ii) ensures that the service guarantees provided to tenants are satisfied. Our key contributions include: (i) an analytical model for the admissibility region of a network slicing-capable 5G Network, (ii) the analysis of the system (modelled as a Semi-Markov Decision Process) and the optimisation of the infrastructure provider's revenue, and (iii) the design of an adaptive algorithm (based on Q-learning) that achieves close to optimal performance.
13
Christopher J. Watkins, Peter Dayan · Machine Learning · 1992 · 9K citations · Full text
Richard Bellman · Indiana University Mathematics Journal · 1957 · 2.4K citations
Dynamic Programming and Markov Processes.
H. Kaufman, Ronald A. Howard · American Mathematical Monthly · 1961 · 648 citations