Jianyong 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
Jianyong Li has a total of 121 co-authors. Here are the top co-authors by number of shared publications:
Yanhong Liu
19 shared publications- Yanhong Liu
School of Electrical and Information Engineering, Zhengzhou University, Zhengzhou, China
11 shared publications Chunwen Li
Tsinghua University
8 shared publications- Ge Gao
Zhengzhou University
7 shared publications - Ying Hu
School of Computer Science and Technology, Zhengzhou University of Light Industry, Zhengzhou 450001, China
7 shared publications - Lei Yang
School of Electrical and Information Engineering, Zhengzhou University, Zhengzhou 450001, China
6 shared publications
Latest Publications
- 6 November 2026
- Published by Springer Nature in The Journal of Supercomputing
- Vol. 82 (16) , 833
Communication-efficient edge-cloud traffic prediction for NFV
- 6 November 2026
- Published by Springer Nature in The Journal of Supercomputing
- Vol. 82 (16) , 833
Communication-efficient edge-cloud traffic prediction for NFV
- Open Access
- 21 October 2025
- Published by MDPI AG in Electronics
- Vol. 14 (20) , 4129
Network Traffic Prediction for Multiple Providers in Digital Twin-Assisted NFV-Enabled Network
This manuscript investigates the network traffic prediction problem, with the aim of predicting network traffic on a network function virtualization (NFV)-enabled and digital twin (DT)-assisted physical network for network service providers and network resource providers. It faces several key challenges like data privacy and different variation patterns of network traffic for multiple service function chain (SFC) requests. In view of this, we address the network traffic prediction problem by jointly considering the above key challenges in this manuscript. Specifically, we formulate the virtual network function (VNF) migration and SFC placement problems as integer linear programming (ILP) that aim to maximize acceptance revenues, minimize network resource costs, minimize energy consumption, and minimize migration cost. Then, we define the Markov Decision Process (MDP) for the network traffic prediction problem, and propose a model and algorithm to solve the problem. The simulation results demonstrate that our algorithms outperform benchmark algorithms and achieve a better performance.
- 21 October 2025
- Published by MDPI AG in Electronics
- Vol. 14 (20) , 4129
Open AccessNetwork Traffic Prediction for Multiple Providers in Digital Twin-Assisted NFV-Enabled Network
This manuscript investigates the network traffic prediction problem, with the aim of predicting network traffic on a network function virtualization (NFV)-enabled and digital twin (DT)-assisted physical network for network service providers and network resource providers. It faces several key challenges like data privacy and different variation patterns of network traffic for multiple service function chain (SFC) requests. In view of this, we address the network traffic prediction problem by jointly considering the above key challenges in this manuscript. Specifically, we formulate the virtual network function (VNF) migration and SFC placement problems as integer linear programming (ILP) that aim to maximize acceptance revenues, minimize network resource costs, minimize energy consumption, and minimize migration cost. Then, we define the Markov Decision Process (MDP) for the network traffic prediction problem, and propose a model and algorithm to solve the problem. The simulation results demonstrate that our algorithms outperform benchmark algorithms and achieve a better performance.
- 10 October 2025
- Published by Elsevier in Biomedical Signal Processing and Control
- Vol. 113
DDAF-Net: A Dual-Direction Attention Fusion Network for retinal vessel segmentation
- 10 October 2025
- Published by Elsevier in Biomedical Signal Processing and Control
- Vol. 113
DDAF-Net: A Dual-Direction Attention Fusion Network for retinal vessel segmentation
- Open Access
Decentralized Federated Learning with Node Incentive and Role Switching Mechanism for Network Traffic Prediction in NFV Environment
In network function virtualization (NFV) environments, dynamic network traffic prediction with unique symmetric and asymmetric traffic patterns is critical for efficient resource orchestration and service chain optimization. Traditional centralized prediction models face risks of cross-provider data privacy leakage when network service providers collaborate with resource providers to deliver services. To address this issue, we propose a decentralized federated learning method for network traffic prediction, which ensures that historical network traffic data remain stored locally without requiring cross-provider sharing. To further mitigate interference from malicious provider behaviors on network traffic prediction, we design a node incentive mechanism that dynamically adjusts node roles (e.g., “Aggregator”, “Worker Node”, “Residual Node”, and “Evaluator”). When a node exhibits malicious behavior, its contribution score is reduced; otherwise, it is rewarded. Simulation experiments conducted on an NFV platform using public network traffic datasets demonstrate that the proposed method maintains prediction accuracy even in scenarios with a high proportion of malicious nodes, alleviates their adverse effects, and ensures prediction stability.
Open AccessDecentralized Federated Learning with Node Incentive and Role Switching Mechanism for Network Traffic Prediction in NFV Environment
In network function virtualization (NFV) environments, dynamic network traffic prediction with unique symmetric and asymmetric traffic patterns is critical for efficient resource orchestration and service chain optimization. Traditional centralized prediction models face risks of cross-provider data privacy leakage when network service providers collaborate with resource providers to deliver services. To address this issue, we propose a decentralized federated learning method for network traffic prediction, which ensures that historical network traffic data remain stored locally without requiring cross-provider sharing. To further mitigate interference from malicious provider behaviors on network traffic prediction, we design a node incentive mechanism that dynamically adjusts node roles (e.g., “Aggregator”, “Worker Node”, “Residual Node”, and “Evaluator”). When a node exhibits malicious behavior, its contribution score is reduced; otherwise, it is rewarded. Simulation experiments conducted on an NFV platform using public network traffic datasets demonstrate that the proposed method maintains prediction accuracy even in scenarios with a high proportion of malicious nodes, alleviates their adverse effects, and ensures prediction stability.
- Open Access
- 2 May 2025
- Published by MDPI AG in Preprints.org
Network Traffic Prediction Based on Blockchain and Decentralized Federated Learning with Node Incentive Mechanism in NFV Environment
In the Network Function Virtualization (NFV) environment, dynamic network traffic prediction is crucial for efficient resource orchestration and service chain optimization. When network service providers and resource providers collaborate to deliver services, traditional centralized prediction models face risks such as single points of failure, data privacy leaks across merchants, and malicious node attacks. To address these issues, we propose a blockchain based decentralized federated learning method for network traffic prediction, incorporating a node incentive mechanism. By dynamically adjusting node roles (e.g., "Aggregator," "Worker," " Residual node," and "Evaluator") based on prediction accuracy and network migration performance, the framework effectively mitigates the impact of malicious nodes. Additionally, the decentralized federated learning architecture eliminates reliance on central servers, enhancing collaborative training efficiency among multiple service providers while ensuring data privacy. Simulation experiments conducted on an NFV platform using real-world traffic datasets demonstrate that the proposed method improves prediction accuracy, reduces VNF migration overhead, and maintains prediction stability even in scenarios with a high proportion of malicious nodes.
- 2 May 2025
- Published by MDPI AG in Preprints.org
Open AccessNetwork Traffic Prediction Based on Blockchain and Decentralized Federated Learning with Node Incentive Mechanism in NFV Environment
In the Network Function Virtualization (NFV) environment, dynamic network traffic prediction is crucial for efficient resource orchestration and service chain optimization. When network service providers and resource providers collaborate to deliver services, traditional centralized prediction models face risks such as single points of failure, data privacy leaks across merchants, and malicious node attacks. To address these issues, we propose a blockchain based decentralized federated learning method for network traffic prediction, incorporating a node incentive mechanism. By dynamically adjusting node roles (e.g., "Aggregator," "Worker," " Residual node," and "Evaluator") based on prediction accuracy and network migration performance, the framework effectively mitigates the impact of malicious nodes. Additionally, the decentralized federated learning architecture eliminates reliance on central servers, enhancing collaborative training efficiency among multiple service providers while ensuring data privacy. Simulation experiments conducted on an NFV platform using real-world traffic datasets demonstrate that the proposed method improves prediction accuracy, reduces VNF migration overhead, and maintains prediction stability even in scenarios with a high proportion of malicious nodes.
- 26 November 2024
- Published by Elsevier in Biomedical Signal Processing and Control
- Vol. 101
An adaptive fundus retinal vessel segmentation model capable of adapting to the complex structure of blood vessels
- 26 November 2024
- Published by Elsevier in Biomedical Signal Processing and Control
- Vol. 101
An adaptive fundus retinal vessel segmentation model capable of adapting to the complex structure of blood vessels
- Open Access
- 4 September 2024
- Published by MDPI AG in Electronics
- Vol. 13 (17) , 3515
Network Traffic Prediction in an Edge–Cloud Continuum Network for Multiple Network Service Providers
Network function virtualization (NFV) allows the dynamic configuration of virtualized network functions to adapt services to complex and real-time network environments to improve network performance. The dynamic nature of physical networks creates significant challenges for virtual network function (VNF) migration and energy consumption, especially in edge–cloud continuum networks. This challenge can be addressed by predicting network traffic and proactively migrating VNFs using the predicted values. However, historical network traffic data are held by network service providers, and different network service providers are reluctant to share historical data due to privacy concerns; in addition, network resource providers that own the underlying networks are unable to effectively predict network traffic. To address this challenge, we apply a federated learning (FL) framework to enable network resource providers to no longer need historical network traffic data to be able to effectively predict network traffic. Further, to enable the predicted network traffic to lead to better migration effects, such as reducing the number of migrations, decreasing energy consumption, and increasing the request acceptance rate, we apply the predicted values of the network traffic to the network environment and feed the migration results of the network environment on the multiple factors described above to the neural network model. To obtain the migration results of the network environment, we analyzed and developed mathematical models for edge–cloud continuum networks with multiple network service providers. The effectiveness of our algorithm is evaluated through extensive simulations, and the results show a significant reduction in the number of migrated nodes and energy consumption, as well as an increase in the acceptance rate of the service function chain (SFC), compared with the commonly used scheme that uses only the difference between the predicted and actual traffic to define the loss function.
- 4 September 2024
- Published by MDPI AG in Electronics
- Vol. 13 (17) , 3515
Open AccessNetwork Traffic Prediction in an Edge–Cloud Continuum Network for Multiple Network Service Providers
Network function virtualization (NFV) allows the dynamic configuration of virtualized network functions to adapt services to complex and real-time network environments to improve network performance. The dynamic nature of physical networks creates significant challenges for virtual network function (VNF) migration and energy consumption, especially in edge–cloud continuum networks. This challenge can be addressed by predicting network traffic and proactively migrating VNFs using the predicted values. However, historical network traffic data are held by network service providers, and different network service providers are reluctant to share historical data due to privacy concerns; in addition, network resource providers that own the underlying networks are unable to effectively predict network traffic. To address this challenge, we apply a federated learning (FL) framework to enable network resource providers to no longer need historical network traffic data to be able to effectively predict network traffic. Further, to enable the predicted network traffic to lead to better migration effects, such as reducing the number of migrations, decreasing energy consumption, and increasing the request acceptance rate, we apply the predicted values of the network traffic to the network environment and feed the migration results of the network environment on the multiple factors described above to the neural network model. To obtain the migration results of the network environment, we analyzed and developed mathematical models for edge–cloud continuum networks with multiple network service providers. The effectiveness of our algorithm is evaluated through extensive simulations, and the results show a significant reduction in the number of migrated nodes and energy consumption, as well as an increase in the acceptance rate of the service function chain (SFC), compared with the commonly used scheme that uses only the difference between the predicted and actual traffic to define the loss function.
- Open Access
- 18 July 2024
- Published by MDPI AG in Preprints.org
Network Traffic Prediction in Edge-Cloud Continuum Network for Multiple Network Service Providers
Network Function Virtualization (NFV) allows for the dynamic provisioning of Virtualized Network Functions, adapting services to the complex and real-time network environment for enhanced network performance. Despite the benefits of NFV, virtual network functions (VNFs) migration and the energy consumption pose significant challenges due to the dynamic nature of the physical network, especially in the edge-cloud continuum network. Currently, people tackle this challenge by predicting the network traffic and then proactively migrating the VNFs using the predicted values. There are two challenges here. First, when SFCs belong to different network service providers, the historical network traffic data is held by the service providers, and they are reluctant to share the historical data due to privacy concerns. Without the historical network traffic data of each SFC, the resource provider that owns the underlying network cannot effectively predict the network traffic; in addition, without the feedback of the migration results of the underlying physical network, the network traffic prediction will be difficult to match the needs of the physical network. In this manuscript, we solve the problem of network traffic prediction in the NFV-based edge-cloud continuum network for multiple network service providers. We aim to improve migration performance and reduce energy consumption while ensuring resource and latency requirements. To protect the privacy of each network service provider, we apply an FL algorithm. After that, to improve the migration performance, we tailor the loss function. In the loss function, factors such as the number of migrations, the number of migration failures, and the energy consumption of the NFV-based edge-cloud continuum network are added. Additionally, to obtain the results of the SFC migration, we develop a mathematical model for the problem of multiple network service providers in the NFV-based network. The effectiveness of our algorithm is evaluated through extensive simulations, and the results show a significant reduction in the number of migrated nodes and energy consumption while improving the SFC acceptance ratio compared to state-of-the-art schemes which only use the difference between predicted and actual flows to define the loss function.
- 18 July 2024
- Published by MDPI AG in Preprints.org
Open AccessNetwork Traffic Prediction in Edge-Cloud Continuum Network for Multiple Network Service Providers
Network Function Virtualization (NFV) allows for the dynamic provisioning of Virtualized Network Functions, adapting services to the complex and real-time network environment for enhanced network performance. Despite the benefits of NFV, virtual network functions (VNFs) migration and the energy consumption pose significant challenges due to the dynamic nature of the physical network, especially in the edge-cloud continuum network. Currently, people tackle this challenge by predicting the network traffic and then proactively migrating the VNFs using the predicted values. There are two challenges here. First, when SFCs belong to different network service providers, the historical network traffic data is held by the service providers, and they are reluctant to share the historical data due to privacy concerns. Without the historical network traffic data of each SFC, the resource provider that owns the underlying network cannot effectively predict the network traffic; in addition, without the feedback of the migration results of the underlying physical network, the network traffic prediction will be difficult to match the needs of the physical network. In this manuscript, we solve the problem of network traffic prediction in the NFV-based edge-cloud continuum network for multiple network service providers. We aim to improve migration performance and reduce energy consumption while ensuring resource and latency requirements. To protect the privacy of each network service provider, we apply an FL algorithm. After that, to improve the migration performance, we tailor the loss function. In the loss function, factors such as the number of migrations, the number of migration failures, and the energy consumption of the NFV-based edge-cloud continuum network are added. Additionally, to obtain the results of the SFC migration, we develop a mathematical model for the problem of multiple network service providers in the NFV-based network. The effectiveness of our algorithm is evaluated through extensive simulations, and the results show a significant reduction in the number of migrated nodes and energy consumption while improving the SFC acceptance ratio compared to state-of-the-art schemes which only use the difference between predicted and actual flows to define the loss function.
- 15 March 2024
- Published by Elsevier in Computers in Biology and Medicine
- Vol. 172, 108315
A retinal vessel segmentation network with multiple-dimension attention and adaptive feature fusion
- 15 March 2024
- Published by Elsevier in Computers in Biology and Medicine
- Vol. 172, 108315
A retinal vessel segmentation network with multiple-dimension attention and adaptive feature fusion
- Open Access
- 18 October 2023
- Published by MDPI AG in Electronics
- Vol. 12 (20) , 4324
VNF Migration in Digital Twin Network for NFV Environment
Network Function Virtualization (NFV) allows for the dynamic provisioning of Virtual Network Functions (VNFs), adapting services to the complex and dynamic network environment to enhance network performance. However, VNF migration and energy consumption pose significant challenges due to the dynamic nature of the physical network. In order to maximize the acceptance rate of Service Function Chain Requests (SFCR), and reduce VNF migration and energy consumption as much as possible, we summarize several related factors such as the node hosting state, link hosting state, energy consumption, migrated nodes, and whether the mapping is successful. We define the Markov decision process by considering the factors mentioned above. Next, we design the VNF migration algorithm utilizing actor–critic models, graph convolution networks, and LSTM networks. In order to reduce the risk of trial and error during training and prediction in deep reinforcement learning scenarios, we designed a network architecture based on a digital twin (DT). In simulation experiments, compared with the FF algorithm that greedily selects the first available node, our AC_GCN algorithm significantly improves the acceptance rate of SFC requests by 2.9 times more than the FF algorithm in small topology experiments, and 27 times more than the FF algorithm in large topology experiments. Compared with the deep reinforcement learning (DRL) algorithm, which does not consider all the above factors together, for the small topology experiment, our AC_GCN algorithm outperforms the DRL algorithm in terms of request acceptance rate by 13%, underperforms compared to the DRL algorithm in terms of energy consumption by 3.8%, and underperforms compared to the DRL algorithm in terms of the number of migrated nodes for 22%; for the large topology experiment, our AC_GCN algorithm outperforms the DRL algorithm in terms of the request acceptance rate by 7.7%, outperforms the DRL algorithm in terms of energy consumption by 0.4%, and outperforms the DRL algorithm in terms of the number of migrated nodes by 1.6%.
- 18 October 2023
- Published by MDPI AG in Electronics
- Vol. 12 (20) , 4324
Open AccessVNF Migration in Digital Twin Network for NFV Environment
Network Function Virtualization (NFV) allows for the dynamic provisioning of Virtual Network Functions (VNFs), adapting services to the complex and dynamic network environment to enhance network performance. However, VNF migration and energy consumption pose significant challenges due to the dynamic nature of the physical network. In order to maximize the acceptance rate of Service Function Chain Requests (SFCR), and reduce VNF migration and energy consumption as much as possible, we summarize several related factors such as the node hosting state, link hosting state, energy consumption, migrated nodes, and whether the mapping is successful. We define the Markov decision process by considering the factors mentioned above. Next, we design the VNF migration algorithm utilizing actor–critic models, graph convolution networks, and LSTM networks. In order to reduce the risk of trial and error during training and prediction in deep reinforcement learning scenarios, we designed a network architecture based on a digital twin (DT). In simulation experiments, compared with the FF algorithm that greedily selects the first available node, our AC_GCN algorithm significantly improves the acceptance rate of SFC requests by 2.9 times more than the FF algorithm in small topology experiments, and 27 times more than the FF algorithm in large topology experiments. Compared with the deep reinforcement learning (DRL) algorithm, which does not consider all the above factors together, for the small topology experiment, our AC_GCN algorithm outperforms the DRL algorithm in terms of request acceptance rate by 13%, underperforms compared to the DRL algorithm in terms of energy consumption by 3.8%, and underperforms compared to the DRL algorithm in terms of the number of migrated nodes for 22%; for the large topology experiment, our AC_GCN algorithm outperforms the DRL algorithm in terms of the request acceptance rate by 7.7%, outperforms the DRL algorithm in terms of energy consumption by 0.4%, and outperforms the DRL algorithm in terms of the number of migrated nodes by 1.6%.