arXiv (All)
open access
Lexicographic Minimax Load Balancing for T-Adaptive Segment Routing
We introduce the T-Adaptive Segment Routing, a multi-period optimization problem that emerges in the traffic engineering of core IP/MPLS networks when scheduled maintenance operations are involved. The problem seeks a sequence of Segment Routing (SR) configurations that can adapt to a multi-period s
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Use of BGP for Routing in Large-Scale Data Centers#166295
- NETWORK SHAPING FOR PROACTIVE MAINTENANCE#674629
- Strategic Demand-Planning in Wireless Networks: Can Generative-AI Save Spectrum and Energy?#426358
- ContinuityBench: A Benchmark and Systems Study of Stateful Failover in Multi-Provider LLM Routing#381754
- BGP Colored Prefix Routing (CPR) for Services Based on Segment Routing over IPv6 (SRv6)#164160
Record · ID 1131180
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive