Haifeng Sun

Haifeng Sun

Auto-generated profile, based on publicly available information

Haifeng Sun

National University of Singapore, Singapore, Singapore

Research Focus & Metrics

Academic Career Length

5Years (2022-Present)

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

Representative Publications

View All Publications
10 September 2023
Verified
Conference Paper
Open access
HSHaifeng Sun
Haifeng Sun
JLJiaheng Li
Jiaheng Li
JHJintao He
Jintao He
JGJie Gui
Jie Gui
QHQun Huang
Qun Huang

11 April 2023 in IEEE Transactions on Neural Networks and Learning Systems
Verified
Journal Article
Closed access
ZLZhao Li
Zhao Li
HSHaifeng Sun
Haifeng Sun
ZXZheng Xiong
Zheng Xiong
QHQun Huang
Qun Huang
ZHZehong Hu
Zehong Hu
YFYang Fang
Yang Fang
Modern large-scale online service providers typically deploy microservices into containers to achieve flexible service management. One critical problem in such container-based microservice architectures is to control the arrival rate of requests in the containers to avoid containers from being overloaded. In this article, we present our experience of rate limit for the containers in, one of the largest e-commerce services in the world. Given the highly diverse characteristics of containers in, we point out that the existing rate limit mechanisms cannot meet our demand. Thus, we design, a dynamic rate limiter that can automatically adapt to the specific characteristic of each container without human efforts. The key idea of is to use deep reinforcement learning (DRL) that automatically infers the most suitable configuration for each container. To fully embrace the advantages of DRL in our context, addresses two technical challenges. First, uses a lightweight system monitoring mechanism to collect container status. In this way, it minimizes the monitoring overhead while ensuring a timely reaction to system load changes. Second, injects synthetic extreme data when training its models. Thus, its model gains knowledge on unseen special events and hence remains highly available in extreme scenarios. To guarantee model convergence with the injected training data, adopts task-specific curriculum learning to train the model from normal data to extreme data gradually. has been deployed in the production of for two years, serving more than 50 000 containers and around 300 types of microservice applications. Experimental results show that can well adapt to three common scenarios in the production environment. It effectively achieves better system availability and shorter request response time compared with four state-of-the-art rate limiters.

9 January 2024 in IEEE/ACM Transactions on Networking
Verified
Journal Article
Closed access
HSHaifeng Sun
Haifeng Sun
QHQun Huang
Qun Huang
PLPatrick P. C. Lee
Patrick P. C. Lee
WBWei Bai
Wei Bai
FZFeng Zhu
Feng Zhu
YBYungang Bao
Yungang Bao
Network telemetry is essential for administrators to monitor massive data traffic in a network-wide manner. Existing telemetry solutions often face the dilemma between resource efficiency (i.e., low CPU, memory, and bandwidth overhead) and full accuracy (i.e., error-free and holistic measurement). We break this dilemma via a network-wide architectural design, which simultaneously achieves resource efficiency and full accuracy in flow-level telemetry for large-scale data centers. carefully coordinates the collaboration among different types of entities in the whole network to execute telemetry operations, such that the resource constraints of each entity are satisfied without compromising full accuracy. It further addresses consistency in network-wide epoch synchronization and accountability in error-free packet loss inference. We prototype in DPDK and P4. Testbed experiments on commodity servers and Tofino switches demonstrate the effectiveness of over state-of-the-art solutions.

31 May 2022 in Journal of Computer Science and Technology
Verified
Journal Article
Closed access
PDF file
TXTian-Ni Xu
Tian-Ni Xu
HSHai-Feng Sun
Hai-Feng Sun
DZDi Zhang
Di Zhang
XZXiao-Ming Zhou
Xiao-Ming Zhou
XSXiu-Feng Sui
Xiu-Feng Sui
YBYun-Gang Bao
Yun-Gang Bao

4 September 2024
Verified
Conference Paper
Open access
ZCZihao Chang
Zihao Chang
JLJihan Lin
Jihan Lin
HSHaifeng Sun
Haifeng Sun
RLRunkuang Li
Runkuang Li
YWYing Wang
Ying Wang
SWSa Wang
Sa Wang
The return-oriented programming (ROP) is a prevalent code reuse attack. It exploits vulnerabilities such as stack overflows to hijack the execution flow into the carefully chosen instruction snippet (called gadget) chain already in the memory. Address Space Layout Randomization (ASLR) is widely used to defend against code reuse attacks like ROP from hijacking control flow. However, the Linux kernel, especially the most vulnerable kernel module, only applies basic coarsegrained load-time ASLR methods. This is far from sufficient to defend against new ROP attacks. In this paper, we propose Chaos, a fine-grained runtime architecture-independent ASLR for the kernel module. Chaos adopts function granularity randomization to increase randomization entropy. It continuously performs randomization during runtime to invalidate memory disclosure. To reduce overhead, Chaos only suspends the kernel module and minimizes the running state migration efforts. We implement Chaos based on Linux 5.10 LTS on ARM64 and evaluate it using two common benchmarks. The result demonstrates that Chaos achieves fine-grained runtime ASLR for protecting kernel modules with 5% performance overhead degradation at most.

26 April 2026
Verified
Conference Paper
Open access
YYYihan Yang
Yihan Yang
HSHaifeng Sun
Haifeng Sun
AKAntoine Kaufmann
Antoine Kaufmann
JLJialin Li
Jialin Li