Hao Yu

Hao Yu

Auto-generated profile, based on publicly available information

Hao Yu

Department of Communications and Networking, ICTFicial OY, Espoo, Finland

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
11 February 2020 in Journal of Lightwave Technology
Verified
Journal Article
Closed access
HYHao Yu
Hao Yu
FMFrancesco Musumeci
Francesco Musumeci
JZJiawei Zhang
Jiawei Zhang
MTMassimo Tornatore
Massimo Tornatore
YJYuefeng Ji
Yuefeng Ji

15 November 2022 in IEEE Transactions on Industrial Informatics
Verified
Journal Article
Open access
HYHao Yu
Hao Yu
TTTarik Taleb
Tarik Taleb
JZJiawei Zhang
Jiawei Zhang
Deterministic networking has recently drawn much attention by investigating deterministic flow scheduling. Combined with artificial intelligent (AI) technologies, it can be leveraged as a promising network technology for facilitating automated network configuration in the Industrial Internet of Things (IIoT). However, the stricter requirements of the IIoT have posed significant challenges, that is, deterministic and bounded latency for time-critical applications. This article incorporates deep reinforcement learning (DRL) in cycle specified queuing and forwarding and proposes a DRL-based deterministic flow scheduler (Deep-DFS) to solve the deterministic flow routing and scheduling problem. Novel delay aware network representations, action masking and criticality aware reward function design are proposed to make deep-DFS more scalable and efficient. Simulation experiments are conducted to evaluate the performances of deep-DFS, and the results show that deep-DFS can schedule more flows than the other benchmark methods (heuristic- and AI-based methods).

2 September 2024 in IEEE Transactions on Mobile Computing
Verified
Journal Article
Closed access
CWChenyang Wang
Chenyang Wang
HYHao Yu
Hao Yu
XLXiuhua Li
Xiuhua Li
FMFei Ma
Fei Ma
XWXiaofei Wang
Xiaofei Wang
Victor C. M. LeungVictor C. M. Leung
Victor C. M. Leung
The popularity of microservices in industry has sparked much attention in the research community. Despite significant progress in microservice deployment for resource-intensive services and applications at the network edge, the intricate dependencies among microservices are often overlooked, and some studies underestimate the importance of system context extraction in deployment strategies. This paper addresses these issues by formulating the microservice deployment problem as a max-min problem, considering system cost and quality of service (QoS) jointly. We first study the attention-based microservice representation (AMR) method to achieve effective system context extraction. In this way, the contributions of different computing power providers (users, edge servers, or cloud servers) in the networks can be effectively paid attention to. Subsequently, we propose the attention-modified soft actor-critic (ASAC) algorithm to tackle the microservice deployment problem. ASAC leverages attention mechanisms to enhance decision-making and adapt to changing system dynamics. Our simulation results demonstrate ASAC's effectiveness, prioritizing average system cost and reward compared to the other state-of-the-art algorithms.

14 March 2024 in IEEE Transactions on Network Science and Engineering
Verified
Journal Article
Closed access
Yan ChenYan Chen
Yan Chen
YSYanjing Sun
Yanjing Sun
HYHao Yu
Hao Yu
TTTarik Taleb
Tarik Taleb
Edge servers can collaborate to enhance service capability. However, cloud servers may be unable to execute centralized management due to unpredictable communications. In such systems, distributed task and resource management are vital but challenging due to heterogeneity and various restrictions. Therefore, this paper studies such edge systems and formulates the distributed joint task and computing resource allocation problem for maximizing the quality of experience (QoE). Given the restrictions on real-time state observations and resource management involving other facilities, we decompose it into sub-problems of distributed task allocation and computing resource allocation. After formulating the problem as a partially observed Markov decision process, we propose a two-step approach that depends on multi-agent (MA) deep reinforcement learning. First, each edge server performs a policy to allocate tasks for its associated users according to a partial observation. We employ the MA deep deterministic policy gradient to tackle vast spaces of discrete actions. Besides, we incorporate the action entropy of massive users' task allocation to enhance exploration. Then, we prove that the QoE-maximized computing resource allocation is a problem of maxing a sum of sigmoids, and we address it by sigmoidal programming. Simulation results reveal that the proposed approach dramatically improves the system QoE and reduces the average service latency. Besides, the proposed solution outperforms benchmarks in training and convergence.

15 February 2022 in IEEE Transactions on Network and Service Management
Verified
Journal Article
Closed access
HYHao Yu
Hao Yu
TTTarik Taleb
Tarik Taleb
JZJiawei Zhang
Jiawei Zhang
Deterministic Networking (DetNet) has recently attracted much attention. It aims at studying the deterministic bounded latency and low latency variation for time-sensitive applications (e.g., industrial automation). To improve the quality of service (QoS) guarantee and make the network management efficient, it is desirable for Internet Service Provider (ISP) to obtain an optimal service function chain (SFC) provision strategy while providing deterministic service performance for the time-sensitive applications. In this paper, we will study the deterministic SFC lifetime management problem in beyond 5G edge fabric with the objective of maximizing the overall profits and ensuring the deterministic latency and jitter of SFC requests. We first formulate this problem as a mathematical model with the maximal profits for ISP. Then, the novel Deterministic SFC Deployment algorithm (Det-SFCD) and SFC Adjustment algorithm (Det-SFCA) due to traffic load variation are proposed to efficiently solve the SFC lifetime management problem. Extensive simulation results show that our proposed algorithms can achieve better performance in terms of SFC request acceptance rates, overall profits and latency variation compared with the benchmark algorithm.
1

14 November 2023 in IEEE Internet of Things Journal
Verified
Journal Article
Closed access
FLFangzheng Liu
Fangzheng Liu
HYHao Yu
Hao Yu
JHJiwei Huang
Jiwei Huang
TTTarik Taleb
Tarik Taleb
Multi-access Edge Computing (MEC) provides services for resource-sensitive and delay-sensitive Internet of Things (IoT) applications by extending the capabilities of cloud computing to the edge of the networks. However, the high mobility of IoT devices (e.g., vehicles) and the limited resources of edge servers (ESs) affect the service continuity and access latency. Service migration and reasonable resource (re-)allocation consequently become needed to ensure quality of service (QoS). However, service migration results in additional latency. In addition, different mobile IoT users have different resource requirements and different resource allocation policies of target edge servers also determine whether service migration is necessary. Subsequently, how to jointly optimize service migration and resource allocation is a challenge that needs to be carefully addressed. To this end, this paper investigates the joint optimization problem of service migration and resource allocation (SMRA) in MEC environments to minimize the access delay of IoT users. It proposes a joint SMRA algorithm based on deep reinforcement learning (DRL), which takes into account the mobility of IoT users and decides whether to migrate services, where to migrate, and how to allocate resources through the long short time memory (LSTM) algorithm and the parameterized deep Q-network (PDQN) algorithm. Moreover, the PDQN algorithm effectively solves the discrete-continuous hybrid action space challenge in the SMRA problem. Finally, we conduct evaluation using a real-world dataset of Beijing cab trajectories to verify the effectiveness and superiority of our proposed SMRA solution.