Charles Boudreau
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Charles Boudreau has a total of 2 co-authors. Here are the top co-authors by number of shared publications:
- Brigitte Jaumard
Department of Computer Science and Software Engineering, Concordia University, Montreal, QC, Canada
1 shared publication - Emil Janulewicz
University of Ottaw
1 shared publication
Latest Publications
- Open Access
- 9 December 2024
- Published by Association for Computing Machinery (ACM)
- p. 53-58
Dynamic Service Function Chaining Provisioning with Reinforcement Learning Graph Neural Networks
The Service Function Chain (SFC) provisioning problem in a 5G/B5G network corresponds to the routing of service requests through an ordered list of virtualized network functions (VNFs) while respecting network/computing resource, and delay/bandwidth constraints. This study proposes a solution to this problem through the use of Deep Reinforcement Learning (Deep-RL) and Graph Neural Networks (GNNs). The latter ones are first explored with Graph Convolutional Network (GCN) and then with Graph Attention Networks (GATs) which leverage attention mechanisms for feature learning on graphs. Experiments are conducted on large graphs with up to 200 nodes. GNN (both GCN and GAT) solutions compare very favorably to a similar agent employing a fully-connected network at its core, as they require less data to learn better and faster the topology, with GAT improving over GCN.
- 9 December 2024
- Published by Association for Computing Machinery (ACM)
- p. 53-58
Open AccessDynamic Service Function Chaining Provisioning with Reinforcement Learning Graph Neural Networks
The Service Function Chain (SFC) provisioning problem in a 5G/B5G network corresponds to the routing of service requests through an ordered list of virtualized network functions (VNFs) while respecting network/computing resource, and delay/bandwidth constraints. This study proposes a solution to this problem through the use of Deep Reinforcement Learning (Deep-RL) and Graph Neural Networks (GNNs). The latter ones are first explored with Graph Convolutional Network (GCN) and then with Graph Attention Networks (GATs) which leverage attention mechanisms for feature learning on graphs. Experiments are conducted on large graphs with up to 200 nodes. GNN (both GCN and GAT) solutions compare very favorably to a similar agent employing a fully-connected network at its core, as they require less data to learn better and faster the topology, with GAT improving over GCN.