Xiaojun Lin

Xiaojun Lin

Auto-generated profile, based on publicly available information

Xiaojun Lin

Department of Information Engineering, The Chinese University of Hong Kong, Hong Kong, Hong Kong

Research Focus & Metrics

Academic Career Length

22Years (2005-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 November 2017 in IEEE Transactions on Information Theory
Verified
Journal Article
Open access
JZJinbei Zhang
Jinbei Zhang
XLXiaojun Lin
Xiaojun Lin
XWXinbing Wang
Xinbing Wang
Caching plays an important role in reducing the backbone traffic when serving high-volume multimedia content. Recently, a new class of coded caching schemes have received significant interest because they can exploit coded multi-cast opportunities to further reduce backbone traffic. Without considering file popularity, prior works have characterized the fundamental performance limits of coded caching through a deterministic worst-case analysis. However, when heterogeneous file popularity is taken into account, there remain open questions regarding the fundamental limits of coded caching performance. In this work, for an arbitrary popularity distribution, we first derive a new information-theoretical lower bound on the expected transmission rate of any coded caching schemes. We then show that a simple coded-caching scheme attains an expected transmission rate that is at most a constant factor away from the lower bound. Unlike other existing studies, the constant factor that we derived is independent of the popularity distribution.

1 January 2006
Verified
Conference Paper
Closed access
XLXiaojun Lin
Xiaojun Lin
SRShahzada B. Rasool
Shahzada B. Rasool
We propose two new distributed scheduling policies for ad hoc wireless networks that can achieve provable capacity regions. Known scheduling policies that guarantee comparable capacity regions are either centralized or need computation time that increases with the size of the network. In contrast, the unique feature of the proposed distributed scheduling policies is that they are constant-time policies, i.e., the time needed for computing a schedule is independent of the network size. Hence, they can be easily deployed in large networks

5 July 2019 in IEEE Journal on Selected Areas in Communications
Verified
Journal Article
Closed access
YZYuan Zhang
Yuan Zhang
LJLei Jiao
Lei Jiao
JYJinyao Yan
Jinyao Yan
XLXiaojun Lin
Xiaojun Lin
To realize mobile Virtual Reality (VR) group gaming services which are currently hampered by the prohibitive bandwidth and the stringent delay requirements, we investigate the problem of provisioning such services using the emerging Mobile Edge Cloudlet (MEC) networks with a distributed content rendering architecture. The underlying dynamic rendering-module placement problem requires to optimize the service’s operational cost and the users’ end-to-end performance, involving multiple intertwined conflicting system objectives which are discrete, nonconvex, and higher-degree polynomial functions, with coupled decisions and arbitrary user dynamics over time. We solve this online placement problem by leveraging Model Predictive Control (MPC) and overcoming the aforementioned challenges over each prediction window. We explore the connection between the placement problem and the minimal s-t cut problem in graph theory, and solve the former via solving a series of instances of the latter. We formally prove the performance guarantee of our approach. We also conduct extensive trace-driven evaluations and demonstrate the superior practical performance of our MPC-based approach compared to the de facto practices and the state-of-the-art alternatives.

20 December 2021 in IEEE Transactions on Smart Grid
Verified
Journal Article
Closed access
DZDongwei Zhao
Dongwei Zhao
Hao WangHao Wang
Hao Wang
JHJianwei Huang
Jianwei Huang
XLXiaojun Lin
Xiaojun Lin
Time-of-use (ToU) pricing is widely used by the electricity utility to shave peak load. Such a pricing scheme provides users with incentives to invest in behind-the-meter energy storage and to shift peak load towards low-price intervals. However, without considering the implication on energy storage investment, an improperly designed ToU pricing scheme may lead to significant welfare loss, especially when users over-invest the storage, which leads to new energy consumption peaks. In this paper, we will study how to design a social-optimum ToU pricing scheme by explicitly considering its impact on storage investment. We model the interactions between the utility and users as a two-stage optimization problem. To resolve the challenge of asymmetric information due to users’ private storage cost, we propose a ToU pricing scheme based on different storage types and the aggregate demand per type. Each user does not need to reveal his private cost information. We can further compute the optimal ToU pricing with only a linear complexity. Simulations based on real-world data show that the suboptimality gap of our proposed ToU pricing, compared with the social optimum achieved under complete information, is less than 5%.

28 April 2017 in IEEE Transactions on Automatic Control
Verified
Journal Article
Open access
SZShizhen Zhao
Shizhen Zhao
XLXiaojun Lin
Xiaojun Lin
MCMinghua Chen
Minghua Chen
In this paper, we study how to utilize forecasts to design online electrical vehicle (EV) charging algorithms that can attain strong performance guarantees. We consider the scenario of an aggregator serving a large number of EVs together with its background load, using both its own renewable energy (for free) and the energy procured from the external grid. The goal of the aggregator is to minimize its peak procurement from the grid, subject to the constraint that each EV has to be fully charged before its deadline. Further, the aggregator can predict the future demand and the renewable energy supply with some levels of uncertainty. We show that such prediction can be very effective in reducing the competitive ratios of online control algorithms, and even allow online algorithms to achieve close-to-offline-optimal peak. Specifically, we first propose a 2-level increasing precision model (2-IPM), to model forecasts with different levels of accuracy. We then develop a powerful computational approach that can compute the optimal competitive ratio under 2-IPM over any online algorithm, and also online algorithms that can achieve the optimal competitive ratio. Simulation results show that, even with up to 20% day-ahead prediction errors, our online algorithms still achieve competitive ratios fairly close to 1, which are much better than the classic results in the literature with a competitive ratio of e. The second contribution of this paper is that we solve a dilemma for online algorithm design, e.g., an online algorithm with good competitive ratio may exhibit poor average-case performance. We propose a new Algorithm-Robustification procedure that can convert an online algorithm with good average-case performance to one with both the optimal competitive ratio and good average-case performance. We demonstrate via trace-based simulations the superior performance of the robustified version of a well-known heuristic algorithm based on model predictive control.

21 November 2022 in IEEE Transactions on Cloud Computing
Verified
Journal Article
Closed access
AJAkshay Jajoo
Akshay Jajoo
YHY. Charlie Hu
Y. Charlie Hu
XLXiaojun Lin
Xiaojun Lin
NDNan Deng
Nan Deng
The ability to accurately estimate job runtime properties allows a scheduler to effectively schedule jobs. State-of-the-art online cluster job schedulers use history-based learning, which uses past job execution information to estimate the runtime properties of newly arrived jobs. However, with fast-paced development in cluster technology (in both hardware and software) and changing user inputs, job runtime properties can change over time, which lead to inaccurate predictions. In this paper, we explore the potential and limitation of real-time learning of job runtime properties, by proactively sampling and scheduling a small fraction of the tasks of each job. Such a task-sampling-based approach exploits the similarity among runtime properties of the tasks of the same job and is inherently immune to changing job behavior. Our analytical and experimental analysis of 3 production traces with different skew and job distribution shows that learning in space can be substantially more accurate. Our simulation and testbed evaluation on Azure of the two learning approaches anchored in a generic job scheduler using 3 production cluster job traces shows that despite its online overhead, learning in space reduces the average Job Completion Time (JCT) by 1.28×, 1.56×, and 1.32× compared to the prior-art history-based predictor.