14 July 2023 in IEEE/ACM Transactions on Networking
Mobile edge computing (MEC) facilitates computation offloading to edge server and task processing via device-to-device (D2D) collaboration. Existing works mainly focus on centralized network-assisted offloading solutions, which are unscalable to collaborations among massive users. In this paper, we propose a joint framework of decentralized D2D collaboration and task offloading for MEC systems with large populations. Specifically, we utilize the power of two choices for D2D collaboration, which enables users to assist each other in a decentralized manner. Due to short-range D2D communication and user movements, we formulate a mean field model on a finite-degree and dynamic graph to analyze the collaboration state evolution. We derive the existence, uniqueness and convergence of the state stationary point to provide a tractable collaboration performance. Complementing this D2D collaboration, we further build a Stackelberg game to model users’ task offloading, where the provider, managing many servers, is the leader to determine service prices, while users are followers to make offloading decisions. By embedding Stackelberg game into Lyapunov optimization, we develop an online offloading and pricing scheme, which can optimize servers’ service utility or fairness, and users’ system cost simultaneously. Extensive evaluations show that D2D collaboration can mitigate users’ workloads by $73.8\%$ and fair pricing can promote servers’ utility fairness by $15.87\%$ .
12 May 2023 in IEEE Transactions on Mobile Computing
Mobile edge computing facilitates users to offload computation tasks to edge servers for meeting their stringent delay requirements. Previous works mainly explore task offloading when system-side information is given (e.g., server processing speed, cellular data rate), or centralized offloading under system uncertainty. But both generally fall short of handling task placement involving many coexisting users in an uncertain environment. In this paper, we develop a multi-user offloading framework considering unknown yet stochastic system-side information to enable a decentralized user-initiated service placement under overlapping server coverage. Specifically, we formulate the dynamic task placement as an online multi-user multi-armed bandit process, and propose a decentralized epoch based offloading (DEBO) to optimize user rewards which are subjected under network delay. We consider both cases without and with neighboring edge feedback once users’ tasks are processed, where the latter incorporates system-side information sharing among edge servers for an enhanced task placement. For both cases, we show that DEBO can gradually deduce the optimal user-server assignment during dynamic offloading, thereby achieving a close-to-optimal service performance and tight $O(\log _{2}\!\!T)$ regret. Moreover, we generalize DEBO to various common scenarios such as unknown reward gap, dynamic entering or leaving of clients, and fair reward distribution, while further exploring when users’ offloaded tasks require heterogeneous computing resources. Particularly, we accomplish a sub-linear regret for each of these instances. Real measurements based evaluations corroborate the superiority of our offloading schemes over state-of-the-art approaches in optimizing delay-sensitive rewards.
26 September 2022 in IEEE/ACM Transactions on Networking
Edge computing provides a platform facilitating edge servers to contribute to computation offloading while economizing their resources. Traditional offloading solutions are mostly centralized, which are unscalable for large-scale edge computing networks due to complex interactions among many edge servers. Meanwhile, dynamic pricing for an operator is equally, if not more, important to accommodate users’ time-varying demands for computing services. In this paper, we develop a decentralized online optimization framework to jointly minimize the server’s cost of workload scheduling while maximizing the operator’s utility of service pricing. Specifically, we employ the mean field game to model the collective scheduling behavior of all edge servers, thereby enabling optimal decision making only based on the server’s local information. Considering the service price in practice is not adjusted as frequently as the scheduling process, we establish a two-timescale optimization framework, where workload scheduling at a small timescale is tightly embedded into service pricing at a large timescale. Using mean field approximation, we derive the closed-form expression for the minimum scheduling cost, and the approximation error is $O\left(\frac{1}{\sqrt{M}}\right)$ which declines as the number of edge servers $M$ increases. By characterizing the influence of workload scheduling on dynamic pricing, we transform the complex service utility maximization into a succinct but equivalent problem, and thus we can make use of Lyapunov optimization to determine the optimal price over time. Extensive evaluations validate the effectiveness and optimality of our scheduling and pricing schemes.
9 April 2021 in IEEE/ACM Transactions on Networking
Bufferbloat is a phenomenon in computer networks where large router buffers are frequently filled up, resulting in high queueing delay and delay variation. More and more delay-sensitive applications on the Internet have made this phenomenon a pressing issue. Interacting with the Transmission Control Protocol (TCP), active queue management (AQM) algorithms run on routers play an important role in combating bufferbloat. However, AQM algorithms have not been widely deployed due to complicated manual parameter tuning. Moreover, they are often designed and analyzed based on network models with a single bottleneck link, rendering their performance and stability unclear in multi-bottleneck networks. In this paper, we propose a general framework to combat bufferbloat in multi-bottleneck networks. We first present an equilibrium analysis for a general multi-bottleneck TCP/AQM system and provide sufficient conditions for the uniqueness of an equilibrium point in the system. We then decompose the system into single-bottleneck subsystems and derive sufficient conditions for the local asymptotic stability of the subsystems. Using our framework, we develop an algorithm to compute the equilibrium point of the system. We further present a case study to analyze the stability of the recently proposed Controlled Delay (CoDel) in multi-bottleneck networks and devise Self-Tuning CoDel to improve the system stability. Extensive numerical and packet-level simulation results not only verify our theoretical studies but also show that our proposed Self-Tuning CoDel significantly stabilizes queueing delay in multi-bottleneck networks, thereby mitigating bufferbloat.
31 July 2019 in IEEE Systems Journal
In recent years, inexpensive memory has resulted in large router buffers installed in the Internet, leading to high queueing delay and delay variation. This phenomenon is recently termed “bufferbloat.” Active queue management (AQM) algorithms play an important role in combating bufferbloat, but none of them has been widely deployed due to complicated parameter tuning. Moreover, the parameters of AQM algorithms are usually fixed, making them difficult to adapt to changing network environments. In this paper, we propose a framework to adaptively and stably control queueing delay based on network conditions, so as to combat bufferbloat. Specifically, we use controlled delay (CoDel), a recently proposed AQM, in our framework. To the best of our knowledge, this is the first work that develops an analytical model for the CoDel system and derives necessary and sufficient conditions for its stability. Based on the stability analysis, we propose adaptive CoDel with interval tuning (ACoDel-IT) and adaptive CoDel with target and interval tuning (ACoDel-TIT) algorithms, to improve the system stability and performance by automatic parameter tuning. Extensive simulation results demonstrate that ACoDel-IT and ACoDel-TIT effectively stabilize queueing delay, whereas ACoDel-TIT further improves link utilization and reduces packet drops, compared to other representative AQM algorithms.
19 January 2022 in IEEE/ACM Transactions on Networking
The scheduling policy installed on switches of datacenters plays a significant role on congestion control. Shortest-Remaining-Processing-Time (SRPT) achieves the near-optimal average message completion time (MCT) in various scenarios, but is difficult to deploy as viewed by the industry. The reasons are two-fold: 1) many commodity switches only provide FIFO queues, and 2) the information of remaining message size is not available. Recently, the idea of emulating SRPT using only a few FIFO queues and the original message size has been coined as the approximate and deployable SRPT (ADS) design. In this paper, we provide the first theoretical study on the optimal ADS design. Specifically, we first characterize a wide range of feasible ADS scheduling policies via a unified framework, and then derive the steady-state MCT, slowdown, and impoliteness in the M/G/1 setting. Hence we formulate the optimal ADS design as a non-linear combinatorial optimization problem, which aims to minimize the average MCT given the available FIFO queues. We also take into account the proportional fairness and temporal fairness constraints based on the maximal slowdown and impoliteness, respectively. The optimal ADS design problem is NP-hard in general, and does not exhibit monotonicity or sub-modularity. We leverage its decomposable structure and devise an efficient algorithm to solve the optimal ADS policy. We carry out extensive flow-level simulations and packet-level experiments to evaluate the proposed optimal ADS design. Results show that the optimal ADS policy installed on eight FIFO queues is capable of emulating the true SRPT.