Yanzhi Li

2papers

2 Papers

NIJan 9
AWaRe-SAC: Proactive Slice Admission Control under Weather-Induced Capacity Uncertainty

Dror Jacoby, Yanzhi Li, Shuyue Yu et al.

Millimeter-wave (mmWave) links are increasingly utilized in wireless x-haul transport to meet growing service demands. However, the inherent susceptibility of mmWave links to weather-related attenuation creates uncertainty about future network capacity which can significantly affect Quality of Service (QoS). This creates a critical challenge: how to make admission control decisions for slices with QoS requirements, balancing acceptance rewards against the risk of future QoS-violation penalties due to capacity uncertainty? To address this, we develop a proactive slice admission control framework that tightly integrates: (i) a predictor that leverages historical link measurements to forecast short-term attenuation and quantify uncertainty; and (ii) an admission control algorithm that incorporates both the predictions and uncertainties to maximize rewards and minimize QoS-violation penalties. We compare our framework against baseline, state-of-the-art, and idealized oracle algorithms using real-world mmWave x-haul data and residential traffic traces. Simulations suggest that our framework can achieve revenues that are 250% larger than baseline algorithms and 75% larger than state-of-the-art algorithms.

DSJun 22, 2019
Collective Mobile Sequential Recommendation: A Recommender System for Multiple Taxicabs

Tongwen Wu, Zizhen Zhang, Yanzhi Li et al.

Mobile sequential recommendation was originally designed to find a promising route for a single taxicab. Directly applying it for multiple taxicabs may cause an excessive overlap of recommended routes. The multi-taxicab recommendation problem is challenging and has been less studied. In this paper, we first formalize a collective mobile sequential recommendation problem based on a classic mathematical model, which characterizes time-varying influence among competing taxicabs. Next, we propose a new evaluation metric for a collection of taxicab routes aimed to minimize the sum of potential travel time. We then develop an efficient algorithm to calculate the metric and design a greedy recommendation method to approximate the solution. Finally, numerical experiments show the superiority of our methods. In trace-driven simulation, the set of routes recommended by our method significantly outperforms those obtained by conventional methods.