Guanglei Li
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Guanglei Li has a total of 20 co-authors. Here are the top co-authors by number of shared publications:
- Bohao Feng
Beijing Jiaotong University
3 shared publications - Guanwen Li
School of Electronic and Information Engineering, Beijing Jiaotong University, Beijing, China
2 shared publications Huachun Zhou
School of Electronic and Information Engineering, Beijing Jiaotong University, Beijing, China
2 shared publications- Xingxu Huang
The Key Laboratory of Pancreatic Diseases of Zhejiang Province the First Affiliated Hospital Zhejiang University School of Medicine Hangzhou China
2 shared publications - Chengcheng Zhao
Central Laboratory, Translational Medicine Research Center, The Affiliated Jiangning Hospital with Nanjing Medical University, Nanjing, China
1 shared publication Dandan Wang
State Key Laboratory of Agrobiotechnology, China Agricultural University, Beijing, 100093, China; College of Biological Sciences, China Agricultural University, Beijing, 100093, China
1 shared publication
Latest Publications
- Open Access
- 27 March 2023
- Published by Frontiers Media SA in Frontiers in Immunology
- Vol. 14, 1111777
Advances in CRISPR/Cas gene therapy for inborn errors of immunity
Inborn errors of immunity (IEIs) are a group of inherited disorders caused by mutations in the protein-coding genes involved in innate and/or adaptive immunity. Hematopoietic stem cell transplantation (HSCT) is a mainstay definitive therapy for many severe IEIs. However, the lack of HLA-matched donors increases the risk of developing severe immunological complications. Gene therapy provides long-term clinical benefits and could be an attractive therapeutic strategy for IEIs. In this review, we describe the development and evolution of clustered regularly interspaced short palindromic repeat (CRISPR)/CRISPR-associated proteins (Cas) gene-editing systems, including double-strand break (DSB)-based gene editing and DSB-free base editing or prime editing systems. Here, we discuss the advances in and issues associated with CRISPR/Cas gene editing tools and their potential as therapeutic alternatives for IEIs. We also highlight the progress of preclinical studies for the treatment of human genetic diseases, including IEIs, using CRISR/Cas and ongoing clinical trials based on this versatile technology.
- 27 March 2023
- Published by Frontiers Media SA in Frontiers in Immunology
- Vol. 14, 1111777
Open AccessAdvances in CRISPR/Cas gene therapy for inborn errors of immunity
Inborn errors of immunity (IEIs) are a group of inherited disorders caused by mutations in the protein-coding genes involved in innate and/or adaptive immunity. Hematopoietic stem cell transplantation (HSCT) is a mainstay definitive therapy for many severe IEIs. However, the lack of HLA-matched donors increases the risk of developing severe immunological complications. Gene therapy provides long-term clinical benefits and could be an attractive therapeutic strategy for IEIs. In this review, we describe the development and evolution of clustered regularly interspaced short palindromic repeat (CRISPR)/CRISPR-associated proteins (Cas) gene-editing systems, including double-strand break (DSB)-based gene editing and DSB-free base editing or prime editing systems. Here, we discuss the advances in and issues associated with CRISPR/Cas gene editing tools and their potential as therapeutic alternatives for IEIs. We also highlight the progress of preclinical studies for the treatment of human genetic diseases, including IEIs, using CRISR/Cas and ongoing clinical trials based on this versatile technology.
- Open Access
- 1 March 2020
- Published by Elsevier in Journal of Genetics and Genomics
WITHDRAWN: Porcine reproductive and respiratory syndrome virus (PRRSV) inhibition with engineered Cas13d
- 1 March 2020
- Published by Elsevier in Journal of Genetics and Genomics
Open AccessWITHDRAWN: Porcine reproductive and respiratory syndrome virus (PRRSV) inhibition with engineered Cas13d
- 23 December 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Cloud Computing
- Vol. 10 (1) , 383-395
Efficient Provision of Service Function Chains in Overlay Networks Using Reinforcement Learning
Software-Defined Networking (SDN) and Network Functions Virtualization (NFV) technologies facilitate deploying Service Function Chains (SFCs) at clouds in efficiency and flexibility. However, it is still challenging to efficiently chain Virtualized Network Functions (VNFs) in overlay networks without knowledge of underlying network configurations. Although there are many deterministic approaches for VNF placement and chaining, they have high complexity and depend on state information of substrate networks. Fortunately, Reinforcement Learning (RL) brings opportunities to alleviate this challenge as it can learn to make suitable decisions without prior knowledge. Therefore, in this article, we propose an RL approach for efficient SFC provision in overlay networks, where the same VNFs provided by multiple vendors are with different performance. Specifically, we first formulate the problem into an Integer Linear Programming (ILP) model for benchmarking. Then, we present the online SFC path selection into a Markov Decision Process (MDP) and propose a corresponding policy-gradient-based solution. Finally, we evaluate our proposed approach with extensive simulations with randomly generated SFC requests and a real-world video streaming dataset, and implement an emulation system for feasibility verification. Related results demonstrate that performance of our approach is close to the ILP-based method and better than deep Q-learning, random, and load-least-greedy methods.
- 23 December 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Cloud Computing
- Vol. 10 (1) , 383-395
Efficient Provision of Service Function Chains in Overlay Networks Using Reinforcement Learning
Software-Defined Networking (SDN) and Network Functions Virtualization (NFV) technologies facilitate deploying Service Function Chains (SFCs) at clouds in efficiency and flexibility. However, it is still challenging to efficiently chain Virtualized Network Functions (VNFs) in overlay networks without knowledge of underlying network configurations. Although there are many deterministic approaches for VNF placement and chaining, they have high complexity and depend on state information of substrate networks. Fortunately, Reinforcement Learning (RL) brings opportunities to alleviate this challenge as it can learn to make suitable decisions without prior knowledge. Therefore, in this article, we propose an RL approach for efficient SFC provision in overlay networks, where the same VNFs provided by multiple vendors are with different performance. Specifically, we first formulate the problem into an Integer Linear Programming (ILP) model for benchmarking. Then, we present the online SFC path selection into a Markov Decision Process (MDP) and propose a corresponding policy-gradient-based solution. Finally, we evaluate our proposed approach with extensive simulations with randomly generated SFC requests and a real-world video streaming dataset, and implement an emulation system for feasibility verification. Related results demonstrate that performance of our approach is close to the ILP-based method and better than deep Q-learning, random, and load-least-greedy methods.
- Open Access
- 18 June 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 6, 34976-34991
Context-Aware Service Function Chaining and Its Cost-Effective Orchestration in Multi-Domain Networks
The emergence of software-defined networking (SDN) and network function virtualization (NFV) facilitates policy-driven and dynamic service function chaining (SFC). In recent years, multi-domain SFC orchestration has attracted a significant attention, as it is a complicated problem involving many issues, such as corporation of various administrations and integration of heterogeneous underlying technologies. However, as another critical problem for multi-domain SFC deployment, how to achieve context-aware service provision is still not widely discussed. Thus, in this paper, based on the hierarchical SFC architecture, we allocate metadata to share context information of packets and realize context-based and dynamic SFC in multi-domain networks. We design typical use cases and conduct related experiments about location-aware flow steering and denial of service attack elimination. Experimental results confirm the feasibility and elasticity of our proposed approach. Furthermore, to alleviate the resource over-provisioning problem of context-aware SFC orchestration, we propose a consolidation-based SF placement and chaining algorithm with an online feedback mechanism. We compare the performance of our algorithm with a related greedy algorithm and a tabu search algorithm. Simulation results demonstrate that the proposed algorithm is efficient to reduce the reject rate and improve the revenue-cost ratio, with a compromise on node load balance.
- 18 June 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 6, 34976-34991
Open AccessContext-Aware Service Function Chaining and Its Cost-Effective Orchestration in Multi-Domain Networks
The emergence of software-defined networking (SDN) and network function virtualization (NFV) facilitates policy-driven and dynamic service function chaining (SFC). In recent years, multi-domain SFC orchestration has attracted a significant attention, as it is a complicated problem involving many issues, such as corporation of various administrations and integration of heterogeneous underlying technologies. However, as another critical problem for multi-domain SFC deployment, how to achieve context-aware service provision is still not widely discussed. Thus, in this paper, based on the hierarchical SFC architecture, we allocate metadata to share context information of packets and realize context-based and dynamic SFC in multi-domain networks. We design typical use cases and conduct related experiments about location-aware flow steering and denial of service attack elimination. Experimental results confirm the feasibility and elasticity of our proposed approach. Furthermore, to alleviate the resource over-provisioning problem of context-aware SFC orchestration, we propose a consolidation-based SF placement and chaining algorithm with an online feedback mechanism. We compare the performance of our algorithm with a related greedy algorithm and a tabu search algorithm. Simulation results demonstrate that the proposed algorithm is efficient to reduce the reject rate and improve the revenue-cost ratio, with a compromise on node load balance.
- Open Access
- 1 March 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 6, 13653-13662
Rule Anomaly-Free Mechanism of Security Function Chaining in 5G
To meet the urgent security demands, 5G aims to deploy virtualized and programmable security services and defense potential threats in real time. With the development of Network Function Virtualization and Software-Defined Networking, security functions can be dynamically and flexibly chained to cope with many types of malicious attacks. Although there are a number of studies on security function chaining for 5G, they primarily focus on the security function composition, rather than rule enforcement. In fact, the misconfiguration of rules for security functions is notably common because of the security function diversity and rule heterogeneity that causes many unexpected and serious problems. Therefore, in this paper, we propose a priority-based anomaly-free mechanism with defined security rule anomalies. To avoid misconfiguration, we also propose and implement a simply configured rule management framework with anomaly resolution. With extensive performance evaluations, we show the availability and efficiency of our proposed mechanism to resolve security rule anomalies.
- 1 March 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 6, 13653-13662
Open AccessRule Anomaly-Free Mechanism of Security Function Chaining in 5G
To meet the urgent security demands, 5G aims to deploy virtualized and programmable security services and defense potential threats in real time. With the development of Network Function Virtualization and Software-Defined Networking, security functions can be dynamically and flexibly chained to cope with many types of malicious attacks. Although there are a number of studies on security function chaining for 5G, they primarily focus on the security function composition, rather than rule enforcement. In fact, the misconfiguration of rules for security functions is notably common because of the security function diversity and rule heterogeneity that causes many unexpected and serious problems. Therefore, in this paper, we propose a priority-based anomaly-free mechanism with defined security rule anomalies. To avoid misconfiguration, we also propose and implement a simply configured rule management framework with anomaly resolution. With extensive performance evaluations, we show the availability and efficiency of our proposed mechanism to resolve security rule anomalies.