5 March 2020 in IEEE Internet of Things Journal
This paper investigates dynamic multiplexing of enhanced Mobile BroadBand (eMBB) and Ultra-Reliable and Low Latency Communications (URLLC) on the same channel in 5G NR. Due to significant difference in transmission time scale, URLLC employs a preemptive puncturing technique to multiplex its traffic onto eMBB traffic for transmission. The optimization problem to solve is to minimize the adverse impact of such preemptive puncturing on eMBB users. We present DEMUX – a model-free deep reinforcement learning (DRL) based solution to this problem. The essence of DEMUX is to use deep function approximators (neural networks) to learn an optimal algorithm for determining preemption solution in each eMBB transmission time interval (TTI). Our novel contributions in the design of DEMUX include the first use of DRL method with large and continuous action domain for resource scheduling in NR, mechanism to ensure fast and stable learning convergence by exploiting intrinsic properties of the problem, and mechanism to obtain feasible preemption solution from unconstrained output of a neural network while minimizing loss of information. Experiment results show that DEMUX significantly outperforms state-of-the-art algorithms proposed in the 3GPP standards body and the literature.
22 March 2022 in IEEE/ACM Transactions on Networking
Age of Information (AoI) is an application layer performance metric that quantifies the freshness of information. This paper investigates scheduling problems at network edge when there is an AoI requirement for each source node, which we call Maximum AoI Threshold (MAT). Specifically, we want to determine whether or not a vector of MATs corresponding to the source nodes is schedulable, and if so, find a feasible scheduler for it. For a small network, we present an optimal procedure called Cyclic Scheduler Detection (CSD) that can determine the schedulability with absolute certainty. For a large network where CSD is not applicable, we present a novel low-complexity procedure, called Fictitious Polynomial Mapping (FPM), and prove that FPM can find a feasible scheduler for any MAT vector when the load is under $\ln 2$ . We use extensive numerical results to validate our theoretical results and show that the performance of FPM is significantly better than a state-of-the-art scheduling algorithm.
11 November 2019 in IEEE Transactions on Network Science and Engineering
A critical component in IoT infrastructure and applications is data collection at network edge. Recently, a new metric, called age of information (AoI), has become popular to quantify the freshness of information collected at network edge. AoI research is still in infancy and most efforts assume overly simplified models in their investigation, making their results far from useful when addressing practical problems in IoT applications. In this paper, we close this gap by considering more general models for AoI research that are more relevant in the real world. Specifically, we consider general and heterogeneous sampling behaviors among source nodes, varying sample size, and a transmission model with multiple transmission units in each time slot. Based on these generalizations, we develop new theoretical results (in terms of fundamental properties and performance bounds) and a new near-optimal low-complexity scheduling algorithm to minimize AoI. Our results make a major advance to existing AoI research and help bridge the gap between theory and practice.
25 January 2021 in IEEE Internet of Things Journal
The Age of Information (AoI) is a key metric to measure the freshness of information for IoT applications. Most of the existing analytical models for AoI are overly idealistic and do not capture state-of-the-art transmission technologies such as 5G as well as channel dynamics in both frequency and time domains. In this article, we present Kronos, a real-time 5G-compliant scheduler that minimizes AoI for IoT data collection. Kronos is designed to cope with highly dynamic channel conditions. Its main function is to perform RB allocation and to select the modulation and coding scheme for each source node based on channel conditions, with the objective of minimizing long-term AoI. To meet the stringent real-time requirement for 5G, we develop a GPU-based implementation of Kronos on commercial off-the-shelf Nvidia GPUs. Through extensive experimentation, we show that Kronos can find near-optimal solutions under submillisecond time scale. To the best of our knowledge, this is the first real-time AoI scheduler that is 5G compliant.
5 January 2023 in IEEE Journal on Selected Areas in Communications
Task offloading is a powerful tool in Mobile Edge Computing (MEC). However, in many practical scenarios, the number of required processing cycles of a task is unknown beforehand and only known until its completion. This poses a serious challenge in making offloading decisions as the number of processing cycles is a key parameter to determine whether a task’s deadline can be met. To cope with such processing uncertainty, we formulate a Chance-Constrained Program (CCP) that offers probabilistic guarantees to task deadlines. The goal is to minimize energy consumption for the users while meeting the probabilistic task deadlines. We assume that only the means and variances of the random processing cycles are available, without any knowledge of distribution functions. We employ a powerful tool called Exact Conic Reformulation (ECR) that reformulates probabilistic deadline constraints into deterministic ones. Subsequently, we design an online solution called EPD (Energy-minimized solution with Probabilistic Deadline guarantee) for periodic scheduling and schedule updates during run-time. We show that EPD can address the processing uncertainty with probabilistic deadline guarantees while minimizing the users’ energy consumption.
20 October 2021 in IEEE/ACM Transactions on Networking
5G NR is designed to operate over a broad range of frequency bands and support new applications with ultra-low latency requirements. To support its extremely diverse operating conditions, multiple OFDM numerologies have been defined in the 5G standards. Under these numerologies, it is necessary to perform scheduling with a time resolution of $\sim 100 \mathrm {\mu s}$ . This requirement poses a new challenge beyond existing LTE and cannot be satisfied by any existing LTE schedulers. In this paper, we present the design of GPF+, which is a GPU-based proportional fair (PF) scheduler with timing performance under $100 \mathrm {\mu s}$ . GPF+ is an improvement over our GPF in Huang et al. (2018). The key ideas include decomposing the original scheduling problem into a large number of small and independent sub-problems and selecting a subset of sub-problems from the most promising search space to fit into a GPU. By implementing GPF+ on an off-the-shelf NVIDIA Tesla V100 GPU, we show that GPF+ is able to achieve near-optimal PF performance with timing performance under $100 \mathrm {\mu s}$ . GPF+ represents the fastest GPU-based PF scheduler that can meet the new real-time requirement in 5G NR.