Yongxiang Zhao
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Yongxiang Zhao has a total of 30 co-authors. Here are the top co-authors by number of shared publications:
- Baoxian Zhang
University of Chinese Academy of Sciences
4 shared publications - Chunxi Li
Beijing Jiaotong University
4 shared publications - Cheng Li
Simon Fraser University
3 shared publications - Hongyun Zheng
School of Electronic and Information Engineering, Beijing Jiaotong University, Beijing, China
3 shared publications - Bo Ai
Beijing Jiaotong University
2 shared publications - Kang Geun Shin
University of Michigan
2 shared publications
Latest Publications
- 1 December 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Mobile Computing
- Vol. 25 (12) , 24398-24412
Asynchronous Access Mechanism for Deterministic Converged 5G and Time-Sensitive Networks
- 1 December 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Mobile Computing
- Vol. 25 (12) , 24398-24412
Asynchronous Access Mechanism for Deterministic Converged 5G and Time-Sensitive Networks
- 17 January 2025
- Published by Springer Nature in Peer-to-Peer Networking and Applications
- Vol. 18 (2) , 1-14
Startup delay aware short video ordering: Problem, model, and a reinforcement learning based algorithm
- 17 January 2025
- Published by Springer Nature in Peer-to-Peer Networking and Applications
- Vol. 18 (2) , 1-14
Startup delay aware short video ordering: Problem, model, and a reinforcement learning based algorithm
- Open Access
Startup Delay Aware Short Video Ordering: Problem, Model, and A Reinforcement Learning based Algorithm
Short video applications have attracted billions of users on the Internet and can satisfy diverse users' fragmented spare time with content-rich and duration-short videos. To achieve fast playback at user side, existing short video systems typically enforce burst transmission of initial segment of each video when being requested for improved quality of user experiences. However, such a way of burst transmissions can cause unexpected large startup delays at user side. This is because users may frequently switch videos when sequentially watching a list of short videos recommended by the server side, which can cause excessive burst transmissions of initial segments of different short videos and thus quickly deplete the network transmission capacity. In this paper, we adopt token bucket to characterize the video transmission path between video server and each user, and accordingly study how to effectively reduce the startup delay of short videos by effectively arranging the viewing order of a video list at the server side. We formulate the optimal video ordering problem for minimizing the maximum video startup delay as a combinatorial optimization problem and prove its NP-hardness. We accordingly propose a Partially Shared Actor Critic reinforcement learning algorithm (PSAC) to learn optimized video ordering strategy. Numerical results based on a real dataset provided by a large-scale short video service provider demonstrate that the proposed PSAC algorithm can significantly reduce the video startup delay compared to baseline algorithms.
Open AccessStartup Delay Aware Short Video Ordering: Problem, Model, and A Reinforcement Learning based Algorithm
Short video applications have attracted billions of users on the Internet and can satisfy diverse users' fragmented spare time with content-rich and duration-short videos. To achieve fast playback at user side, existing short video systems typically enforce burst transmission of initial segment of each video when being requested for improved quality of user experiences. However, such a way of burst transmissions can cause unexpected large startup delays at user side. This is because users may frequently switch videos when sequentially watching a list of short videos recommended by the server side, which can cause excessive burst transmissions of initial segments of different short videos and thus quickly deplete the network transmission capacity. In this paper, we adopt token bucket to characterize the video transmission path between video server and each user, and accordingly study how to effectively reduce the startup delay of short videos by effectively arranging the viewing order of a video list at the server side. We formulate the optimal video ordering problem for minimizing the maximum video startup delay as a combinatorial optimization problem and prove its NP-hardness. We accordingly propose a Partially Shared Actor Critic reinforcement learning algorithm (PSAC) to learn optimized video ordering strategy. Numerical results based on a real dataset provided by a large-scale short video service provider demonstrate that the proposed PSAC algorithm can significantly reduce the video startup delay compared to baseline algorithms.
- Open Access
End-to-End Asynchronous Traffic Scheduling in Converged 5G and Time-Sensitive Networks
As required by Industry 4.0, companies will move towards flexible and individual manufacturing. To succeed in this transition, convergence of 5G and time-sensitive networks (TSN) is the most promising technology and has thus attracted considerable interest from industry and standardization groups. However, the delay and jitter of end-to-end (e2e) transmission will get exacerbated if the transmission opportunities are missed in TSN due to the 5G transmission jitter and the clock skew between the two network systems. To mitigate this phenomenon, we propose a novel asynchronous access mechanism (AAM) that isolates the jitter only in the 5G system and ensures zero transmission jitter in TSN. We then exploit AAM to develop an e2e asynchronous traffic scheduling model for coordinated allocation of resources for 5G and TSN to provide e2e transmission delay guarantees for time-critical flows. The results of our extensive simulation of AAM on OMNET++ corroborate the superior performance of AAM and the scheduling model.
Open AccessEnd-to-End Asynchronous Traffic Scheduling in Converged 5G and Time-Sensitive Networks
As required by Industry 4.0, companies will move towards flexible and individual manufacturing. To succeed in this transition, convergence of 5G and time-sensitive networks (TSN) is the most promising technology and has thus attracted considerable interest from industry and standardization groups. However, the delay and jitter of end-to-end (e2e) transmission will get exacerbated if the transmission opportunities are missed in TSN due to the 5G transmission jitter and the clock skew between the two network systems. To mitigate this phenomenon, we propose a novel asynchronous access mechanism (AAM) that isolates the jitter only in the 5G system and ensures zero transmission jitter in TSN. We then exploit AAM to develop an e2e asynchronous traffic scheduling model for coordinated allocation of resources for 5G and TSN to provide e2e transmission delay guarantees for time-critical flows. The results of our extensive simulation of AAM on OMNET++ corroborate the superior performance of AAM and the scheduling model.
- Open Access
- 8 November 2023
- Published by MDPI AG in Applied Sciences
- Vol. 13 (22) , 12126
Hi-RCA: A Hierarchy Anomaly Diagnosis Framework Based on Causality and Correlation Analysis
Microservice architecture has been widely adopted by large-scale applications. Due to the huge amount of data and complex microservice dependency, it also poses new challenges in ensuring reliable performance and maintenance. Existing approaches still suffer from limitations of anomaly data, over-simplification of metric relationships, and lack of diagnosing interpretability. To solve these issues, this paper builds a hierarchy root cause diagnosis framework, named Hi-RCA. We propose a global perspective to characterize different abnormal symptoms, which focuses on changes in metrics’ causation and correlation. We decompose the diagnosis task into two phases: anomalous microservice location and anomalous reason diagnosis. In the first phase, we use Kalman filtering to quantify microservice abnormality based on the estimation error. In the second phase, we use causation analysis to identify anomalous metrics and generate anomaly knowledge graphs; by correlation analysis, we construct an anomaly propagation graph and explain the anomaly symptoms via graph comparison. Our experimental evaluation on an open dataset shows that Hi-RCA can effectively locate root causes with 90% mean average precision, outperforming state-of-the-art methods.
- 8 November 2023
- Published by MDPI AG in Applied Sciences
- Vol. 13 (22) , 12126
Open AccessHi-RCA: A Hierarchy Anomaly Diagnosis Framework Based on Causality and Correlation Analysis
Microservice architecture has been widely adopted by large-scale applications. Due to the huge amount of data and complex microservice dependency, it also poses new challenges in ensuring reliable performance and maintenance. Existing approaches still suffer from limitations of anomaly data, over-simplification of metric relationships, and lack of diagnosing interpretability. To solve these issues, this paper builds a hierarchy root cause diagnosis framework, named Hi-RCA. We propose a global perspective to characterize different abnormal symptoms, which focuses on changes in metrics’ causation and correlation. We decompose the diagnosis task into two phases: anomalous microservice location and anomalous reason diagnosis. In the first phase, we use Kalman filtering to quantify microservice abnormality based on the estimation error. In the second phase, we use causation analysis to identify anomalous metrics and generate anomaly knowledge graphs; by correlation analysis, we construct an anomaly propagation graph and explain the anomaly symptoms via graph comparison. Our experimental evaluation on an open dataset shows that Hi-RCA can effectively locate root causes with 90% mean average precision, outperforming state-of-the-art methods.
- 22 May 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Network and Service Management
- Vol. 20 (4) , 4751-4764
Dynamic Upgrade to SDN From a Global Perspective: Model and Its Heuristic Solutions
Software Defined Network (SDN) has been considered as one of the most promising next-generation network solutions due to its network programmability. However, the upgrade from legacy IP network to pure SDN network is in general a gradual process. From a global perspective, a dynamic upgrade strategy should not only aim to pursue the local goal at each step, but also strive to optimize the final global solution when the upgrading process terminates. This raises three essential questions: which switches to upgrade, when to upgrade, and how to deploy controllers. Due to the interaction between the local goals at intermediate steps and the global goal at the final step, answering these questions altogether from a global perspective is challenging. In this paper, we study the dynamic SDN upgrade problem from a global perspective and answer these three questions altogether. We formulate the problem as a dynamic optimization problem that optimizes the global and local goals at the same time. We then propose two new formulations to combine the global and local goals, and two heuristic algorithms to solve them, respectively. We evaluate the proposed model and algorithms on realistic network topologies. The results show their feasibility and superiority.
- 22 May 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Network and Service Management
- Vol. 20 (4) , 4751-4764
Dynamic Upgrade to SDN From a Global Perspective: Model and Its Heuristic Solutions
Software Defined Network (SDN) has been considered as one of the most promising next-generation network solutions due to its network programmability. However, the upgrade from legacy IP network to pure SDN network is in general a gradual process. From a global perspective, a dynamic upgrade strategy should not only aim to pursue the local goal at each step, but also strive to optimize the final global solution when the upgrading process terminates. This raises three essential questions: which switches to upgrade, when to upgrade, and how to deploy controllers. Due to the interaction between the local goals at intermediate steps and the global goal at the final step, answering these questions altogether from a global perspective is challenging. In this paper, we study the dynamic SDN upgrade problem from a global perspective and answer these three questions altogether. We formulate the problem as a dynamic optimization problem that optimizes the global and local goals at the same time. We then propose two new formulations to combine the global and local goals, and two heuristic algorithms to solve them, respectively. We evaluate the proposed model and algorithms on realistic network topologies. The results show their feasibility and superiority.
- 1 February 2023
- Published by Springer Nature
- p. 520-532
A Computing Efficient Algorithm Specialized for Pseudo-Constant Metrics
- 1 February 2023
- Published by Springer Nature
- p. 520-532
A Computing Efficient Algorithm Specialized for Pseudo-Constant Metrics
- 7 June 2020
- Published by Springer Nature in Mobile Networks and Applications
- Vol. 25 (5) , 1694-1707
AP-Assisted Online Task Assignment Algorithms for Mobile Crowdsensing
- 7 June 2020
- Published by Springer Nature in Mobile Networks and Applications
- Vol. 25 (5) , 1694-1707
AP-Assisted Online Task Assignment Algorithms for Mobile Crowdsensing
- Open Access
- 1 January 2018
- Published by Wiley in Wireless Communications and Mobile Computing
- Vol. 2018 (1)
A Mobile Fog Computing‐Assisted DASH QoE Prediction Scheme
Video service has become a killer application for mobile terminals. For providing such services, most of the traffic is carried by the Dynamic Adaptive Streaming over HTTP (DASH) technique. The key to improve video quality perceived by users,i.e., Quality of Experience (QoE), is to effectively characterize it by using measured data. There have been many literatures that studied this issue. Some existing solutions use probe mechanism at client/server, which, however, are not applicable to network operator. Some other solutions, which aimed to predict QoE by deep packet parsing, cannot work properly as more and more video traffic is encrypted. In this paper, we propose a fog‐assisted real‐time QoE prediction scheme, which can predict the QoE of DASH‐supported video streaming using fog nodes. Neither client/server participations nor deep packet parsing at network equipment is needed, which makes this scheme easy to deploy. Experimental results show that this scheme can accurately detect QoE with high accuracy even when the video traffic is encrypted.
- 1 January 2018
- Published by Wiley in Wireless Communications and Mobile Computing
- Vol. 2018 (1)
Open AccessA Mobile Fog Computing‐Assisted DASH QoE Prediction Scheme
Video service has become a killer application for mobile terminals. For providing such services, most of the traffic is carried by the Dynamic Adaptive Streaming over HTTP (DASH) technique. The key to improve video quality perceived by users,i.e., Quality of Experience (QoE), is to effectively characterize it by using measured data. There have been many literatures that studied this issue. Some existing solutions use probe mechanism at client/server, which, however, are not applicable to network operator. Some other solutions, which aimed to predict QoE by deep packet parsing, cannot work properly as more and more video traffic is encrypted. In this paper, we propose a fog‐assisted real‐time QoE prediction scheme, which can predict the QoE of DASH‐supported video streaming using fog nodes. Neither client/server participations nor deep packet parsing at network equipment is needed, which makes this scheme easy to deploy. Experimental results show that this scheme can accurately detect QoE with high accuracy even when the video traffic is encrypted.
- Open Access
- 1 January 2018
- Published by Wiley in Wireless Communications and Mobile Computing
- Vol. 2018 (1)
Transcoding Based Video Caching Systems: Model and Algorithm
The explosive demand of online video watching brings huge bandwidth pressure to cellular networks. Efficient video caching is critical for providing high‐quality streaming Video‐on‐Demand (VoD) services to satisfy the rapid increasing demands of online video watching from mobile users. Traditional caching algorithms typically treat individual video files separately and they tend to keep the most popular video files in cache. However, in reality, one video typically corresponds to multiple different files (versions) with different sizes and also different video resolutions. Thus, caching of such files for one video leads to a lot of redundancy since one version of a video can be utilized to produce other versions of the video by using certain video coding techniques. Recently, fog computing pushes computing power to edge of network to reduce distance between service provider and users. In this paper, we take advantage of fog computing and deploy cache system at network edge. Specifically, we study transcoding based video caching in cellular networks where cache servers are deployed at the edge of cellular network for providing improved quality of online VoD services to mobile users. By using transcoding, a cached video can be used to convert to different low‐quality versions of the video as needed by different users in real time. We first formulate the transcoding based caching problem as integer linear programming problem. Then we propose a Transcoding based Caching Algorithm (TCA), which iteratively finds the placement leading to the maximal delay gain among all possible choices. We deduce the computational complexity of TCA. Simulation results demonstrate that TCA significantly outperforms traditional greedy caching algorithm with a decrease of up to 40% in terms of average delivery delay.
- 1 January 2018
- Published by Wiley in Wireless Communications and Mobile Computing
- Vol. 2018 (1)
Open AccessTranscoding Based Video Caching Systems: Model and Algorithm
The explosive demand of online video watching brings huge bandwidth pressure to cellular networks. Efficient video caching is critical for providing high‐quality streaming Video‐on‐Demand (VoD) services to satisfy the rapid increasing demands of online video watching from mobile users. Traditional caching algorithms typically treat individual video files separately and they tend to keep the most popular video files in cache. However, in reality, one video typically corresponds to multiple different files (versions) with different sizes and also different video resolutions. Thus, caching of such files for one video leads to a lot of redundancy since one version of a video can be utilized to produce other versions of the video by using certain video coding techniques. Recently, fog computing pushes computing power to edge of network to reduce distance between service provider and users. In this paper, we take advantage of fog computing and deploy cache system at network edge. Specifically, we study transcoding based video caching in cellular networks where cache servers are deployed at the edge of cellular network for providing improved quality of online VoD services to mobile users. By using transcoding, a cached video can be used to convert to different low‐quality versions of the video as needed by different users in real time. We first formulate the transcoding based caching problem as integer linear programming problem. Then we propose a Transcoding based Caching Algorithm (TCA), which iteratively finds the placement leading to the maximal delay gain among all possible choices. We deduce the computational complexity of TCA. Simulation results demonstrate that TCA significantly outperforms traditional greedy caching algorithm with a decrease of up to 40% in terms of average delivery delay.