Wendi Feng

Prof. Dr. Wendi Feng

orcid

Research Focus & Metrics

Academic Career Length

8Years (2019-Present)

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

Representative Publications

View All Publications
1 March 2021 in Journal of Network and Computer Applications
Verified
Journal Article
Closed access
WFWendi Feng
Wendi Feng
CLChuanchang Liu
Chuanchang Liu
BCBo Cheng
Bo Cheng
JCJunliang Chen
Junliang Chen

22 September 2022 in IEEE Transactions on Network and Service Management
Verified
Journal Article
Closed access
WFWendi Feng
Wendi Feng
CLChuanchang Liu
Chuanchang Liu
BCBo Cheng
Bo Cheng
JCJunliang Chen
Junliang Chen
ZWZhiguo Wan
Zhiguo Wan
Security is critical to networks, but TCP/IP-based legacy networks are difficult to advance new security functions due to the use of costly inflexible hardware devices and error-prone network configurations. Recent literature explores the paradigm of consolidating security services with the forwarding functionality using Software-defined Networking (SDN). Existing full SDN deployment, replacing all legacy network devices with SDN devices, is cost-prohibitive. Whereas the hybrid SDN that only upgrades partial legacy devices to SDN switches is considered practical. However, the challenge is to minimize threats and deployment expenses simultaneously under heterogeneous end-host businesses that have various importance. In this paper, we study the challenge and propose the (EASON) problem. We mathematically formulate the EASON problem as an integer programming problem, prove its non-polynomial time complexity, and propose a heuristic algorithm called BonSéc. We conduct rigorous simulations on real-world topologies and traces. Experimental results show that BonSéc achieves comparable security and cost performances to the optimal solution on small topologies. Meanwhile, it is scalable on larger topologies.

19 February 2025 in IEEE Internet of Things Journal
Verified
Journal Article
Closed access
WFWendi Feng
Wendi Feng
XDXintan Dou
Xintan Dou
ATAmir Taherkordi
Amir Taherkordi
BCBo Cheng
Bo Cheng
WZWei Zhang
Wei Zhang
Measurement data obtained from “things” in the Internet of Things (IoT) faces challenges in efficient transmission due to the low-bandwidth data transmission link.We observe that measurement data are fixed in size and format, and low-entropy in the time domain, indicating that compression can be benefited. Rather than employing a single compression algorithm as advocated in existing literature, we argue that optimal transmission can be achieved by jointly considering compression overheads and network status, where software-defined networking (SDN) is employed to enforce network statistics and packet forwarding. This paper presents a new paradigm that achieves optimal transmission of SDN-empowered compressed measurement data. We formulate the problem as an optimization problem and prove its non-polynomial hardness time complexity. Due to this complexity, we introduce COMPRESSO, a heuristic algorithm that efficiently solves the problem. We conduct rigorous simulations, and the results demonstrate the efficiency of the new paradigm and COMPRESSO, i.e., attaining comparable performance to the optimal solution with 50% time usage reduction.


1 November 2024 in Applied Sciences
Verified
Journal Article
Open access
PDF file
DGDongchao Guo
Dongchao Guo
LJLibo Jiao
Libo Jiao
WFWendi Feng
Wendi Feng
The modeling and analysis of epidemic processes in networks have attracted much attention over the past few decades. A major underlying assumption is that the recovery process and infection process are homogeneous, allowing the associated theoretical studies to be conducted in a convenient manner. However, the recovery and infection processes usually exhibit heterogeneous rates in the real world, which makes it difficult to characterize the general relations between the dynamics and the underlying network structure. In this work, we focus on the susceptible–infected–susceptible (SIS) epidemic process with heterogeneous recovery rates in a finite-size complete graph. Specifically, we study the metastable-state statistical properties of SIS epidemic dynamics with two different nodal recovery rates in complete graphs. We propose approximate solutions to the metastable-state expectation and the variance in the number of infected nodes within the framework of the mean-field approximation method. We also derive several upper and lower bounds of the steady-state probability that a node is in the infected state. We verify the proposed approximate solutions of the mean and variance via simulations. This work provides insights into the fluctuations in the statistical properties of epidemic processes with complex dynamical behaviors in networks.

21 June 2024 in Journal of Network and Computer Applications
Verified
Journal Article
Closed access
WFWendi Feng
Wendi Feng
KLKe Liu
Ke Liu
SSShuo Sun
Shuo Sun
BCBo Cheng
Bo Cheng
WZWei Zhang
Wei Zhang