Searcharxiv⌕ Search

arXiv · 2610.13161

Configuration Migration Planning through Decoupled Modeling and Searching

Abstract

Executing large network configuration changes, called migrations, is slow and error-prone today; operators must manually devise a safe order for updating devices that does not disrupt traffic and meets operational intents (e.g., low total time). We develop Smoothie, a versatile migration planning framework that, unlike existing tools, can support diverse operational intents. Inspired by automated planning, it achieves versatility by decoupling the encoding of network safety and intents from the search for a viable plan. Smoothie uses symbolic simulation for general and scalable safety encoding, after which it can use a range of planners, including existing off-the-shelf planners and a new one we developed for optimized parallel plans. We demonstrate Smoothie's versatility and benchmark its performance using diverse migration scenarios on many topologies. It finds both sequential plans and parallel plans, and the parallel ones compress up to thousands of configuration updates into no more than 3 steps. Its versatility does not come at the expense of performance: finishing most planning tasks in less than 1 hour.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Dan Wang, Peng Zhang, Ratul Mahajan. 2026-10-09. Configuration Migration Planning through Decoupled Modeling and Searching. https://arxiv.org/abs/2610.13161

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Measurement-Driven Early Warning for Resilient 5G NSA Railway Networks

This paper presents a measurement-driven study of early warning for reliability breakdown events in 5G non-standalone (NSA) railway networks. Using 10 Hz metro-train measurement traces with serving- and neighbor-cell indicators, we benchmark six representative learning models, including CNN, LSTM, XGBoost, Anomaly Transformer, PatchTST, and TimesNet, under multiple observation windows and prediction horizons. Rather than proposing a new prediction architecture, this study develops a measurement-driven benchmark to quantify the feasibility and operating trade-offs of seconds-ahead reliability prediction in 5G NSA railway environments. Experimental results show that learning models can anticipate radio link failure (RLF)-related reliability breakdown events seconds in advance using lightweight radio features available on commercial devices. The presented benchmark provides insights for sensing-assisted communication control and offers an empirical foundation for integrating sensing and analytics into future mobility control.

cs.NI↗

RADIUS-Assisted Companion PSK Discovery: Enabling WPA3-SAE in Externally Authenticated Multi-PSK (ePSK / MPSK / DPSK / iPSK / PPSK) Deployments

Large multi-dwelling unit (MDU), student-housing and hospitality networks rarely store resident pre-shared keys (PSKs) on the access point (AP). Instead, the per-resident keys of ePSK, MPSK, DPSK, iPSK or PPSK services are held in an external RADIUS server or cloud database synchronised with the property-management system. Our earlier work, Companion-BSSID-Assisted PSK Discovery (CAPD), brought WPA3-SAE to multi-PSK networks by learning the client's PSK on a WPA2-only companion BSSID and steering the client with IEEE 802.11v to a hidden WPA2/WPA3 primary BSSID of the same SSID. CAPD assumes that the AP can test every PSK itself. This paper removes that assumption. We propose RADIUS-Assisted Companion PSK Discovery (RA-CAPD). The AP forwards the ANonce, the raw EAPOL-Key message 2 (SNonce, MIC, RSNE), the SSID, the client MAC, the BSSID and the AP MAC to the external server in RADIUS vendor-specific attributes (VSAs). The server validates the MIC against all provisioned keys, identifies the matching PSK, and returns it encrypted under the RADIUS shared secret (or a per-AP key for cloud databases), together with the unit, room or user identity and the VLAN. The AP binds the client to this PSK and identity, synchronises the binding across all APs in the domain, and moves the client to the configured profile: 802.11v-capable clients via a BSS Transition Management request, and other clients by disconnection and reconnection. On that profile, SAE-capable clients complete WPA3-SAE and WPA2-only clients complete WPA2-PSK, both with the learned key and no further search, so the companion BSSID serves only for onboarding. We present the design, attribute dictionary, algorithms, complexity and security properties, together with laboratory validation on commercial access points.

cs.NI↗

Scheduling Parallel Optical Circuit Switches for AI Training

The rapid growth of AI training has dramatically increased datacenter traffic demand and energy consumption, which has motivated renewed interest in optical circuit switches (OCSes) as a high-bandwidth, energy-efficient alternative for AI fabrics. Deploying multiple parallel OCSes is a leading alternative. However, efficiently scheduling time-varying traffic matrices across parallel optical switches with non-negligible reconfiguration delays remains an open challenge. We consider the problem of scheduling a single AI traffic demand matrix $D$ over $s$ parallel OCSes while minimizing the makespan under reconfiguration delay $δ$. Our algorithm Spectra relies on a three-step approach: Decompose $D$ into a minimal set of weighted permutations; Schedule these permutations across parallel switches using load-aware assignment; then Equalize the imbalanced loads on the switches via controlled permutation splitting. Evaluated on realistic AI training workloads (GPT model and Qwen MoE expert routing) as well as standard benchmarks, Spectra vastly outperforms a baseline based on state-of-the-art algorithms, reducing schedule makespan by an average factor of $1.4\times$ on GPT AI workloads, $2.7\times$ on MoE AI workloads, and $2.4\times$ on standard benchmarks. Further, the makespans achieved by Spectra consistently approach newly derived lower bounds.

cs.NI↗