← 研踪 PaperTrailarXiv:2611.09585 · v1
Scalable Full-Horizon SFC Deployment over Predictable SAGIN Topologies via Configurable Column Generation Framework
首次提交 2026-11-06 23:20
版本更新 2026-11-06 23:20
雷达观测 2026-11-09 13:22
摘要
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.
作者备注：18 pages, 10 figures, 4 tables
观测到的版本
相邻记录可能跳过中间版本；首次发现 v2 及以上也会标为版本更新。
v1 · 2026-11-06 23:20 · 最新观测版本
Scalable Full-Horizon SFC Deployment over Predictable SAGIN Topologies via Configurable Column Generation Framework
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.
查看此版本解读 →查看此版本原文 ↗