arXiv (All)
open access
On the T-Adaptive Segment Routing Problem
In this paper, we present a multi-period optimization problem arising from the traffic engineering of core IP/MPLS networks, called T-ASR. This problem aims at computing a sequence of segment routing paths that adapt to a multi-period scheduled maintenance, while allowing limited number of path reco
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
- Scheduled network software maintenance#211371
- Traffic Engineering in Large-scale Networks with Generalizable Graph Neural Networks#1013412
- Formal Abstractions for Packet Scheduling#1035247
- Management Information Base for Telephony Routing over IP (TRIP)#132798
- Segment Routing Centralized BGP Egress Peer Engineering#218471
Record · ID 1117608
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