Search arXiv⌕ Search

arXiv · 2611.09585

Scalable Full-Horizon SFC Deployment over Predictable SAGIN Topologies via Configurable Column Generation Framework

Abstract

Space-air-ground integrated networks (SAGINs) integrate heterogeneous communication and computing resources to support ubiquitous services. Service function chains (SFCs) enable complex services to be composed of ordered functions and executed collaboratively across these resources. Mobility continuously reshapes connectivity throughout service execution, yet much of the resulting topology evolution is predictable. Decisions based only on isolated topology snapshots may therefore overlook valuable future connectivity. We formulate an admission-first, cost-aware model on a time-expanded graph for SFC deployment. Our key observation is that temporal feasibility is request-specific, whereas global coupling arises mainly from shared-resource competition. We therefore develop a configurable column-generation framework in which complete request deployments form columns and a restricted master problem coordinates admission and resources. SAGINFE, a fast constructive heuristic built on per-flow embedding (PFE), supplies a standalone feasible solution and initial columns. Configurable pricing schedules combine early-terminated and stricter searches, supplemented by selective PFE candidates. Candidates undergo feasibility and exact reduced-cost checks. Request-wise pricing can run in parallel, followed by finite-pool integer selection. The default configuration improves the admission-first objective over initialization on all 120 main instances. Four pricing workers achieve up to a 2.69-fold median pricing-stage speedup while preserving admitted request counts in the tested cases.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Hang Li, Hao Huang, Yihu Xu, Zixuan Kong, Yanling Jin. 2026-11-06. Scalable Full-Horizon SFC Deployment over Predictable SAGIN Topologies via Configurable Column Generation Framework. https://arxiv.org/abs/2611.09585

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

KEEP EXPLORING

Related papers

A Wavelength Borrowing Architecture for Optical Data Center Networks - Extended Version

The growth of east-west traffic, along with the cost and power consumption of electronic switching, is motivating the integration of a low-power, high-rate, all-optical layer within the data center network. This paper presents a spine-leaf all-optical architecture in which the default wavelength configuration, one wavelength per source--destination leaf pair, can be reconfigured to accommodate unbalanced traffic demand: wavelengths that are unused or lightly loaded at one leaf are borrowed by another leaf with higher demand. This topology-engineering capability is combined with a traffic-engineering scheme, based on two-hop detouring, enabling the control of wavelength load while limiting the amount of detoured traffic. A key feature of the architecture is that its degree of wavelength reconfigurability is set by a single tunable parameter, the borrowing degree $B$, ranging from none to full; performance evaluation shows that performance nearly equal to that of a fully reconfigurable architecture is achieved well below the maximum $B$, saving the complexity of a fully reconfigurable solutions. The optical fabric relies on mature, data-center-grade components, namely AWGs, AWGRs, colorless OXCs, and combiners. The reconfiguration speed and the adopted dynamic control policy make the architecture suitable for network tiers where the traffic varies on timescales of tens of minutes or more, e.g., among groups of racks (pods).

cs.NI↗

PriorityFEC: Deadline-Aware Streaming FEC for KV-Cache Handoff in Edge Multi-Agent Systems

Collaborative edge large language model (LLM) systems often require repeated prefill computation when task contexts are transferred between agents. Reusing previously computed key--value (KV) caches can eliminate this overhead, but requires KV-cache delivery before the receiving agent begins decoding. Under strict deadlines and unreliable edge links, complete KV cache transfer may be infeasible, making the timely delivery of useful KV information critical. This paper proposes PriorityFEC, a utility-aware KV-cache handoff scheme that combines prioritized source transmission with adaptive loss recovery. PriorityFEC first organizes KV blocks into a utility-aware source queue to prioritize important information. It then employs ACK-sliding Streaming FEC and a lightweight Double Deep Q-Network (Double-DQN) scheduler to dynamically balance source delivery and repair transmission under deadline constraints. We implement PriorityFEC in a distributed edge LLM-serving prototype and evaluate it using Qwen2.5-7B-Instruct and Llama-3.1-8B-Instruct across multiple workloads. Experimental results demonstrate that PriorityFEC preserves more useful KV information and achieves substantially higher task accuracy than competing transport schemes, particularly when the deadline is insufficient to deliver the complete KV cache.

cs.NI↗

Computation-Efficient Aerial-Marine Integrated Networks for Search and Rescue via Cooperative HAPS, UAVs, and MASSs

In this paper, we propose an aerial-marine integrated network architecture tailored for maritime search and rescue (MSAR) operations, where a high altitude platform station (HAPS) and maritime autonomous surface ships (MASSs) are equipped with edge servers, providing computing services for surveillance uncrewed aerial vehicles (UAVs). These UAVs generate substantial volumes of computation-intensive and delay sensitive tasks, some of which can be strategically offloaded to both MASSs and HAPSs for distributed processing. We formulate the joint task offloading and resource allocation as a mixed-integer nonlinear program (MINLP) to minimize the system computation overhead (CO), quantified by a weighted sum of task completion time and energy consumption. Given the stochastic nature of task arrivals from UAVs and the dynamic characteristics of marine channel conditions, we employ a two-stage optimization to decompose the problem into four tractable subproblems, i.e., 1) edge server selection, 2) transmission power allocation, 3) edge computing resource allocation, and 4) local computation resource allocation. In stage I, we optimize the edge server selection via many-to-one matching. In stage II, we determine the transmission power of each UAV with quasi-convex optimization and solve the edge computing and local computing resource allocation subproblems via a projected gradient descent method and convex optimization, respectively. Simulation results validate that the proposed scheme can achieve superior system performance over benchmark schemes.

cs.NI↗