Backend
Starlight: Whittle-Driven Fidelity Rescue for Satellite-Terrestrial Quantum Networks
arXiv cs.NI0 views
arXiv:2611.17865v1 Announce Type: new Abstract: A planetary-scale quantum internet is constrained by exponential attenuation in terrestrial fibers. Low-Earth-orbit (LEO) satellites provide a low-loss vacuum backbone, but limited satellite resources must be allocated among competing connections under continuously evolving and heterogeneous physical conditions. Existing satellite scheduling remains largely provisioning-oriented, optimizing satellite-resource assignment for aggregate entanglement delivery. Recent age-based approaches instead incorporate chronological freshness into entanglement scheduling. Neither line of work directly identifies the connections most urgently requiring satellite assistance as their physical states evolve. We propose Starlight, a demand-driven satellite-terrestrial entanglement routing architecture that targets degrading connections before their terrestrial entanglement becomes unusable. Starlight introduces Effective Age of State (EAoS), a physics-aware metric that maps heterogeneous decoherence and swapping-induced fidelity penalties onto a unified additive coordinate. Representing each connection by evolving EAoS, we formulate rescue scheduling as a Restless Multi-Armed Bandit (RMAB) problem and derive a closed-form Whittle-style index approximation for top-K selection. Starlight further employs a two-timescale control plane and an asynchronous dispatch-and-mask pipeline to suppress redundant in-flight allocations. Simulations show that Starlight achieves up to 84.5% average satisfaction under constrained rescue capacity and sub-0.5-ms orchestration at 1,000 connections, while remaining robust to heterogeneous memory decay and stochastic atmospheric degradation.
Source:https://arxiv.org/abs/2611.17865PreviousSpace-based Zero-trust Architecture for Securing the Direct-to-Cell ParadigmNextEvaluating Polling Schemes for OFDMA Uplink Scheduling in Time-Sensitive Wi-Fi Networks
Related posts
CoordX Types: A Trustless, Swappable Type System for Shared Records
0arXiv cs.CR
Pairing AIS with RF: Analysis of a Markovian Approach for Maritime Data Fusion
0arXiv cs.CR
Courteous Anticipation: Improving Long-Lived Task Planning in Persistent Shared Environments
0arXiv cs.RO
Foundation Model Driven Robotics: A Comprehensive Review
0arXiv cs.RO
Disturbance-Aware Informative Planning in Spatiotemporal Environments
0arXiv cs.RO

I tore down ai-memory: 528,000 lines of trending code, and you probably don't need it
0dev.to AI