Wenjun Li

Wenjun Li

Auto-generated profile, based on publicly available information

Wenjun Li

Pengcheng Laboratory, Shenzhen, China

Research Focus & Metrics

Academic Career Length

10Years (2017-Present)

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

Representative Publications

View All Publications
10 April 2020 in IEEE Journal on Selected Areas in Communications
Verified
Journal Article
Closed access
WLWenjun Li
Wenjun Li
TYTong Yang
Tong Yang
OROri Rottenstreich
Ori Rottenstreich
Xianfeng LiXianfeng Li
Xianfeng Li
GXGaogang Xie
Gaogang Xie
HLHuiping Lin
Huiping Lin
Software switches are being deployed in SDN to enable a wide spectrum of non-traditional applications. The popular Open vSwitch uses a variant of Tuple Space Search (TSS) for packet classifications. Although it has good performance on rule updates, it is less efficient than decision trees on lookups. In this paper, we propose a two-stage framework consisting of heterogeneous algorithms to adaptively exploit different characteristics of the rule sets at different scales. In the first stage, partial decision trees are constructed from several rule subsets grouped with respect to their small fields. This grouping eliminates rule replications at large scales, thereby enabling very efficient precuttings. The second stage handles packet classification at small scales for non-leaf terminal nodes, where rule replications within each subspace may lead to inefficient cuttings. A salient fact is that small space means long address prefixes or less nesting levels of ranges, both indicating a very limited tuple space. To exploit this favorable property, we employ a TSS-based algorithm for these subsets following tree constructions. Experimental results show that our work has comparable update performance to TSS in Open vSwitch, while achieving almost an order-of-magnitude improvement on classification performance over TSS.

2 January 2023 in IEEE/ACM Transactions on Networking
Verified
Journal Article
Closed access
QSQilong Shi
Qilong Shi
YXYuchen Xu
Yuchen Xu
JQJiuhua Qi
Jiuhua Qi
WLWenjun Li
Wenjun Li
TYTong Yang
Tong Yang
YWYi Wang
Yi Wang
Frequency estimation and top-k flows identification are fundamental problems in network traffic measurement. Sketch, as a basic probabilistic data structure, has been extensively investigated and used in different management applications. However, few of them is suitable for both estimating frequency and finding top-k flows due to the unbalanced distribution of real-world network streams. By introducing a pre-filtering stage to isolate elephant and mice flows, the recently proposed Augmented Sketch (ASketch) significantly improves accuracy for both tasks. However, it suffers from serious performance degradation because of frequent flow exchanges. In this paper, we propose Cuckoo Counter (CC), an adaptive structure that consists of several buckets organized in a specific way. The size of the entry in each bucket is carefully designed to match the actual distribution of streams. During processing, CC hashes a flow to buckets and uses the idea of cuckoo hashing to relocate the flow if an overflow or collision happens, which contributes to fully utilizing memory. Therefore, the replacement strategy helps CC precisely record elephant flows and cover more mice flows, and also guarantees the throughput. Extensive experimental results show that CC has the highest (Freq.) accuracy, excellent (Heavy hitter / change) accuracy, highest (Top-k) precision, and competitive throughput compared to the state-of-the-art. Specifically, CC improves the throughput and accuracy by around 1 and 2 orders of magnitude respectively compared to the well-known ASketch.

1 January 2017 in Theranostics
Verified
Journal Article
Open access
Kuan HuKuan Hu
Kuan Hu
FYFeng Yin
Feng Yin
MYMengyin Yu
Mengyin Yu
CSChengjie Sun
Chengjie Sun
JLJingxu Li
Jingxu Li
Zigang LiZigang Li
Zigang Li
Inhibition of the interaction between p53 and MDM2/MDMX has attracted significant attention in anticancer therapy development. We designed a series of in-tether chiral center-induced helical stabilized peptides, among which MeR/PhR effectively reactivated p53. The activation of p53 inhibits cell proliferation and induces apoptosis in both the MCF-7 normal tumor cell line and the PA-1 pluripotent cancer cell line with only minimal cellular toxicity towards normal cells or cancer cell lines with p53 mutations. The in vivo bioactivity study of the peptide in the ovarian teratocarcinoma (PA-1) xenograft model showed a tumor growth rate inhibition of 70% with a dosage of 10 mg/kg (one injection every other day). This is the first application of a stabilized peptide modulator targeting stem-like cancer cell both in vitro and in vivo and provides references to cancer stem cell therapy.

16 June 2022 in IEEE/ACM Transactions on Networking
Verified
Journal Article
Closed access
YXYao Xin
Yao Xin
WLWenjun Li
Wenjun Li
GTGuoming Tang
Guoming Tang
TYTong Yang
Tong Yang
XHXiaohe Hu
Xiaohe Hu
YWYi Wang
Yi Wang
OpenFlow switches are being deployed in SDN to enable a wide spectrum of non-traditional applications. As a promising alternative to brutal force TCAMs, FPGA-based packet classification is being actively investigated. However, none of the existing FPGA designs can achieve high performance on both search and update for large-scale rule sets. To address this issue, we propose TcbTree, an FPGA-based algorithmic scheme for packet classification. Specifically, at the algorithmic side, i) a two-stage framework consisting of heterogeneous algorithms is proposed, where most rules can be mapped into several balanced trees without rule replications, ii) for the remaining few rules, a centralized TSS (Tuple Space Search) architecture together with a real-time feedback scheme is designed to enhance the efficiency of TSS search on FPGA, and iii) a tree dilution method is designed to equalize rule distribution in trees, so that the latency of tree search can be reduced. At the hardware side, i) an efficient data structure set is designed to convert tree traversal to addressing process, which breaks the constraints of limited tree depth and imbalanced node distribution, and ii) distinct from fully pipelined designs, multiple levels of parallelism are efficiently explored with multi-core, multi-search-engine and coarse-grained pipelines herein. Experimental results using ClassBench show that, with the implementation of TcbTree on FPGA, the average classification throughputs for 1k, 10k, 32k and 100k rule sets achieve 788.8 MPPS, 404.3 MPPS, 237 MPPS and 41.8 MPPS, respectively, and the update throughput for all benchmark rule sets is above 1 MUPS.

1 June 2019 in IET Communications
Verified
Journal Article
Open access
PDF file
WLWenjun Li
Wenjun Li
Dagang LiDagang Li
Dagang Li
YBYongjie Bai
Yongjie Bai
WLWenxia Le
Wenxia Le
HLHui Li
Hui Li
Multi‐field packet classification is not only an indispensable and challenging functionality of existing network devices, but it also appears as flow tables lying at the heart of the forwarding plane of software defined networking age. Despite almost two decades of research, algorithmic solutions still fall short of meeting the line‐speed of high‐performance network devices. Although decomposition‐based approaches, such as cross‐producting and recursive flow classification (RFC), can achieve high lookup rate by performing a parallel search on chunks of the packet header, both of them suffer from memory explosion problem during aggregation. In this study, the authors propose an HybridRFC, a memory‐efficient recursive scheme for multi‐field packet classification. By addressing the embedded problem of the RFC caused by uncontrollably expanded cross‐product tables, HybridRFC can not only reduce the memory consumption to a practical level but also improve pre‐processing performance significantly. Experimental results show that the memory requirement of HybridRFC is two orders of magnitude less than RFC, as well as three orders of speed‐up on the performance of table building on average.

1 July 2022
Verified
Conference Paper
Open access
YLYuxi Liu
Yuxi Liu
YXYao Xin
Yao Xin
WLWenjun Li
Wenjun Li
HSHaoyu Song
Haoyu Song
OROri Rottenstreich
Ori Rottenstreich
YWYi Wang
Yi Wang
The popular OpenFlow virtual switch Open vSwitch (OVS) uses a variant of Tuple Space Search (TSS) for packet classification. Although it is easy for rule updates, the lookup performance is poor. By introducing partial trees into TSS, the recently proposed CutTSS improves the lookup performance of TSS. However, it is challenging to replace TSS in OVS for two reasons: (1) the hand-tuned partitioning heuristics are rule-set dependent; (2) the complex and irregular data structures make it difficult to be integrated and maintained in real systems. To address these issues, we propose HybridTSS, a recursive TSS scheme for fast packet classification in OVS, which exploits three novel ideas: (1) the recursive partitioning based on reinforcement learning balances global rule partitions with low training complexity; (2) a hybrid TSS scheme combining coarse-grained and fine-grained tuples suppresses tuple explosion in TSS; (3) a heterogeneous search algorithm consisting of TSS and linear search adapts to characteristics of rules at different scales for fast lookups. Using ClassBench, we show that, while immune from the main drawbacks of CutTSS, HybridTSS retains the update performance of TSS, and achieves almost an order of magnitude higher lookup performance than TSS, making it an ideal packet classification algorithm for OVS.