Toward Loosely Coupled Orchestration for the LEO Satellite Edge
summary
Proposes a new orchestration design for LEO edge networks that uses path models, temporal compensation, and affinity chains as concrete scheduling primitives, implements a prototype scheduler for stateful caching, and evaluates it against a baseline over realistic LEO link delays and contact windows. Preliminary results show measurable gains in service availability and lower request latency for the caching function, and identify when affinity chaining versus temporal compensation yields the biggest benefit.
AI-written summary · about
chapters (6)
- 0:00Introduction to LEO satellite orchestration
- 2:31Current orchestration challenges
- 4:51Satellite connectivity in rural areas
- 7:17Technical limitations and solutions
- 9:31Model evaluation and future directions
- 11:12Conclusion and Q&A
related talks
16mLEOCraft: Towards Designing Performant LEO Networks
52mLoosely or lousily coupled? Understanding communication patterns
01mEdge Computing
16mSpatial Programming for Environmental Monitoring
19mOpenTela: Unifying Decentralized Computing Resources for Heterogeneous LLM Serving (Oper…
41mDeclarative, Convergent Edge Computation
14mOrbWeaver: Using IDLE Cycles in Programmable Networks for Opportunistic Coordination
56mDesign Patterns for Multi Agent Systems