Libo Jiao

Dr. Libo Jiao

orcid

Research Focus & Metrics

Academic Career Length

9Years (2018-Present)

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

Representative Publications

View All Publications
1 September 2021 in Computer Networks
Verified
Journal Article
Closed access
XCXin Chen
Xin Chen
XLXu Liu
Xu Liu
YCYing Chen
Ying Chen
LJLibo Jiao
Libo Jiao
Geyong  MinGeyong Min
Geyong Min

11 November 2019 in IEEE Internet of Things Journal
Verified
Journal Article
Closed access
LJLibo Jiao
Libo Jiao
YWYulei Wu
Yulei Wu
JDJiaqing Dong
Jiaqing Dong
ZJZexun Jiang
Zexun Jiang
The Internet of Things (IoT) increases the number of connected devices and supports ever-growing complexity of applications. Owing to the constrained physical size, the IoT devices can significantly enhance computation capacity by offloading computation-intensive tasks to the resource-rich edge servers deployed at the base station (BS) via wireless networks. However, how to achieve optimal resource scheduling remains a challenge due to stochastic task arrivals, time-varying wireless channels and imperfect estimation of channel state information (CSI). In this paper, by virtue of the Lyapunov optimization technique, we propose the toward optimal resource scheduling algorithm under imperfect CSI (TORS) to optimize resource scheduling in an IoT environment. A convex transmit power and subchannel allocation problem in TORS is formulated. This problem is then solved via the Lagrangian dual decomposition method. We derive analytical bounds for the time-averaged system throughput and queue backlog. We show that TORS can arbitrarily approach the optimal system throughput by simply tuning an introduced control parameter β without prior knowledge of stochastic task arrivals and the CSI of wireless channels. Extensive simulation results confirm the theoretical analysis on the performance of TORS.

23 January 2018 in IEEE Transactions on Services Computing
Verified
Journal Article
Closed access
QFQilin Fan
Qilin Fan
HYHao Yin
Hao Yin
LJLibo Jiao
Libo Jiao
YLYongqiang Lyu
Yongqiang Lyu
HHHaojun Huang
Haojun Huang
XZXu Zhang
Xu Zhang
The decision of request mapping - which server to handle user request and response routing - which transit route to carry response back to user has great impact on the performance and cost of Content Delivery Networks (CDNs). Request mapping and response routing are traditionally treated independently. The information invisibility and inconsistent objectives may lead to worse performance and high cost. However, the rapid globalization of Internet eXchange Points (IXPs) has facilitated the cooperation between CDN and ISP. In this paper, we consider request mapping and response routing jointly. We formulate the joint problem to navigate the performance and cost tradeoff. To solve the large-scale optimization, we develop a distributed tide algorithm based on Gauss-Seidel. The joint problem can be decomposed to sub-problems which allows for a parallel implementation. Experiment result shows that the relative error between our distributed tide algorithm that iterates within 50 rounds and theoretical optimum is around 0.7%. Furthermore, the parallel runtime demonstrates the efficiency of our algorithm.

14 February 2020 in IEEE Access
Verified
Journal Article
Open access
LJLibo Jiao
Libo Jiao
HYHao Yin
Hao Yin
YWYulei Wu
Yulei Wu
Mobile video streaming is a successful example of Cyber-Physical-Social Systems (CPSS). How to schedule network resources and provide better mobile video streaming services for mobile users are very important. Scalable video streaming is regarded as a promising technology in wireless networks where the cognitive femtocells are overlaid within the coverage area of a macrocell network. In this paper, we study dynamic resource allocation for scalable video streaming over cache-enabled wireless networks with time-varying channel conditions. We formulate the scalable video streaming problem as a stochastic optimization problem which aims at maximizing the time-averaged system utility subject to the time-averaged video cache constraint at the server and the cross-tier interference constraint on the primary user under the sparse deployment scenario of femtocells. By employing the Lyapunov optimization theory, we design a dynamic cache and resource allocation (DCRA) algorithm to solve this problem. Furthermore, the problem is decomposed into three subproblems, i.e., video layer selection, cache placement, and wireless resource allocation. Via solving these subproblems, we derive the video layer selection and cache placement strategies, and a wireless resource allocation algorithm to manage the cross-tier interference. Simulation results demonstrate the advantages of the proposed DCRA for streaming scalable video over time-varying wireless networks.

7 May 2024 in Applied Sciences
Verified
Journal Article
Open access
PDF file
DGDongchao Guo
Dongchao Guo
LJLibo Jiao
Libo Jiao
JJJiao Jian
Jiao Jian
KMKun Meng
Kun Meng
The Susceptible–Infected–Susceptible (SIS) model in complex networks is one of the critical models employed in the modeling of virus spread. The study of the heterogeneous SIS model with a non-homogeneous nodal infection rate in finite-size networks has attracted little attention. Investigating the statistical properties of heterogeneous SIS epidemic dynamics in finite networks is thus intriguing. In this paper, we focus on the measure of variability in the number of infected nodes for the heterogeneous SIS epidemic dynamics in finite-size bipartite graphs and star graphs. Specifically, we investigate the metastable-state variance of the number of infected nodes for the SIS epidemic process in finite-size bipartite graphs and star graphs with heterogeneous nodal infection rates. We employ an extended individual-based mean-field approximation to analyze the heterogeneous SIS epidemic process in finite-size bipartite networks and star graphs. We derive the approximation solutions of the variance of the infected number. We verify the proposed theory by simulations. The proposed theory has the potential to help us better understand the fluctuations of SIS models like epidemic dynamics with a non-homogeneous infection rate.

7 January 2019 in Peer-to-Peer Networking and Applications
Verified
Journal Article
Closed access
PDF file
LJLibo Jiao
Libo Jiao
HYHao Yin
Hao Yin
DGDongchao Guo
Dongchao Guo
HHHaojun Huang
Haojun Huang
QGQin Gao
Qin Gao