Towards Fast-Convergence, Low-Delay and Low-Complexity Network Optimization

Distributed network optimization has been studied for well over a decade. However, we still do not have a good idea of how to design schemes that can simultaneously provide good performance across the dimensions of utility optimality, convergence speed, and delay. To address these challenges, in this paper, we propose a new algorithmic framework with all these metrics approaching optimality. The salient features of our new algorithm are three-fold: (i) fast convergence: it converges with only $O(\log(1/\epsilon))$ iterations that is the fastest speed among all the existing algorithms; (ii) low delay: it guarantees optimal utility with finite queue length; (iii) simple implementation: the control variables of this algorithm are based on virtual queues that do not require maintaining per-flow information. The new technique builds on a kind of inexact Uzawa method in the Alternating Directional Method of Multiplier, and provides a new theoretical path to prove global and linear convergence rate of such a method without requiring the full rank assumption of the constraint matrix

Learning Aided Optimization for Energy Harvesting Devices with Outdated State Information

This paper considers utility optimal power control for energy harvesting wireless devices with a finite capacity battery. The distribution information of the underlying wireless environment and harvestable energy is unknown and only outdated system state information is known at the device controller. This scenario shares similarity with Lyapunov opportunistic optimization and online learning but is different from both. By a novel combination of Zinkevich's online gradient learning technique and the drift-plus-penalty technique from Lyapunov opportunistic optimization, this paper proposes a learning-aided algorithm that achieves utility within $O(\epsilon)$ of the optimal, for any desired $\epsilon>0$, by using a battery with an $O(1/\epsilon)$ capacity. The proposed algorithm has low complexity and makes power investment decisions based on system history, without requiring knowledge of the system state or its probability distribution.Comment: This version extends v1 (our INFOCOM 2018 paper): (1) add a new section (Section V) to study the case where utility functions are non-i.i.d. arbitrarily varying (2) add more simulation experiments. The current version is published in IEEE/ACM Transactions on Networkin

Online Decision Making in Networked Marketplaces

Modern, technologically-enabled markets are disrupting many industry sectors, including transportation, labor, lodging, dating services and others. While the system operator is able to collect data and deploy various control levers, these systems are highly complex, marked by a large number of interacting self-interested agents, uncertainty about the future and imperfect demand predictions. There remain major challenges in optimizing these marketplaces. In this dissertation, I describe work designing novel algorithms and performing theoretical analysis of networked systems, including those that arise in marketplaces. I demonstrate how to use tools from applied probability, modern optimization, and economics to develop methodologies for online decision making in contexts such as queueing control, revenue management, and running a matching platform. The first part of the dissertation designs novel algorithms for dynamic assignment and revenue management. The work considers networked systems where agents or tasks arrive over time, which is broadly relevant to service platforms with heterogeneous services, for instance shared transportation systems. Firstly, we propose a near optimal ``mirror backpressure'' control methodology for joint entry/assignment/pricing control in a network where there are a fixed number of supply units (vehicles), and demands with different origin and destination nodes arrive over time. The MBP policy does not need demand arrival rate predictions at all, and we prove guarantees of near optimal performance over a finite horizon. Secondly, we study a special case of the network control problem where the geographical imbalances in demand are small enough such that, ignoring stochasticity, they can be corrected using assignment control alone. The objective is to minimize the fraction of customers who are ``lost'' (not served) because there is no vehicle at a nearby location when the customer arrives. We show that for this setting we can achieve a refined notion of optimality, i.e., the large deviations optimality. The second part of the dissertation analyzes equilibria in matching markets under different mechanisms. Firstly, we study the Gale-Shalpley ``deferred acceptance'' algorithm, which has been successfully adopted in contexts such as school choice and resident matching programs. Our research question is, ``Which Gale-Shapley matching markets exhibit a short-side advantage?'' I.e., in which markets does being on the short side of the market allow agents to obtain better match partners relative to a similar ``balanced'' market with equal numbers of agents on the two sides? We address this problem by looking at the ``random matching market'' model where each agent considers only a subset of potential partners on the other side, and sharply characterize the resulting (nearly unique) stable matching, overcoming significant technical challenges. Secondly, we study the waiting-list mechanism, which is commonly used in kidney assignment, public housing allocation, and beyond. We show that the waiting-list mechanism is near-optimal in terms of allocative efficiency for general systems with an arbitrary number of agent types and item types, and obtain tight bound on the efficiency loss. Comparing to existing works which could only analyze very simple systems, we tackle the general case by taking a completely different approach and establishing a novel connection with stochastic gradient descent

Timely-Throughput Optimal Scheduling with Prediction

Motivated by the increasing importance of providing delay-guaranteed services in general computing and communication systems, and the recent wide adoption of learning and prediction in network control, in this work, we consider a general stochastic single-server multi-user system and investigate the fundamental benefit of predictive scheduling in improving timely-throughput, being the rate of packets that are delivered to destinations before their deadlines. By adopting an error rate-based prediction model, we first derive a Markov decision process (MDP) solution to optimize the timely-throughput objective subject to an average resource consumption constraint. Based on a packet-level decomposition of the MDP, we explicitly characterize the optimal scheduling policy and rigorously quantify the timely-throughput improvement due to predictive-service, which scales as $\Theta(p\left[C_{1}\frac{(a-a_{\max}q)}{p-q}\rho^{\tau}+C_{2}(1-\frac{1}{p})\right](1-\rho^{D}))$, where $a, a_{\max}, \rho\in(0, 1), C_1>0, C_2\ge0$ are constants, $p$ is the true-positive rate in prediction, $q$ is the false-negative rate, $\tau$ is the packet deadline and $D$ is the prediction window size. We also conduct extensive simulations to validate our theoretical findings. Our results provide novel insights into how prediction and system parameters impact performance and provide useful guidelines for designing predictive low-latency control algorithms.Comment: 14 pages, 7 figure

Resource Management and Backhaul Routing in Millimeter-Wave IAB Networks Using Deep Reinforcement Learning

Thesis (PhD (Electronic Engineering))--University of Pretoria, 2023..The increased densification of wireless networks has led to the development of integrated access and backhaul (IAB) networks. In this thesis, deep reinforcement learning was applied to solve resource management and backhaul routing problems in millimeter-wave IAB networks. In the research work, a resource management solution that aims to avoid congestion for access users in an IAB network was proposed and implemented. The proposed solution applies deep reinforcement learning to learn an optimized policy that aims to achieve effective resource allocation whilst minimizing congestion and satisfying the user requirements. In addition, a deep reinforcement learning-based backhaul adaptation strategy that leverages a recursive discrete choice model was implemented in simulation. Simulation results where the proposed algorithms were compared with two baseline methods showed that the proposed scheme provides better throughput and delay performance.Sentech Chair in Broadband Wireless Multimedia Communications.Electrical, Electronic and Computer EngineeringPhD (Electronic Engineering)Unrestricte

Resource management for cost-effective cloud and edge systems

With the booming of Internet-based and cloud/edge computing applications and services,datacenters hosting these services have become ubiquitous in every sector of our economy which leads to tremendous research opportunities. Specifically, in cloud computing, all data are gathered and processed in centralized cloud datacenters whereas in edge computing, the frontier of data and services is pushed away from the centralized cloud to the edge of the network. By fusing edge computing with cloud computing, the Internet companies and end users can benefit from their respective merits, abundant computation and storage resources from cloud computing, and the data-gathering potential of edge computing. However, resource management in cloud and edge systems is complicated and challenging due to the large scale of cloud datacenters, diverse interconnected resource types, unpredictable generated workloads, and a range of performance objectives. It necessitates the systematic modeling of cloud and edge systems to achieve desired performance objectives.This dissertation presents a holistic system modeling and novel solution methodology to effectivelysolve the optimization problems formulated in three cloud and edge architectures: 1) cloud computing in colocation datacenters; 2) cloud computing in geographically distributed datacenters; 3) UAV-enabled mobile edge computing. First, we study resource management with the goal of overall cost minimization in the context of cloud computing systems. A cooperative game is formulated to model the scenario where a multi-tenant colocation datacenter collectively procures electricity in the wholesale electricity market. Then, a two-stage stochastic programming is formulated to model the scenario where geographically distributed datacenters dispatch workload and procure electricity in the multi-timescale electricity markets. Last, we extend our focus on joint task offloading and resource management with the goal of overall cost minimization in the context of edge computing systems, where edge nodes with computing capabilities are deployed in proximity to end users. A nonconvex optimization problem is formulated in the UAV-enabled mobile edge computing system with the goal of minimizing both energy consumption for computation and task offloading and system response delay. Furthermore, a novel hybrid algorithm that unifies differential evolution and successive convex approximation is proposed to efficiently solve the problem with improved performance.This dissertation addresses several fundamental issues related to resource management incloud and edge computing systems that will further in-depth investigations to improve costeffective performance. The advanced modeling and efficient algorithms developed in this research enable the system operator to make optimal and strategic decisions in resource allocation and task offloading for cost savings