Jianing Pei
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Jianing Pei has a total of 27 co-authors. Here are the top co-authors by number of shared publications:
- Defang Li
Electronic Engineering and Information Science, University of Science and Technology of China, Hefei, Anhui China
4 shared publications - Kaiping Xue
University of Science and Technology of China, Hefei, Anhui, China
4 shared publications - Peilin Hong
CAS Key Laboratory of Wireless-Optical Communications, University of Science and Technology of China, Hefei, China
4 shared publications - Wenjing Tian
State Key Laboratory of Supramolecular Structure and Materials Jilin University Changchun China
2 shared publications A.V. Borisov
Russia Acad Sci, Fed Res Ctr Comp Sci & Control, Moscow, Russia
1 shared publication- Bin Xu
State Key Laboratory of Supramolecular Structure and Materials Jilin University Changchun China
1 shared publication
Latest Publications
- 1 June 2024
- Published by Elsevier in Computer Networks
- Vol. 250
On fair traffic allocation and efficient utilization of network resources based on MARL
- 1 June 2024
- Published by Elsevier in Computer Networks
- Vol. 250
On fair traffic allocation and efficient utilization of network resources based on MARL
- 9 April 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Journal on Selected Areas in Communications
- Vol. 38 (6) , 1102-1117
Two-Phase Virtual Network Function Selection and Chaining Algorithm Based on Deep Learning in SDN/NFV-Enabled Networks
With the advances of Software-Defined Networks (SDN) and Network Function Virtualization (NFV), Service Function Chain (SFC) has been becoming a popular paradigm to carry and complete network services. Such new computing and networking paradigm enables Virtual Network Functions (VNFs) to be placed in software entities/virtual machines over a network of physical equipments in elastic and flexible way with low capital and operation expenses. VNFs are chained together to steer traffic as needed. However, most of the existing traffic steering and routing path computation algorithms for SFC are complex, unscalable, and low time-efficiency. In this paper, we study the VNF Selection and Chaining Problem (VNF-SCP) in SDN/NFV-enabled networks.We formulate VNF-SCP as a Binary Integer Programming (BIP) model in order to compute routing path for each SFC Request (SFCR) with the minimum end-to-end delay. Then, a novel Deep Learning-based Two-Phase Algorithm (DL-TPA) is introduced, where VNF selection network and VNF chaining network are designed to achieve intelligent and efficient VNF selection and chaining for SFCRs. Performance evaluation shows that DL-TPA can achieve high prediction accuracy and time efficiency of routing path computation, and the overall network performance can be improved significantly.
- 9 April 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Journal on Selected Areas in Communications
- Vol. 38 (6) , 1102-1117
Two-Phase Virtual Network Function Selection and Chaining Algorithm Based on Deep Learning in SDN/NFV-Enabled Networks
With the advances of Software-Defined Networks (SDN) and Network Function Virtualization (NFV), Service Function Chain (SFC) has been becoming a popular paradigm to carry and complete network services. Such new computing and networking paradigm enables Virtual Network Functions (VNFs) to be placed in software entities/virtual machines over a network of physical equipments in elastic and flexible way with low capital and operation expenses. VNFs are chained together to steer traffic as needed. However, most of the existing traffic steering and routing path computation algorithms for SFC are complex, unscalable, and low time-efficiency. In this paper, we study the VNF Selection and Chaining Problem (VNF-SCP) in SDN/NFV-enabled networks.We formulate VNF-SCP as a Binary Integer Programming (BIP) model in order to compute routing path for each SFC Request (SFCR) with the minimum end-to-end delay. Then, a novel Deep Learning-based Two-Phase Algorithm (DL-TPA) is introduced, where VNF selection network and VNF chaining network are designed to achieve intelligent and efficient VNF selection and chaining for SFCRs. Performance evaluation shows that DL-TPA can achieve high prediction accuracy and time efficiency of routing path computation, and the overall network performance can be improved significantly.
- Top Cited Papers
- 13 December 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Journal on Selected Areas in Communications
- Vol. 38 (2) , 263-278
Optimal VNF Placement via Deep Reinforcement Learning in SDN/NFV-Enabled Networks
The emerging paradigm - Software-Defined Networking (SDN) and Network Function Virtualization (NFV) - makes it feasible and scalable to run Virtual Network Functions (VNFs) in commercial-off-the-shelf devices, which provides a variety of network services with reduced cost. Benefitting from centralized network management, lots of information about network devices, traffic and resources can be collected in SDN/NFV-enabled networks. Using powerful machine learning tools, algorithms can be designed in a customized way according to the collected information to efficiently optimize network performance. In this paper, we study the VNF placement problem in SDN/NFV-enabled networks, which is naturally formulated as a Binary Integer Programming (BIP) problem. Using deep reinforcement learning, we propose a Double Deep Q Networkbased VNF Placement Algorithm (DDQN-VNFPA). Specifically, DDQN determines the optimal solution from a prohibitively large solution space and DDQN-VNFPA then places/releases VNF Instances (VNFIs) following a threshold-based policy. We evaluate DDQN-VNFPA with trace-driven simulations on a realworld network topology. Evaluation results show that DDQNVNFPA can get improved network performance in terms of the reject number and reject ratio of Service Function Chain Requests (SFCRs), throughput, end-to-end delay, VNFI running time and load balancing compared with the algorithms in existing literatures.
- 13 December 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Journal on Selected Areas in Communications
- Vol. 38 (2) , 263-278
Top Cited PapersOptimal VNF Placement via Deep Reinforcement Learning in SDN/NFV-Enabled Networks
The emerging paradigm - Software-Defined Networking (SDN) and Network Function Virtualization (NFV) - makes it feasible and scalable to run Virtual Network Functions (VNFs) in commercial-off-the-shelf devices, which provides a variety of network services with reduced cost. Benefitting from centralized network management, lots of information about network devices, traffic and resources can be collected in SDN/NFV-enabled networks. Using powerful machine learning tools, algorithms can be designed in a customized way according to the collected information to efficiently optimize network performance. In this paper, we study the VNF placement problem in SDN/NFV-enabled networks, which is naturally formulated as a Binary Integer Programming (BIP) problem. Using deep reinforcement learning, we propose a Double Deep Q Networkbased VNF Placement Algorithm (DDQN-VNFPA). Specifically, DDQN determines the optimal solution from a prohibitively large solution space and DDQN-VNFPA then places/releases VNF Instances (VNFIs) following a threshold-based policy. We evaluate DDQN-VNFPA with trace-driven simulations on a realworld network topology. Evaluation results show that DDQNVNFPA can get improved network performance in terms of the reject number and reject ratio of Service Function Chain Requests (SFCRs), throughput, end-to-end delay, VNFI running time and load balancing compared with the algorithms in existing literatures.
- Top Cited Papers
- 12 November 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Parallel and Distributed Systems
- Vol. 30 (10) , 2179-2192
Efficiently Embedding Service Function Chains with Dynamic Virtual Network Function Placement in Geo-Distributed Cloud System
Network Function Virtualization (NFV) and Software-Defined Networks (SDN) enable Internet Service Providers (ISPs) to place Virtual Network Functions (VNFs) to achieve the performance and security benefit without incurring high Operating Expenses (OPEX) and Capital Expenses (CAPEX). In NFV environment, Service Function Chains (SFCs) always need to steer the traffic through a series of VNF instances in predefined orders. Moreover, the required number and placement of VNF instances should be optimized to adapt to dynamic network load. Therefore, it is considerable for ISPs to conduct an optimal SFC embedding strategy to improve the network performance and revenue. In the paper, we study the SFC embedding problem (SFC-EP) with dynamic VNF placement in geo-distributed cloud system. We formulate this problem as a Binary Integer Programming (BIP) model aiming to embed SFC requests with the minimum embedding cost. Furthermore, the novel SFC eMbedding APproach (SFC-MAP) and VNF Dynamic Release Algorithm (VNF-DRA) have been proposed to efficiently embed SFC requests and optimize the number of placed VNF instances. Performance evaluation results show that the proposed algorithms can provide higher performance in terms of SFC request acceptance rate, network throughput and mean VNF utilization rate and efficiently reduce the total VNF running time compared with the algorithms in existing literatures.
- 12 November 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Parallel and Distributed Systems
- Vol. 30 (10) , 2179-2192
Top Cited PapersEfficiently Embedding Service Function Chains with Dynamic Virtual Network Function Placement in Geo-Distributed Cloud System
Network Function Virtualization (NFV) and Software-Defined Networks (SDN) enable Internet Service Providers (ISPs) to place Virtual Network Functions (VNFs) to achieve the performance and security benefit without incurring high Operating Expenses (OPEX) and Capital Expenses (CAPEX). In NFV environment, Service Function Chains (SFCs) always need to steer the traffic through a series of VNF instances in predefined orders. Moreover, the required number and placement of VNF instances should be optimized to adapt to dynamic network load. Therefore, it is considerable for ISPs to conduct an optimal SFC embedding strategy to improve the network performance and revenue. In the paper, we study the SFC embedding problem (SFC-EP) with dynamic VNF placement in geo-distributed cloud system. We formulate this problem as a Binary Integer Programming (BIP) model aiming to embed SFC requests with the minimum embedding cost. Furthermore, the novel SFC eMbedding APproach (SFC-MAP) and VNF Dynamic Release Algorithm (VNF-DRA) have been proposed to efficiently embed SFC requests and optimize the number of placed VNF instances. Performance evaluation results show that the proposed algorithms can provide higher performance in terms of SFC request acceptance rate, network throughput and mean VNF utilization rate and efficiently reduce the total VNF running time compared with the algorithms in existing literatures.
- 22 June 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Services Computing
- Vol. 14 (4) , 985-997
Resource Aware Routing for Service Function Chains in SDN and NFV-Enabled Network
Owing to the Network Function Virtualization (NFV) and Software-Defined Networks (SDN), Service Function Chain (SFC) has become a popular service in SDN and NFV-enabled network. However, as the Virtual Network Function (VNF) of each type is generally multi-instance and flows with SFC requests must traverse a series of specified VNFs in predefined orders, it is a challenge for dynamic SFC formation to optimally select VNF instances and construct paths. Moreover, the load balancing and end-to-end delay need to be paid attention to, when routing flows with SFC requests. Additionally, fine-grained scheduling for traffic at flow level needs differentiated routing which should take flow features into consideration. Unfortunately, traditional algorithms cannot fulfill all these requirements. In this paper, we study the Differentiated Routing Problem considering SFC (DRP-SFC) in SDN and NFV-enabled network. We formulate the DRP-SFC as a Binary Integer Programming (BIP) model aiming to minimize the resource consumption costs of flows with SFC requests. Then a novel routing algorithm, Resource Aware Routing Algorithm (RA-RA), is proposed to solve the DRP-SFC. Performance evaluation shows that RA-RA can efficiently solve the DRP-SFC and surpass the performance of other existing algorithms in acceptance rate, throughput, hop count and load balancing.
- 22 June 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Services Computing
- Vol. 14 (4) , 985-997
Resource Aware Routing for Service Function Chains in SDN and NFV-Enabled Network
Owing to the Network Function Virtualization (NFV) and Software-Defined Networks (SDN), Service Function Chain (SFC) has become a popular service in SDN and NFV-enabled network. However, as the Virtual Network Function (VNF) of each type is generally multi-instance and flows with SFC requests must traverse a series of specified VNFs in predefined orders, it is a challenge for dynamic SFC formation to optimally select VNF instances and construct paths. Moreover, the load balancing and end-to-end delay need to be paid attention to, when routing flows with SFC requests. Additionally, fine-grained scheduling for traffic at flow level needs differentiated routing which should take flow features into consideration. Unfortunately, traditional algorithms cannot fulfill all these requirements. In this paper, we study the Differentiated Routing Problem considering SFC (DRP-SFC) in SDN and NFV-enabled network. We formulate the DRP-SFC as a Binary Integer Programming (BIP) model aiming to minimize the resource consumption costs of flows with SFC requests. Then a novel routing algorithm, Resource Aware Routing Algorithm (RA-RA), is proposed to solve the DRP-SFC. Performance evaluation shows that RA-RA can efficiently solve the DRP-SFC and surpass the performance of other existing algorithms in acceptance rate, throughput, hop count and load balancing.
- Top Cited Papers
- 5 February 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Parallel and Distributed Systems
- Vol. 29 (7) , 1664-1677
Virtual Network Function Placement Considering Resource Optimization and SFC Requests in Cloud Datacenter
Network function virtualization (NFV) brings great conveniences and benefits for the enterprises to outsource their network functions to the cloud datacenter. In this paper, we address the virtual network function (VNF) placement problem in cloud datacenter considering users' service function chain requests (SFCRs). To optimize the resource utilization, we take two less-considered factors into consideration, which are the time-varying workloads, and the basic resource consumptions (BRCs) when instantiating VNFs in physical machines (PMs). Then the VNF placement problem is formulated as an integer linear programming (ILP) model with the aim of minimizing the number of used PMs. Afterwards, a Two-StAge heurisTic solution (T-SAT) is designed to solve the ILP. T-SAT consists of a correlation-based greedy algorithm for SFCR mapping (first stage) and a further adjustment algorithm for virtual network function requests (VNFRs) in each SFCR (second stage). Finally, we evaluate T-SAT with the artificial data we compose with Gaussian function and trace data derived from Google's datacenters. The simulation results demonstrate that the number of used PMs derived by T-SAT is near to the optimal results and much smaller than the benchmarks. Besides, it improves the network resource utilization significantly.
- 5 February 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Parallel and Distributed Systems
- Vol. 29 (7) , 1664-1677
Top Cited PapersVirtual Network Function Placement Considering Resource Optimization and SFC Requests in Cloud Datacenter
Network function virtualization (NFV) brings great conveniences and benefits for the enterprises to outsource their network functions to the cloud datacenter. In this paper, we address the virtual network function (VNF) placement problem in cloud datacenter considering users' service function chain requests (SFCRs). To optimize the resource utilization, we take two less-considered factors into consideration, which are the time-varying workloads, and the basic resource consumptions (BRCs) when instantiating VNFs in physical machines (PMs). Then the VNF placement problem is formulated as an integer linear programming (ILP) model with the aim of minimizing the number of used PMs. Afterwards, a Two-StAge heurisTic solution (T-SAT) is designed to solve the ILP. T-SAT consists of a correlation-based greedy algorithm for SFCR mapping (first stage) and a further adjustment algorithm for virtual network function requests (VNFRs) in each SFCR (second stage). Finally, we evaluate T-SAT with the artificial data we compose with Gaussian function and trace data derived from Google's datacenters. The simulation results demonstrate that the number of used PMs derived by T-SAT is near to the optimal results and much smaller than the benchmarks. Besides, it improves the network resource utilization significantly.
- 27 September 2010
- Published by American Chemical Society (ACS) in The Journal of Physical Chemistry C
- Vol. 114 (41) , 18001-18011
Orientation Behavior of Bulk Heterojunction Solar Cells Based on Liquid-Crystalline Polyfluorene and Fullerene
- 27 September 2010
- Published by American Chemical Society (ACS) in The Journal of Physical Chemistry C
- Vol. 114 (41) , 18001-18011
Orientation Behavior of Bulk Heterojunction Solar Cells Based on Liquid-Crystalline Polyfluorene and Fullerene
- 8 January 2009
- Published by Wiley in Journal of Polymer Science Part A: Polymer Chemistry
- Vol. 47 (4) , 1003-1012
Synthesis and photovoltaic properties of poly(p‐phenylenevinylene) derivatives containing oxadiazole
- 8 January 2009
- Published by Wiley in Journal of Polymer Science Part A: Polymer Chemistry
- Vol. 47 (4) , 1003-1012
Synthesis and photovoltaic properties of poly(p‐phenylenevinylene) derivatives containing oxadiazole