Hierarchical Reinforcement Learning for the Dynamic VNE with Alternatives Problem
Ali Al Housseini, Cristina Rottondi, Omran Ayoub

TL;DR
This paper introduces HRL-VNEAP, a hierarchical reinforcement learning method for dynamic virtual network embedding with alternative topologies, significantly improving acceptance and revenue metrics.
Contribution
It presents a novel hierarchical RL approach for VNE with alternative topologies, addressing the complexity of dynamic, malleable virtual network requests.
Findings
HRL-VNEAP outperforms naive strategies across all metrics.
Acceptance ratio increases by up to 20.7%.
Revenue and revenue-over-cost are significantly improved.
Abstract
Virtual Network Embedding (VNE) is a key enabler of network slicing, yet most formulations assume that each Virtual Network Request (VNR) has a fixed topology. Recently, VNE with Alternative topologies (VNEAP) was introduced to capture malleable VNRs, where each request can be instantiated using one of several functionally equivalent topologies that trade resources differently. While this flexibility enlarges the feasible space, it also introduces an additional decision layer, making dynamic embedding more challenging. This paper proposes HRL-VNEAP, a hierarchical reinforcement learning approach for VNEAP under dynamic arrivals. A high-level policy selects the most suitable alternative topology (or rejects the request), and a low-level policy embeds the chosen topology onto the substrate network. Experiments on realistic substrate topologies under multiple traffic loads show that naive…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
