Tao Li
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Interests
Tao Li has a total of 9 co-authors. Here are the top co-authors by number of shared publications:
- Baosheng Wang
National University of Defense Technology
1 shared publication Bingqing Liu
Beijing University of Posts and Telecommunications
1 shared publication- Chenglong Li
National Innovation Institute of Defense Technology, Academy of Military Sciences, Beijing, China
1 shared publication - Gaogang Xie
Computer Network Information Center, Chinese Academy of Sciences, Beijing, China
1 shared publication - Junnan Li
Computer College, National University of Defense Technology, Changsha 410073, China
1 shared publication Tong Yang
Peking University
1 shared publication
Latest Publications
- 29 March 2025
- Published by Springer Nature
- p. 337-350
2FA Sketch: Two-Factor Armor Sketch for Accurate and Efficient Heavy Hitter Detection in Data Streams
- 29 March 2025
- Published by Springer Nature
- p. 337-350
2FA Sketch: Two-Factor Armor Sketch for Accurate and Efficient Heavy Hitter Detection in Data Streams
- Open Access
- 11 April 2020
- Published by MDPI AG in Sustainability
- Vol. 12 (8) , 3068
Enabling Packet Classification with Low Update Latency for SDN Switch on FPGA
Field Programmable Gate Array (FPGA) is widely used in real-time network processing such as Software-Defined Networking (SDN) switch due to high performance and programmability. Bit-Vector (BV)-based approaches can implement high-performance multi-field packet classification, on FPGA, which is the core function of the SDN switch. However, the SDN switch requires not only high performance but also low update latency to avoid controller failure. Unfortunately, the update latency of BV-based approaches is inversely proportional to the number of rules, which means can hardly support the SDN switch effectively. It is reasonable to split the ruleset into sub-rulesets that can be performed in parallel, thereby reducing update latency. We thus present SplitBV for the efficient update by using several distinguishable exact-bits to split the ruleset. SplitBV consists of a constrained recursive algorithm for selecting the bit positions that can minimize the latency and a hybrid lookup pipeline. It can achieve a significant reduction in update latency with negligible memory growth and comparable high performance. We implement SplitBV and evaluate its performance by simulation and FPGA prototype. Experimental results show that our approach can reduce 73% and 36% update latency on average for synthetic 5-tuple rules and OpenFlow rules respectively.
- 11 April 2020
- Published by MDPI AG in Sustainability
- Vol. 12 (8) , 3068
Open AccessEnabling Packet Classification with Low Update Latency for SDN Switch on FPGA
Field Programmable Gate Array (FPGA) is widely used in real-time network processing such as Software-Defined Networking (SDN) switch due to high performance and programmability. Bit-Vector (BV)-based approaches can implement high-performance multi-field packet classification, on FPGA, which is the core function of the SDN switch. However, the SDN switch requires not only high performance but also low update latency to avoid controller failure. Unfortunately, the update latency of BV-based approaches is inversely proportional to the number of rules, which means can hardly support the SDN switch effectively. It is reasonable to split the ruleset into sub-rulesets that can be performed in parallel, thereby reducing update latency. We thus present SplitBV for the efficient update by using several distinguishable exact-bits to split the ruleset. SplitBV consists of a constrained recursive algorithm for selecting the bit positions that can minimize the latency and a hybrid lookup pipeline. It can achieve a significant reduction in update latency with negligible memory growth and comparable high performance. We implement SplitBV and evaluate its performance by simulation and FPGA prototype. Experimental results show that our approach can reduce 73% and 36% update latency on average for synthetic 5-tuple rules and OpenFlow rules respectively.