Angelos Pentelas
Angelos Pentelas has a total of 20 co-authors. Here are the top co-authors by number of shared publications:
- Panagiotis Papadimitriou
University of Macedonia, Thessaloniki, Greece
3 shared publications - George Papathanail
University of Macedonia, Thessaloniki, Greece
2 shared publications - Chia-Yu Chang
Nokia Bell Labs, Antwerp, Belgium
1 shared publication - Danny De Vleeschauwer
Network Automation Department, Nokia Bell Labs, Antwerp, Belgium
1 shared publication Dimitra Paranou
Athena Research Center, Marousi, Greece
1 shared publication- Dimitrios Dechouniotis
Department of Electrical and Computer Engineering, University of Peloponnese, 26334 Patras, Greece
1 shared publication
Latest Publications
- Open Access
- 1 July 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 12, 91462-91479
Dynamic Sizing of Cloud-Native Telco Data Centers With Digital Twin and Reinforcement Learning
Telco edge data centers (DCs) accommodate applications whose load fluctuates considerably during a day. This variability mandates swift and responsive resource adjustments to mitigate the risk of incurring unnecessary costs during off-peak periods, where a significant fraction of nodes may be under-utilized. Tackling this challenge is integral to optimizing operational efficiency and cost-effectiveness of telco edge DCs. To this end, this article aims to address the Dynamic Data Center Sizing (DDS) problem, which boils down to optimizing the number of active nodes as per current resource demand. The proposed DDS solution consists of two core modules, namely a forecasting module, which predicts resource demands, and a decision-making module, which acts upon predicted demands. The decision-making of DDS is implemented via the filtering and the rank-drain-observe (RDO) algorithms. Filtering is based on integer linear programming, and it computes the theoretically optimal state of the DC based on predicted resource demands. RDO is a heuristic that strives to realize the optimal DC state in an iterative and robust fashion. To expedite RDO in large-scale clusters, we further devise a Reinforcement Learning (RL)-enabled DDS variant (i.e., RL-DDS), in which RDO integrates an RL agent that computes optimized batches of nodes for concurrent deactivation. We propose an innovative solution based on the notion of Digital Twin to train the RL agent in emulation mode. DDS and RL-DDS are evaluated upon real-life testbeds resembling actual DCs. Results demonstrate significant cost reduction, ranging from 7% in conservative and relatively static scenarios, up to 38% in highly dynamic settings.
- 1 July 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 12, 91462-91479
Open AccessDynamic Sizing of Cloud-Native Telco Data Centers With Digital Twin and Reinforcement Learning
Telco edge data centers (DCs) accommodate applications whose load fluctuates considerably during a day. This variability mandates swift and responsive resource adjustments to mitigate the risk of incurring unnecessary costs during off-peak periods, where a significant fraction of nodes may be under-utilized. Tackling this challenge is integral to optimizing operational efficiency and cost-effectiveness of telco edge DCs. To this end, this article aims to address the Dynamic Data Center Sizing (DDS) problem, which boils down to optimizing the number of active nodes as per current resource demand. The proposed DDS solution consists of two core modules, namely a forecasting module, which predicts resource demands, and a decision-making module, which acts upon predicted demands. The decision-making of DDS is implemented via the filtering and the rank-drain-observe (RDO) algorithms. Filtering is based on integer linear programming, and it computes the theoretically optimal state of the DC based on predicted resource demands. RDO is a heuristic that strives to realize the optimal DC state in an iterative and robust fashion. To expedite RDO in large-scale clusters, we further devise a Reinforcement Learning (RL)-enabled DDS variant (i.e., RL-DDS), in which RDO integrates an RL agent that computes optimized batches of nodes for concurrent deactivation. We propose an innovative solution based on the notion of Digital Twin to train the RL agent in emulation mode. DDS and RL-DDS are evaluated upon real-life testbeds resembling actual DCs. Results demonstrate significant cost reduction, ranging from 7% in conservative and relatively static scenarios, up to 38% in highly dynamic settings.
- Open Access
- 24 April 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 11, 40384-40398
Deep Multi-Agent Reinforcement Learning With Minimal Cross-Agent Communication for SFC Partitioning
Network Function Virtualization (NFV) decouples network functions from the underlying specialized devices, enabling network processing with higher flexibility and resource efficiency. This promotes the use of virtual network functions (VNFs), which can be grouped to form a service function chain (SFC). A critical challenge in NFV is SFC partitioning (SFCP), which is mathematically expressed as a graph-to-graph mapping problem. Given its NP-hardness, SFCP is commonly solved by approximation methods. Yet, the relevant literature exhibits a gradual shift towards data-driven SFCP frameworks, such as (deep) reinforcement learning (RL). In this article, we initially identify crucial limitations of existing RL-based SFCP approaches. In particular, we argue that most of them stem from the centralized implementation of RL schemes. Therefore, we devise a cooperative deep multi-agent reinforcement learning (DMARL) scheme for decentralized SFCP, which fosters the efficient communication of neighboring agents. Our simulation results (i) demonstrate that DMARL outperforms a state-of-the-art centralized double deep Q-learning algorithm, (ii) unfold the fundamental behaviors learned by the team of agents, (iii) highlight the importance of information exchange between agents, and (iv) showcase the implications stemming from various network topologies on the DMARL efficiency.
- 24 April 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 11, 40384-40398
Open AccessDeep Multi-Agent Reinforcement Learning With Minimal Cross-Agent Communication for SFC Partitioning
Network Function Virtualization (NFV) decouples network functions from the underlying specialized devices, enabling network processing with higher flexibility and resource efficiency. This promotes the use of virtual network functions (VNFs), which can be grouped to form a service function chain (SFC). A critical challenge in NFV is SFC partitioning (SFCP), which is mathematically expressed as a graph-to-graph mapping problem. Given its NP-hardness, SFCP is commonly solved by approximation methods. Yet, the relevant literature exhibits a gradual shift towards data-driven SFCP frameworks, such as (deep) reinforcement learning (RL). In this article, we initially identify crucial limitations of existing RL-based SFCP approaches. In particular, we argue that most of them stem from the centralized implementation of RL schemes. Therefore, we devise a cooperative deep multi-agent reinforcement learning (DMARL) scheme for decentralized SFCP, which fosters the efficient communication of neighboring agents. Our simulation results (i) demonstrate that DMARL outperforms a state-of-the-art centralized double deep Q-learning algorithm, (ii) unfold the fundamental behaviors learned by the team of agents, (iii) highlight the importance of information exchange between agents, and (iv) showcase the implications stemming from various network topologies on the DMARL efficiency.
- Open Access
- 2 May 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 10, 49322-49336
MESON: A Platform for Optimized Cross-Slice Communication on Edge Computing Infrastructures
In the dawn of the 6G era, evolving service ecosystems raise the need for cross-service interactions. Existing resource/service orchestration frameworks are oblivious to such cross-service interactions, since they tend to orchestrate services independent to each other. In this respect, we stress on the need for optimized crossservice communication, and more specifically, for optimized cross-slice communication (CSC). To this end, we present a CSC orchestration platform, namely MESON, which fulfills all main CSC requirements, such as the discovery of CSC-enabled services, the selection of the most suitable (edge) computing infrastructure, and also the establishment and configuration of CSC in a secure and policy-compliant manner. MESON has been designed and built as an extension of the ETSI NFV MANO framework. Relying on MESON as a proof-of-concept for CSC, we present evaluation results from various performance and scalability tests, and further uncover significant gains from optimized CSC in relation to video streaming and Industry 4.0 use cases.
- 2 May 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 10, 49322-49336
Open AccessMESON: A Platform for Optimized Cross-Slice Communication on Edge Computing Infrastructures
In the dawn of the 6G era, evolving service ecosystems raise the need for cross-service interactions. Existing resource/service orchestration frameworks are oblivious to such cross-service interactions, since they tend to orchestrate services independent to each other. In this respect, we stress on the need for optimized crossservice communication, and more specifically, for optimized cross-slice communication (CSC). To this end, we present a CSC orchestration platform, namely MESON, which fulfills all main CSC requirements, such as the discovery of CSC-enabled services, the selection of the most suitable (edge) computing infrastructure, and also the establishment and configuration of CSC in a secure and policy-compliant manner. MESON has been designed and built as an extension of the ETSI NFV MANO framework. Relying on MESON as a proof-of-concept for CSC, we present evaluation results from various performance and scalability tests, and further uncover significant gains from optimized CSC in relation to video streaming and Industry 4.0 use cases.
- 15 December 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Network and Service Management
- Vol. 18 (1) , 209-223
Network Service Embedding Across Multiple Resource Dimensions
Network Function Virtualization (NFV) poses the need for efficient embeddings of network services, usually defined in the form of service graphs, associated with resource and bandwidth demands. As the scope of NFV has been expanded in order to meet the requirements of virtualized cellular networks and emerging 5G services, the diversity of resource demands across dimensions, such as CPU, memory, and storage, increased. This requirement exacerbates the already challenging problem of network service embedding (NSE), rendering most existing NSE methods inefficient, as they commonly account for a single resource dimension (i.e., typically, the CPU). In this context, we investigate methods for NSE optimization across multiple resource dimensions. To this end, we study a range of multi-dimensional mapping efficiency metrics and assess their suitability for heuristic and exact NSE methods. Utilizing the most suitable and efficient metrics, we propose two heuristics and a mixed integer linear program (MILP) for optimized multi-dimensional NSE. In addition, we devise a virtual network function (VNF) bundling scheme that generates (resource-wise) balanced VNF bundles in order to augment VNF placement. Our evaluation results indicate notable resource efficiency gains of the proposed heuristics compared to a single-dimensional counterpart, as well as a minor degree of sub-optimality in relation to our proposed MILP. We further demonstrate how the bundling scheme affects the embedding efficiency, when coupled with our most efficient heuristic. Our study also uncovers interesting insights and potential implications from the utilization of multi-dimensional metrics within NSE methods.
- 15 December 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Network and Service Management
- Vol. 18 (1) , 209-223
Network Service Embedding Across Multiple Resource Dimensions
Network Function Virtualization (NFV) poses the need for efficient embeddings of network services, usually defined in the form of service graphs, associated with resource and bandwidth demands. As the scope of NFV has been expanded in order to meet the requirements of virtualized cellular networks and emerging 5G services, the diversity of resource demands across dimensions, such as CPU, memory, and storage, increased. This requirement exacerbates the already challenging problem of network service embedding (NSE), rendering most existing NSE methods inefficient, as they commonly account for a single resource dimension (i.e., typically, the CPU). In this context, we investigate methods for NSE optimization across multiple resource dimensions. To this end, we study a range of multi-dimensional mapping efficiency metrics and assess their suitability for heuristic and exact NSE methods. Utilizing the most suitable and efficient metrics, we propose two heuristics and a mixed integer linear program (MILP) for optimized multi-dimensional NSE. In addition, we devise a virtual network function (VNF) bundling scheme that generates (resource-wise) balanced VNF bundles in order to augment VNF placement. Our evaluation results indicate notable resource efficiency gains of the proposed heuristics compared to a single-dimensional counterpart, as well as a minor degree of sub-optimality in relation to our proposed MILP. We further demonstrate how the bundling scheme affects the embedding efficiency, when coupled with our most efficient heuristic. Our study also uncovers interesting insights and potential implications from the utilization of multi-dimensional metrics within NSE methods.