LiSFC-Search: Lifelong Search for Network SFC Optimization under Non-stationary Drifts
Zuyuan Zhang, Vaneet Aggarwal, Tian Lan

TL;DR
LiSFC-Search introduces a lifelong planning approach for network service function chaining that adapts to non-stationary network changes, improving efficiency and reducing blocking and delays.
Contribution
It develops a transfer learning-based MCTS method tailored for dynamic networks, with theoretical guarantees and practical improvements over existing methods.
Findings
Reduces SFC blocking probability
Improves tail delay performance
Demonstrates effectiveness on synthetic topologies
Abstract
Edge-cloud convergence is reshaping service provisioning across 5G/6G and computing power networks (CPNs). Service function chaining (SFC) requires continuously placing and scheduling virtual network functions (VNFs) chains under compute/bandwidth and end-to-end QoS constraints. Most SFC optimizers assume static or stationary networks, and degrade under long-term topology/resource changes (failures, upgrades, expansions) that induce non-stationary graph drifts. We propose LiSFC, a Lipschitz lifelong planner that transfers MCTS statistics across drifting network configurations using an MDP-distance bound. More precisely, we formulate the problem as a sequence of MDPs indexed by the underlying network graph and constraints, and we define a \emph{graph drift} metric that upper-bounds the LiZero MDP distance. This allows LiSFC to import theoretical guarantees on bias and sample efficiency…
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.
Taxonomy
TopicsSoftware-Defined Networks and 5G · Advanced Optical Network Technologies · IoT and Edge/Fog Computing
