Miao Hu

Mr. Miao Hu

orcid

Research Focus & Metrics

Academic Career Length

13Years (2014-Present)

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

Representative Publications

View All Publications
17 April 2020 in IEEE Transactions on Parallel and Distributed Systems
Verified
Journal Article
Closed access
MHMiao Hu
Miao Hu
ZXZixuan Xie
Zixuan Xie
DWDi Wu
Di Wu
YZYipeng Zhou
Yipeng Zhou
XCXu Chen
Xu Chen
LXLiang Xiao
Liang Xiao
Task offloading is one of key operations in edge computing, which is essential for reducing the latency of task processing and boosting the capacity of end devices. However, the heterogeneity among tasks generated by various users makes it challenging to design efficient task offloading algorithms. In addition, the assumption of complete information for offloading decision-making does not always hold in a distributed edge computing environment. In this paper, we formulate the problem of heterogeneous task offloading in a distributed environment as a minority game (MG), in which each player must make decisions independently in each turn and the players who end up on the minority side win. The multi-player MG incentivizes players to cooperate with each other in the scenarios with incomplete information, where players don't have full information about other players (e.g., the number of tasks, the required resources). To address the challenges incurred by task heterogeneity and the divergence of naive MG approaches, we propose an MG based scheme, in which tasks are divided into subtasks and instructed to form into a set of groups as possible, and the left ones are scheduled to perform decision adjustment in a probabilistic manner. We prove that our proposed algorithm can converge to a near-optimal point, and also investigate its stability and price of anarchy in terms of task processing time. Finally, we conduct a series of simulations to evaluate the effectiveness of our proposed scheme and the results indicate that our scheme can achieve around 30% reduction of task processing time compared with other approaches. Moreover, our proposed scheme can converge to a near-optimal point, which cannot be guaranteed by naive MG approaches.

18 January 2019 in IEEE Transactions on Parallel and Distributed Systems
Verified
Journal Article
Closed access
MHMiao Hu
Miao Hu
LZLei Zhuang
Lei Zhuang
DWDi Wu
Di Wu
YZYipeng Zhou
Yipeng Zhou
XCXu Chen
Xu Chen
LXLiang Xiao
Liang Xiao
Edge computing emerges as a promising paradigm to decentralize computation power to the edge of the network and thus improve user experience by task offloading. A user can perfectly schedule his tasks to be executed on edge servers if the execution time of all tasks can be known beforehand. However, it is difficult to know the task execution time (TET) before performing actual offloading, which normally varies on edge servers with different software and hardware configurations. Moreover, such configuration information is not always available to end users due to security concerns. In this paper, we first propose a learning-driven algorithm to accurately predict TETs of all tasks in such an asymmetrically informed edge computing environment. The basic idea is to predict unknown TETs using only a small sampled set of TETs by exploiting the underlying correlation between TETs and edge server configurations. Next, we formulate the problem of task offloading into a constrained optimization problem, which is unfortunately proved to be NP-hard. To address the above challenge, we design a task offloading algorithm, called Maximum Efficiency First Ordered (MEFO), to achieve near-optimal efficiency. Field measurements and experiments have been conducted to demonstrate that our proposed learning-driven algorithm can predict TETs more accurately than other algorithms as long as the fraction of sampled TETs is larger than a small predefined threshold, and our proposed MEFO algorithm achieves a much higher success rate of task offloading and a shorter processing delay with very limited information of edge servers.

23 October 2020 in IEEE Transactions on Multimedia
Verified
Journal Article
Closed access
JCJinyu Chen
Jinyu Chen
XLXianzhuo Luo
Xianzhuo Luo
MHMiao Hu
Miao Hu
DWDi Wu
Di Wu
YZYipeng Zhou
Yipeng Zhou
In 360-degree video streaming, users commonly watch a video scene within a Field of View (FoV). Such observation provides an opportunity to save bandwidth consumption by predicting and then prefetching video tiles within the FoV. However, existing FoV prediction methods seldom consider the diversity among user behaviors and the impact of different video genres. Thus, previous one-size-fits-all models cannot make accurate prediction for users with different behavior patterns. In this paper, we propose a user-aware viewport prediction algorithm called Sparkle, which is a practical whitebox approach for FoV prediction. Instead of training a single learning model to predict the behaviors for all users, our proposed algorithm is tailored to fit each individual user. In particular, unlike other learning models, our prediction model is completely explainable and all the parameters have their physical meanings. We first conduct a measurement study to analyze real user behaviors and observe that there exists sharp fluctuation of view orientation and user posture has significant impact on the viewport movement of users. Moreover, cross-user similarity is diverse across different video genres. Inspired by these insights, we further design a user-aware viewport prediction algorithm by mimicking a user's viewport movement on the tile map, and determine how a user will change the viewport angle based on his (or her) trajectory and other similar users' behaviors in the past time window. Extensive evaluations with real datasets demonstrate that, our proposed algorithm significantly outperforms the state-of-the-art benchmark methods (e.g., LSTM-based methods) by over 5%, and the prediction accuracy is much more stable on various types of 360-degree videos than previous methods.

4 February 2022 in IEEE Transactions on Parallel and Distributed Systems
Verified
Journal Article
Closed access
MHMiao Hu
Miao Hu
DWDi Wu
Di Wu
YZYipeng Zhou
Yipeng Zhou
XCXu Chen
Xu Chen
Min ChenMin Chen
Min Chen
Federated learning (FL) emerges as a promising paradigm to enable a federation of clients to train a machine learning model in a privacy-preserving manner. Most existing works assumed that the central parameter server (PS) determines the participation of clients implying that clients cannot make autonomous participation decisions. The above assumption is unrealistic because the participation in FL training may incur various cost and clients also have strong desire to be rewarded for participation. To address this problem, we design a novel autonomous client participation scheme to incentivize clients. Specifically, the PS provides a certain reward shared among participating clients for each training round. Clients decide whether to participate each FL training round or not based on their own utilities (i.e., reward minus cost). The process can be modeled as a minority game (MG) with incomplete information and clients end up in the minority side win after each training round because the reward of each participating client may not cover its cost if too many clients participate and vice verse. The challenge of autonomous participation schemes lies in lowering the volatility of participating clients in each round due to the lack of coordination among clients. Through solid analysis, we prove that: 1) The volatility of participating clients in each round is very high under the standard MG scheme. 2) The volatility of participating clients can be reduced significantly under the stochastic MG scheme. 3) A coalition based MG is proposed, which can further reduce the volatility in each round. By conducting extensive experiments in real settings, we demonstrate that the stochastic MG-based scheme outperforms other state-of-the-art algorithms in terms of utility and volatility, and the coalition MG-based client participation scheme can further boost the utility by 39%-48% and reduce the volatility by 51%–100%. Moreover, our algorithms can achieve almost the same model accuracy as that obtained by centralized client participation algorithms.

23 January 2023 in IEEE Transactions on Broadcasting
Verified
Journal Article
Closed access
JCJinyu Chen
Jinyu Chen
ZLZhenxiao Luo
Zhenxiao Luo
ZWZelong Wang
Zelong Wang
MHMiao Hu
Miao Hu
DWDi Wu
Di Wu
Live 360-degree video streaming is emerging as the next disruptive innovation in the coming era. However, compared to conventional live video streaming, it is much more challenging to provide high-quality live 360-degree video streaming due to high bandwidth demand, stringent latency requirement, and diverse user viewports. In this paper, we propose a viewport-aware live 360-degree video streaming framework called Live360 to optimize end-to-end video stream transmission. To make the problem tractable, we decompose the transmission optimization problem into two sub-problems, and optimize upstream and downstream transmission in an asynchronous way. We prioritize 360-degree cameras according to users’ real-time viewing interests and upload attractive contents with a higher bitrate. We also re-define the metric of QoE (Quality-of-Experience) for live 360-degree video viewers, and solve the optimization problems efficiently using dynamic programming. Extensive experiments show that Live360 is lightweight and significantly outperforms other state-of-the-art methods in terms of various QoE metrics. The average QoE of Live360 is twice that of other baseline methods.

22 February 2023 in IEEE Transactions on Broadcasting
Verified
Journal Article
Closed access
MYMengyu Yang
Mengyu Yang
ZLZhenxiao Luo
Zhenxiao Luo
MHMiao Hu
Miao Hu
Min ChenMin Chen
Min Chen
DWDi Wu
Di Wu
Volumetric video is fully three-dimensional and immersive, which shows great potential in various application scenarios. However, the naive delivery of volumetric video over the Internet requires a huge amount of bandwidth and compute resources. A volumetric video should be compressed by a specific codec before transmission. In spite of the existence of a few pioneering efforts on prototype design, there is very limited work to investigate the efficiency and practicality of existing volumetric video codecs. In this paper, we conduct a comparative measurement study on five representative point cloud-based volumetric video codecs, including 3 conventional codecs (e.g., Draco, G-PCC, V-PCC) and 2 neural-based codecs (e.g., PU-GCN $+$ , MPU $+$ ), on six real volumetric video datasets. We investigate the applicability of the above codecs in different application scenarios, and examine how the features of point cloud (e.g., quality, texture, geometric and scene complexity) affect the quality of compressed volumetric video from multiple perspectives. In addition, we also study the impact of users’ viewing behaviors on the coding and delivery efficiency with Quality of Experience (QoE) metrics. Our results shed a number of important insights, which provide useful guidelines for optimizing the design of future volumetric video streaming systems.