Jun Li
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Jun Li has a total of 40 co-authors. Here are the top co-authors by number of shared publications:
- Chengjun Jia
Department of Automation, Tsinghua University, Beijing, China
2 shared publications Kai Wang
Yunshan Networks, Beijing, China
2 shared publicationsXiaohe Hu
Department of Computer Science and Technology, Tsinghua University, Beijing, China
2 shared publications- Bian Lanchun
2 School of Architecture, Tsinghua University, Beijing, China
1 shared publication - Bin Chen
Future Urbanity & Sustainable Environment (FUSE) Lab, Division of Landscape Architecture, Faculty of Architecture, The University of Hong Kong, Hong Kong SAR, China
1 shared publication Buyi Qiu
Yunshan Networks, Beijing 100084, Peoples R China
1 shared publication
Latest Publications
- 10 October 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. 74 (1) , 263-277
A Heterogeneous and Adaptive Architecture for Decision-Tree-Based ACL Engine on FPGA
Access Control Lists (ACLs) are crucial for ensuring the security and integrity of modern cloud and carrier networks by regulating access to sensitive information and resources. However, previous software and hardware implementations no longer meet the requirements of modern datacenters. The emergence of FPGA-based SmartNICs presents an opportunity to offload ACL functions from the host CPU, leading to improved network performance in datacenter applications. However, previous FPGA-based ACL designs lacked the necessary flexibility to support different rulesets without hardware reconfiguration while maintaining high performance. In this paper, we propose HACL, a heterogeneous and adaptive architecture for decision-tree-based ACL engine on FPGA. By employing techniques such as tree decomposition and recirculated pipeline scheduling, HACL can accommodate various rulesets without reconfiguring the underlying architecture. To facilitate the efficient mapping of different decision trees to memory and optimize the throughput of a ruleset, we also introduce a heterogeneous framework with a compiler in CPU platform for HACL. We implement HACL on a typical SmartNIC and evaluate its performance. The results demonstrate that HACL achieves a throughput exceeding 260 Mpps when processing 100K-scale ACL rulesets, with low hardware resource utilization. By integrating more engines, HACL can achieve even higher throughput and support larger rulesets.
- 10 October 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. 74 (1) , 263-277
A Heterogeneous and Adaptive Architecture for Decision-Tree-Based ACL Engine on FPGA
Access Control Lists (ACLs) are crucial for ensuring the security and integrity of modern cloud and carrier networks by regulating access to sensitive information and resources. However, previous software and hardware implementations no longer meet the requirements of modern datacenters. The emergence of FPGA-based SmartNICs presents an opportunity to offload ACL functions from the host CPU, leading to improved network performance in datacenter applications. However, previous FPGA-based ACL designs lacked the necessary flexibility to support different rulesets without hardware reconfiguration while maintaining high performance. In this paper, we propose HACL, a heterogeneous and adaptive architecture for decision-tree-based ACL engine on FPGA. By employing techniques such as tree decomposition and recirculated pipeline scheduling, HACL can accommodate various rulesets without reconfiguring the underlying architecture. To facilitate the efficient mapping of different decision trees to memory and optimize the throughput of a ruleset, we also introduce a heterogeneous framework with a compiler in CPU platform for HACL. We implement HACL on a typical SmartNIC and evaluate its performance. The results demonstrate that HACL achieves a throughput exceeding 260 Mpps when processing 100K-scale ACL rulesets, with low hardware resource utilization. By integrating more engines, HACL can achieve even higher throughput and support larger rulesets.
- Open Access
- 24 January 2024
- Published by MDPI AG in Remote Sensing
- Vol. 16 (3) , 456
Municipal and Urban Renewal Development Index System: A Data-Driven Digital Analysis Framework
Urban renewal planning and development are vital for enhancing the living quality of city residents. However, such improvement activities are often expensive, time-consuming, and in need of standardization. The convergence of remote sensing technologies, social big data, and artificial intelligence solutions has created unprecedented opportunities for comprehensive digital planning and analysis in urban renewal development and management. However, fast interdisciplinary development imposes some challenges because the data collected and the solutions built are defined piece by piece and require further fusion and integration of knowledge, evaluation standards, systematic analyses, and new methodologies. To address these challenges, we propose a municipal and urban renewal development index (MUDI) system with data modeling and mathematical analysis models. The MUDI system is applied and studied in three circumstances: (1) at regional level, 337 cities are selected in China to demonstrate the MUDI system’s comparable analysis capabilities on a large scale across cities; (2) at city level, 285 residential communities are selected in Xiamen to demonstrate the use of remote sensing data as key MUDIs for a temporal urban land change analysis; and (3) at the level of residential neighborhoods’ urban renewal practices, Xiamen’s Yingping District is selected to demonstrate the MUDI system’s project management capabilities. We find that the MUDI system is highly effective in municipal and urban data model building through the abstraction and summation of grid-based satellite and social big data. Secondly, the MUDI system enables comprehension of the high dimensionality and complexity of multisource datasets for municipal and urban renewal development. Thirdly, the system is applied to enable the use of the newly developed UMAP algorithm, a model based on Riemannian geometry and algebraic topology, and the carrying out of a principal component analysis for the key dimensions and an index correlation analysis. Fourthly, various artificial intelligence-driven algorithms can be developed for urban renewal analyses based on the MUDIs. The MUDI system is a new and effective method for urban renewal planning and management that can be flexibly extended and applied to various cities and urban districts.
- 24 January 2024
- Published by MDPI AG in Remote Sensing
- Vol. 16 (3) , 456
Open AccessMunicipal and Urban Renewal Development Index System: A Data-Driven Digital Analysis Framework
Urban renewal planning and development are vital for enhancing the living quality of city residents. However, such improvement activities are often expensive, time-consuming, and in need of standardization. The convergence of remote sensing technologies, social big data, and artificial intelligence solutions has created unprecedented opportunities for comprehensive digital planning and analysis in urban renewal development and management. However, fast interdisciplinary development imposes some challenges because the data collected and the solutions built are defined piece by piece and require further fusion and integration of knowledge, evaluation standards, systematic analyses, and new methodologies. To address these challenges, we propose a municipal and urban renewal development index (MUDI) system with data modeling and mathematical analysis models. The MUDI system is applied and studied in three circumstances: (1) at regional level, 337 cities are selected in China to demonstrate the MUDI system’s comparable analysis capabilities on a large scale across cities; (2) at city level, 285 residential communities are selected in Xiamen to demonstrate the use of remote sensing data as key MUDIs for a temporal urban land change analysis; and (3) at the level of residential neighborhoods’ urban renewal practices, Xiamen’s Yingping District is selected to demonstrate the MUDI system’s project management capabilities. We find that the MUDI system is highly effective in municipal and urban data model building through the abstraction and summation of grid-based satellite and social big data. Secondly, the MUDI system enables comprehension of the high dimensionality and complexity of multisource datasets for municipal and urban renewal development. Thirdly, the system is applied to enable the use of the newly developed UMAP algorithm, a model based on Riemannian geometry and algebraic topology, and the carrying out of a principal component analysis for the key dimensions and an index correlation analysis. Fourthly, various artificial intelligence-driven algorithms can be developed for urban renewal analyses based on the MUDIs. The MUDI system is a new and effective method for urban renewal planning and management that can be flexibly extended and applied to various cities and urban districts.
- 16 December 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Network and Service Management
- Vol. 20 (3) , 3747-3764
Kano: Efficient Cloud Native Network Policy Verification
Cloud-native computing has become a prevailing paradigm with lightweight runtime-level isolation and fast delivery for scalable applications. Cloud-native network policies (CNNPs) are used to realize network isolation with respect to security and availability. Due to the dynamic environment, CNNPs are label-based instead of IP-based and take the form of attribute-based access control (ABAC) to obtain good expressivity. To ensure the correctness of network isolation, CNNP verification is an essential but challenging problem given the large scale and frequent updates of cloud-native environments and the operation automation demand. Thus, we design Kano, an efficient, i.e., easy-to-use and fast-to-execute, system for verifying large scale CNNPs at runtime. Kano is operation-friendly, with a proposed intent-based verification language. A bit matrix model with a prefiltration algorithm and a partial-update method is proposed to support fast complete and incremental verification. Kano also generates fix plans for violations to assist operators. Kano is implemented as a CNNP verification system that is used in ABAC cloud-native platforms and is integrated into the popular Kubernetes orchestrator. An evaluation on a large scale network of 100k nodes and about 68k policies shows the efficiency of Kano, with 12.51 seconds for all reachable invariant verification and 0.299 milliseconds for policy addition verification.
- 16 December 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Network and Service Management
- Vol. 20 (3) , 3747-3764
Kano: Efficient Cloud Native Network Policy Verification
Cloud-native computing has become a prevailing paradigm with lightweight runtime-level isolation and fast delivery for scalable applications. Cloud-native network policies (CNNPs) are used to realize network isolation with respect to security and availability. Due to the dynamic environment, CNNPs are label-based instead of IP-based and take the form of attribute-based access control (ABAC) to obtain good expressivity. To ensure the correctness of network isolation, CNNP verification is an essential but challenging problem given the large scale and frequent updates of cloud-native environments and the operation automation demand. Thus, we design Kano, an efficient, i.e., easy-to-use and fast-to-execute, system for verifying large scale CNNPs at runtime. Kano is operation-friendly, with a proposed intent-based verification language. A bit matrix model with a prefiltration algorithm and a partial-update method is proposed to support fast complete and incremental verification. Kano also generates fix plans for violations to assist operators. Kano is implemented as a CNNP verification system that is used in ABAC cloud-native platforms and is integrated into the popular Kubernetes orchestrator. An evaluation on a large scale network of 100k nodes and about 68k policies shows the efficiency of Kano, with 12.51 seconds for all reachable invariant verification and 0.299 milliseconds for policy addition verification.
- 4 February 2022
- Published by Springer Nature in Mobile Networks and Applications
- Vol. 27 (4) , 1642-1658
JOSP: Joint Optimization of Flow Path Scheduling and Virtual Network Function Placement for Delay-Sensitive Applications
- 4 February 2022
- Published by Springer Nature in Mobile Networks and Applications
- Vol. 27 (4) , 1642-1658
JOSP: Joint Optimization of Flow Path Scheduling and Virtual Network Function Placement for Delay-Sensitive Applications
- 1 August 2021
- Published by Tsinghua University Press in Tsinghua Science and Technology
- Vol. 26 (4) , 452-463
Trident: Efficient and practical software network monitoring
- 1 August 2021
- Published by Tsinghua University Press in Tsinghua Science and Technology
- Vol. 26 (4) , 452-463
Trident: Efficient and practical software network monitoring
- 15 February 2011
- Published by Elsevier in Computer Communications
- Vol. 34 (2) , 200-208
OpenGate: Towards an open network services gateway
- 15 February 2011
- Published by Elsevier in Computer Communications
- Vol. 34 (2) , 200-208
OpenGate: Towards an open network services gateway
- 1 July 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 19457871,p. 2154-2157
Empirical Study on Multi-Path Benefits on Interactive Video
The oncoming prosperity of interactive multimedia application triggers significant challenge to current best-effort Internet because of the dynamic and unpredictable available bandwidth, end-to-end delay, and packet loss. Recently, overlay technique has emerged as an approach to help mitigating these problems. In order to understand the potential benefits of using multi-path provided by overlay network to interactive video, this paper examines the performance of two special multi-path deliver schemes - dual-path mesh and dual-path round robin, and compares their metrics of round-trip delay, packet loss, one-way delay jitter to the direct Internet path by analyzing 7 days of data collected from 102 geographically diverse PlanetLab nodes. By mapping the collected data with MPEG-4 coded "Foreman" video sequence, the paper also presents multi-path benefit on peak signal-to-noise ratio (PSNR).
- 1 July 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 19457871,p. 2154-2157
Empirical Study on Multi-Path Benefits on Interactive Video
The oncoming prosperity of interactive multimedia application triggers significant challenge to current best-effort Internet because of the dynamic and unpredictable available bandwidth, end-to-end delay, and packet loss. Recently, overlay technique has emerged as an approach to help mitigating these problems. In order to understand the potential benefits of using multi-path provided by overlay network to interactive video, this paper examines the performance of two special multi-path deliver schemes - dual-path mesh and dual-path round robin, and compares their metrics of round-trip delay, packet loss, one-way delay jitter to the direct Internet path by analyzing 7 days of data collected from 102 geographically diverse PlanetLab nodes. By mapping the collected data with MPEG-4 coded "Foreman" video sequence, the paper also presents multi-path benefit on peak signal-to-noise ratio (PSNR).