Hongyan Liu

Hongyan Liu

Auto-generated profile, based on publicly available information

Hongyan Liu

Fuzhou University, Fuzhou, Fujian, China

Research Focus & Metrics

Academic Career Length

11Years (2016-Present)

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

Representative Publications

View All Publications
13 September 2022 in IEEE/ACM Transactions on Networking
Verified
Journal Article
Closed access
DKDezhang Kong
Dezhang Kong
YSYi Shen
Yi Shen
XCXiang Chen
Xiang Chen
QCQiumei Cheng
Qiumei Cheng
HLHongyan Liu
Hongyan Liu
CWChunming Wu
Chunming Wu
The topology discovery service in Software-Defined Networking (SDN) provides the controller with a global view of the substrate network topology, allowing for central management of the entire network. Unfortunately, emerging topology attacks can poison the network topology and result in unforeseeable disasters. Although researchers have made great efforts to mitigate this problem, security hazards still exist. In this paper, we propose Invisible Assailant Attack (IAA), the first combination topology attack capable of injecting and maintaining fake links even when 12 existing defense strategies are deployed simultaneously. IAA consists of 14 attack phases that apply multiple attack strategies. Attackers skillfully disguise the attack traffic in each phase so that it looks like normal network traffic, and perform these phases in a well-planned sequence, thereby bypassing existing defenses step by step. To mitigate this attack, we propose a Route Path Verification (RPV) mechanism that orchestrates multiple defense strategies to identify fake links. According to the experiments, RPV can successfully detect IAA with low overhead: its detection completes within 1 ms while its per-flow storage consumption is only a few KB.

4 August 2024
Verified
Conference Paper
Open access
XCXiang Chen
Xiang Chen
QXQingjiang Xiao
Qingjiang Xiao
HLHongyan Liu
Hongyan Liu
QHQun Huang
Qun Huang
DZDong Zhang
Dong Zhang
KRKui Ren
Kui Ren
Sketches are useful for network measurement thanks to their low resource overheads and theoretically bounded accuracy. However, their network-wide deployment suffers from the trade-off between optimality and scalability: (1) Most solutions rely on mixed integer linear programming (MILP) solvers to provide the optimal decisions. But they are time-consuming and can hardly scale to large-scale deployment scenarios. (2) While heuristics achieve scalability, they deteriorate resource and performance overheads. We propose Eagle, a framework that achieves scalable and near-optimal network-wide sketch deployment. Our key idea is to decompose network-wide sketch deployment into sub-problems. Such decomposition allows Eagle to (1) simultaneously optimize switch resource consumption and end-to-end performance (retaining optimality), and (2) incorporate time-saving techniques into sub-problem solving (achieving scalability). Compared to existing solutions, Eagle improves scalability by up to 255× with negligible loss of optimality. It has also saved administrators in a production network days of efforts and reduced the operation time from O(hour) to O(second).

9 February 2022 in IEEE Transactions on Cloud Computing
Verified
Journal Article
Closed access
XCXiang Chen
Xiang Chen
HLHongyan Liu
Hongyan Liu
DZDong Zhang
Dong Zhang
ZMZili Meng
Zili Meng
QHQun Huang
Qun Huang
Qiang YangQiang Yang
Qiang Yang
In network function virtualization (NFV), network functions (NFs) are chained as a service function chain (SFC) to enhance NF management with low cost and high flexibility. Recent NFV solutions indicate that the packet processing performance of SFCs can be significantly improved by offloading NFs to programmable switches. However, such offloading requires a deep understanding of heterogeneous NF properties (e.g., resource consumption) to achieve the maximum SFC performance. Unfortunately, none of existing solutions provide automatic analysis of NF properties. Thus, network administrators have to manually examine the source codes of NFs and profile various NF properties, which is time-consuming and laborious. In this paper, we propose LightNF, a system that simplifies NF offloading in programmable networks. LightNF automatically dissects comprehensive NF properties by means of code analysis and performance profiling while eliminating manual efforts. It then leverages its analysis results of NF properties in its SFC placement so as to make the performance-optimal offloading decisions. We have implemented LightNF on Tofino-based hardware programmable switches. We perform extensive experiments to evaluate LightNF with a real-world testbed and large-scale simulation. Our experiments show that LightNF outperforms state-of-the-art solutions with an orders-of-magnitude reduction in per-packet processing latency and 9.5 improvement in SFC throughput.

23 November 2022 in IEEE/ACM Transactions on Networking
Verified
Journal Article
Closed access
XCXiang Chen
Xiang Chen
HLHongyan Liu
Hongyan Liu
DZDong Zhang
Dong Zhang
QHQun Huang
Qun Huang
HZHaifeng Zhou
Haifeng Zhou
Qiang YangQiang Yang
Qiang Yang
Recent efforts in network measurement place measurement tasks on programmable switches to measure high-speed traffic. These tasks extract flow data, i.e., events, from packets and send events to the control plane. However, the tasks may generate massive events in a short time. In this context, the links transferring events to the control plane and the control plane servers that handle events may be overloaded, i.e., control plane overload. None of existing solutions can eliminate control plane overload. In this paper, we propose, a framework that eliminates control plane overload via careful measurement task placement. Our key idea is to allocate enough resources for each task during task placement to avoid control plane overload at runtime. For each task, estimates its maximum possible rate of sending events to the control plane. Then its optimization framework addresses the resource restrictions of both switches and the control plane. The experiments on Tofino switches indicate that outperforms existing solutions with higher accuracy in several use cases.

20 June 2024 in IEEE/ACM Transactions on Networking
Verified
Journal Article
Closed access
HLHongyan Liu
Hongyan Liu
XCXiang Chen
Xiang Chen
QHQun Huang
Qun Huang
GSGuoqiang Sun
Guoqiang Sun
PWPeiqiao Wang
Peiqiao Wang
Qiang YangQiang Yang
Qiang Yang
Programmable switches allow administrators to customize packet processing behaviors in data plane programs. However, existing solutions for program deployment fail to achieve resource efficiency and high packet processing performance. In this paper, we propose, a system that provides resource-efficient and high-performance deployment for data plane programs. For resource efficiency, merges input data plane programs by reducing program redundancy. Then it abstracts the substrate network into an one big switch (OBS), and deploys the merged program on the OBS while minimizing resource usage. For high performance, searches for the performance-optimal mapping between the OBS and the substrate network with respect to network-wide constraints. It also maintains program logic among different switches via inter-device packet scheduling. We have implemented on a Barefoot Tofino switch. The evaluation indicates that achieves resource-efficient and high-performance deployment for real data plane programs.

13 September 2023 in IEEE Transactions on Information Forensics and Security
Verified
Journal Article
Closed access
XCXiang Chen
Xiang Chen
HLHongyan Liu
Hongyan Liu
QHQun Huang
Qun Huang
DZDong Zhang
Dong Zhang
HZHaifeng Zhou
Haifeng Zhou
MKMuhammad Khurram Khan
Muhammad Khurram Khan
Due to limited memory usage and provably high accuracy, sketches running on programmable switches have been commonly used by the literature for network measurement. However, their vulnerabilities are still largely unknown and neglected, which is highly concerning given the increasing popularity of network measurement. In this paper, we identify the Stalker attacks, where attackers aim to degrade the accuracy of sketches running on programmable switches. More precisely, attackers tamper with some sketch operations during sketch deployment atop programmable switches. At runtime, the tampered sketch will record highly inaccurate flow data, which degrades measurement accuracy. We implement Stalker attacks on Tofino switches. The results indicate that Stalker attacks significantly drop the accuracy of network management applications, e.g., reducing the F1 score of heavy hitter detection to zero. However, our analysis indicates that none of existing methods can detect Stalker attacks since they can hardly verify the correctness of sketch operations. Finally, we analyze potential defense mechanisms and identify challenges to enable further research in this context.