Chen Chen
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Chen Chen has a total of 46 co-authors. Here are the top co-authors by number of shared publications:
- Fung Po Tso
Loughborough University
4 shared publications - Lin Cui
Jinan University
3 shared publications - Ge Zheng
Department of Engineering, University of Cambridge, Cambridge, U.K.
2 shared publications Lars Nagel
2 shared publications- Manuel Herrera
School of Engineering, Newcastle University, Newcastle upon Tyne NE1 7RU, UK
2 shared publications - Orestes Llanes-Santiago
Programa de Pós‐Graduação em Modelagem Computacional Instituto Politécnico‐Universidade do Estado do Rio de Janeiro Nova Friburgo Rio de Janeiro Brasil
2 shared publications
Latest Publications
- 1 December 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Parallel and Distributed Systems
- Vol. 37 (12) , 2710-2725
ALPS: An Application-Aware, Length-Predictive Scheduler for Efficient LLM Inference at Edge
- 1 December 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Parallel and Distributed Systems
- Vol. 37 (12) , 2710-2725
ALPS: An Application-Aware, Length-Predictive Scheduler for Efficient LLM Inference at Edge
- Open Access
- 29 August 2026
- Published by Elsevier in Computer Communications
- Vol. 259
EcoRun: Energy-aware container scheduling and resource allocation in serverless edge computing
- 29 August 2026
- Published by Elsevier in Computer Communications
- Vol. 259
Open AccessEcoRun: Energy-aware container scheduling and resource allocation in serverless edge computing
- Open Access
- 25 April 2026
- Published by Elsevier in Journal of Network and Computer Applications
- Vol. 251
FaasOrc: A bi-level function scheduling and caching framework for serverless edge computing
- 25 April 2026
- Published by Elsevier in Journal of Network and Computer Applications
- Vol. 251
Open AccessFaasOrc: A bi-level function scheduling and caching framework for serverless edge computing
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Network and Service Management
- Vol. 23, 6022-6034
HAN: Adaptive DRL-Based Congestion Control via Model Uncertainty
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Network and Service Management
- Vol. 23, 6022-6034
HAN: Adaptive DRL-Based Congestion Control via Model Uncertainty
- Open Access
Design and Evaluation of an NDN-Based Network for Distributed Digital Twins
Digital twins (DT) have received significant attention due to their numerous benefits, such as real-time data analytics and cost reduction in production. DT serves as a fundamental component of many applications, encompassing smart manufacturing, intelligent vehicles, and smart cities. By using Machine Learning (ML) and Artificial Intelligence (AI) techniques, DTs can efficiently facilitate decision-making and productivity by simulating the status and changes of a physical entity. To handle the massive amount of data brought by DTs, it is challenging to achieve low response latency for data fetching over existing IP-based networks. IP-based networks use host addresses for end-to-end communication, making data distribution between DTs inefficient. Thus, we propose to use DTs in a distributed manner over Named Data Networking (NDN) networks. NDN is data-centric where data is routed based on content names, dynamically adjusting paths to optimize latency. Popular data is cached in network nodes, reducing data transmission and network congestion. Since data is fetched by content names, users and mobile devices can move freely without IP address reassignment. By using in-network caching and adaptive routing, we reckon NDN is an ideal fit for Future G Networks in the context of Digital Twins. We compared DTs in edge scenarios with cloud scenarios over NDN and IP-based networks to validate our insights. Extensive simulation results show that using DT in the edge reduces response latency by 10.2x. This position paper represents an initial investigation into the gap in distributed DTs over NDN, serving as an early-stage study.
Open AccessDesign and Evaluation of an NDN-Based Network for Distributed Digital Twins
Digital twins (DT) have received significant attention due to their numerous benefits, such as real-time data analytics and cost reduction in production. DT serves as a fundamental component of many applications, encompassing smart manufacturing, intelligent vehicles, and smart cities. By using Machine Learning (ML) and Artificial Intelligence (AI) techniques, DTs can efficiently facilitate decision-making and productivity by simulating the status and changes of a physical entity. To handle the massive amount of data brought by DTs, it is challenging to achieve low response latency for data fetching over existing IP-based networks. IP-based networks use host addresses for end-to-end communication, making data distribution between DTs inefficient. Thus, we propose to use DTs in a distributed manner over Named Data Networking (NDN) networks. NDN is data-centric where data is routed based on content names, dynamically adjusting paths to optimize latency. Popular data is cached in network nodes, reducing data transmission and network congestion. Since data is fetched by content names, users and mobile devices can move freely without IP address reassignment. By using in-network caching and adaptive routing, we reckon NDN is an ideal fit for Future G Networks in the context of Digital Twins. We compared DTs in edge scenarios with cloud scenarios over NDN and IP-based networks to validate our insights. Extensive simulation results show that using DT in the edge reduces response latency by 10.2x. This position paper represents an initial investigation into the gap in distributed DTs over NDN, serving as an early-stage study.
- Open Access
A Learning Probabilistic Boolean Network Model of a Manufacturing Process with Applications in System Asset Maintenance
Probabilistic Boolean Networks (PBN) can model the dynamics of complex biological systems, as well as other non-biological systems like manufacturing systems and smart grids. In this proof-of-concept paper, we propose a PBN architecture with a learning process that significantly enhances fault and failure prediction in manufacturing systems. This concept was tested using a PBN model of an ultrasound welding process and its machines. Through various experiments, the model successfully learned to maintain a normal operating state. Leveraging the complex properties of PBNs, we utilize them as an adaptive learning tool with positive feedback, demonstrating that these networks may have broader applications than previously recognized. This multi-layered PBN architecture offers substantial improvements in fault detection performance within a positive feedback network structure that shows greater noise tolerance than other methods.
Open AccessA Learning Probabilistic Boolean Network Model of a Manufacturing Process with Applications in System Asset Maintenance
Probabilistic Boolean Networks (PBN) can model the dynamics of complex biological systems, as well as other non-biological systems like manufacturing systems and smart grids. In this proof-of-concept paper, we propose a PBN architecture with a learning process that significantly enhances fault and failure prediction in manufacturing systems. This concept was tested using a PBN model of an ultrasound welding process and its machines. Through various experiments, the model successfully learned to maintain a normal operating state. Leveraging the complex properties of PBNs, we utilize them as an adaptive learning tool with positive feedback, demonstrating that these networks may have broader applications than previously recognized. This multi-layered PBN architecture offers substantial improvements in fault detection performance within a positive feedback network structure that shows greater noise tolerance than other methods.
- Open Access
A Learning Probabilistic Boolean Network Model of a Smart Grid with Applications in System Maintenance
Probabilistic Boolean Networks can capture the dynamics of complex biological systems as well as other non-biological systems, such as manufacturing systems and smart grids. In this proof-of-concept manuscript, we propose a Probabilistic Boolean Network architecture with a learning process that significantly improves the prediction of the occurrence of faults and failures in smart-grid systems. This idea was tested in a Probabilistic Boolean Network model of the WSCC nine-bus system that incorporates Intelligent Power Routers on every bus. The model learned the equality and negation functions in the different experiments performed. We take advantage of the complex properties of Probabilistic Boolean Networks to use them as a positive feedback adaptive learning tool and to illustrate that these networks could have a more general use than previously thought. This multi-layered PBN architecture provides a significant improvement in terms of performance for fault detection, within a positive-feedback network structure that is more tolerant of noise than other techniques.
Open AccessA Learning Probabilistic Boolean Network Model of a Smart Grid with Applications in System Maintenance
Probabilistic Boolean Networks can capture the dynamics of complex biological systems as well as other non-biological systems, such as manufacturing systems and smart grids. In this proof-of-concept manuscript, we propose a Probabilistic Boolean Network architecture with a learning process that significantly improves the prediction of the occurrence of faults and failures in smart-grid systems. This idea was tested in a Probabilistic Boolean Network model of the WSCC nine-bus system that incorporates Intelligent Power Routers on every bus. The model learned the equality and negation functions in the different experiments performed. We take advantage of the complex properties of Probabilistic Boolean Networks to use them as a positive feedback adaptive learning tool and to illustrate that these networks could have a more general use than previously thought. This multi-layered PBN architecture provides a significant improvement in terms of performance for fault detection, within a positive-feedback network structure that is more tolerant of noise than other techniques.
- Open Access
- 6 September 2024
- Published by Elsevier in Expert Systems with Applications
- Vol. 259
Predictive alarm models for improving radio access network robustness
- 6 September 2024
- Published by Elsevier in Expert Systems with Applications
- Vol. 259
Open AccessPredictive alarm models for improving radio access network robustness
- Open Access
Context-aware Container Orchestration in Serverless Edge Computing
Adopting serverless computing to edge networks benefits end-users from the pay-as-you-use billing model and flexible scaling of applications. This paradigm extends the boundaries of edge computing and remarkably improves the quality of services. However, due to the heterogeneous nature of computing and bandwidth resources in edge networks, it is challenging to dynamically allocate different resources while adapting to the burstiness and high concurrency in serverless workloads. This article focuses on serverless function provisioning in edge networks to optimize end-to-end latency, where the challenge lies in jointly allocating wireless bandwidth and computing resources among heterogeneous computing nodes. To address this challenge, We devised a context-aware learning framework that adaptively orchestrates a wide spectrum of resources and jointly considers them to avoid resource fragmentation. Extensive simulation results justified that the proposed algorithm reduces over 95% of converge time while the end-to-end delay is comparable to the state of the art.
Open AccessContext-aware Container Orchestration in Serverless Edge Computing
Adopting serverless computing to edge networks benefits end-users from the pay-as-you-use billing model and flexible scaling of applications. This paradigm extends the boundaries of edge computing and remarkably improves the quality of services. However, due to the heterogeneous nature of computing and bandwidth resources in edge networks, it is challenging to dynamically allocate different resources while adapting to the burstiness and high concurrency in serverless workloads. This article focuses on serverless function provisioning in edge networks to optimize end-to-end latency, where the challenge lies in jointly allocating wireless bandwidth and computing resources among heterogeneous computing nodes. To address this challenge, We devised a context-aware learning framework that adaptively orchestrates a wide spectrum of resources and jointly considers them to avoid resource fragmentation. Extensive simulation results justified that the proposed algorithm reduces over 95% of converge time while the end-to-end delay is comparable to the state of the art.
- 10 May 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Services Computing
- Vol. 17 (5) , 2139-2150
Cross-Edge Orchestration of Serverless Functions With Probabilistic Caching
Serverless edge computing adopts an event-based paradigm that provides back-end services and dynamically provisions resources as needed, resulting in efficient resource utilization. To improve the end-to-end latency and revenue, service providers need to optimize the number and placement of serverless containers while considering the system cost (i.e., latency cost and container running cost) incurred by the provisioning. The particular reason for this circumstance is that frequently creating and destroying containers not only increases the system cost but also degrades the time responsiveness due to the cold-start process. Function caching is a common approach to mitigate the coldstart issue. However, function caching requires extra hardware resources and hence incurs extra system costs. Furthermore, the dynamic and bursty nature of serverless invocations remains an under-explored area. Hence, it is vitally important for service providers to conduct a context-aware request distribution and container caching policy for serverless edge computing. In this paper, we study the request distribution and container caching problem in serverless edge computing. We prove the proposed problem is NP-hard and hence difficult to find a global optimal solution. We jointly consider the distributed and resourceconstrained nature of edge computing and propose an optimized request distribution algorithm that adapts to the dynamics of serverless invocations with a theoretical performance guarantee. Also, we propose a context-aware probabilistic caching policy that incorporates a number of characteristics of serverless invocations. Via simulation and implementation results, we demonstrate the superiority of the proposed algorithm by outperforming existing caching policies in terms of the overall system cost and cold-start frequency by up to 62.1% and 69.1%, respectively.
- 10 May 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Services Computing
- Vol. 17 (5) , 2139-2150
Cross-Edge Orchestration of Serverless Functions With Probabilistic Caching
Serverless edge computing adopts an event-based paradigm that provides back-end services and dynamically provisions resources as needed, resulting in efficient resource utilization. To improve the end-to-end latency and revenue, service providers need to optimize the number and placement of serverless containers while considering the system cost (i.e., latency cost and container running cost) incurred by the provisioning. The particular reason for this circumstance is that frequently creating and destroying containers not only increases the system cost but also degrades the time responsiveness due to the cold-start process. Function caching is a common approach to mitigate the coldstart issue. However, function caching requires extra hardware resources and hence incurs extra system costs. Furthermore, the dynamic and bursty nature of serverless invocations remains an under-explored area. Hence, it is vitally important for service providers to conduct a context-aware request distribution and container caching policy for serverless edge computing. In this paper, we study the request distribution and container caching problem in serverless edge computing. We prove the proposed problem is NP-hard and hence difficult to find a global optimal solution. We jointly consider the distributed and resourceconstrained nature of edge computing and propose an optimized request distribution algorithm that adapts to the dynamics of serverless invocations with a theoretical performance guarantee. Also, we propose a context-aware probabilistic caching policy that incorporates a number of characteristics of serverless invocations. Via simulation and implementation results, we demonstrate the superiority of the proposed algorithm by outperforming existing caching policies in terms of the overall system cost and cold-start frequency by up to 62.1% and 69.1%, respectively.