{"paper":{"title":"Near-optimal Online Traffic Engineering","license":"http://creativecommons.org/licenses/by/4.0/","headline":"OnlineTE uses optimization decomposition for distributed solvers that deliver near-optimal WAN traffic engineering within seconds of changes.","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Arvin Ghavidel, Nikolai Matni, Pooria Namyar, Ramesh Govindan, Walter Willinger","submitted_at":"2026-05-15T17:06:56Z","abstract_excerpt":"Most deployed WAN Traffic Engineering (TE) systems use a logically centralized controller that periodically gathers traffic demands, runs a TE optimization or heuristic, and then programs the network. At scale, these solutions can be sub-optimal, and can take minutes to react to demand changes or failures. In this paper, we introduce OnlineTE, a system that reacts immediately to demand changes and failures, and delivers near-optimal solutions within seconds of a change. OnlineTE builds on the theory of optimization decomposition to devise scalable, near-optimal, distributed TE solvers for path"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"OnlineTE delivers near-optimal solutions within seconds of a change, scales to large WANs, and can outperform the state-of-the-art by up to an order of magnitude on a 750-node WAN topology emulation.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"That the theory of optimization decomposition can be turned into a practical distributed solver whose local subproblems, when coordinated, remain near-optimal under real WAN dynamics, failures, and measurement noise.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"OnlineTE uses optimization decomposition to enable distributed, near-optimal traffic engineering that reacts in seconds to changes in large WANs and outperforms prior centralized approaches in emulation.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"OnlineTE uses optimization decomposition for distributed solvers that deliver near-optimal WAN traffic engineering within seconds of changes.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"18af2cfb56211438abe4da59aab4a8b2b215e596964f86da7e804204a0321775"},"source":{"id":"2605.16187","kind":"arxiv","version":1},"verdict":{"id":"47d221aa-1f7b-4e47-959a-58b7a684b7c4","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-19T18:16:02.609354Z","strongest_claim":"OnlineTE delivers near-optimal solutions within seconds of a change, scales to large WANs, and can outperform the state-of-the-art by up to an order of magnitude on a 750-node WAN topology emulation.","one_line_summary":"OnlineTE uses optimization decomposition to enable distributed, near-optimal traffic engineering that reacts in seconds to changes in large WANs and outperforms prior centralized approaches in emulation.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"That the theory of optimization decomposition can be turned into a practical distributed solver whose local subproblems, when coordinated, remain near-optimal under real WAN dynamics, failures, and measurement noise.","pith_extraction_headline":"OnlineTE uses optimization decomposition for distributed solvers that deliver near-optimal WAN traffic engineering within seconds of changes."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.16187/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"doi_title_agreement","ran_at":"2026-05-19T18:31:18.728414Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_compliance","ran_at":"2026-05-19T18:30:55.908883Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"cited_work_retraction","ran_at":"2026-05-19T17:52:01.113128Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"citation_quote_validity","ran_at":"2026-05-19T17:49:47.010179Z","status":"skipped","version":"0.1.0","findings_count":0},{"name":"ai_meta_artifact","ran_at":"2026-05-19T17:33:30.558646Z","status":"skipped","version":"1.0.0","findings_count":0},{"name":"external_links","ran_at":"2026-05-19T17:31:42.415272Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"claim_evidence","ran_at":"2026-05-19T16:41:55.414841Z","status":"completed","version":"1.0.0","findings_count":0}],"snapshot_sha256":"0a282e694363d3673220125bdac00dab869a08b990fe0c083d4b7785d346a578"},"references":{"count":48,"sample":[{"doi":"","year":null,"title":"[n. d.]. Arista 7800 Series. https://www.arista.com/assets/data/pdf/ Datasheets/7800R4-Series-AI-Spine-Datasheet.pdf. ([n. d.])","work_id":"df8f404b-e8a4-4ff2-9019-d77516c4aa7e","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":null,"title":"[n. d.]. Internet Topology Zoo. http://www.topology-zoo.org/. ([n. d.])","work_id":"4eb5d0ef-fce1-4d27-a6f1-bb324e76815a","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2021,"title":"Firas Abuzaid, Srikanth Kandula, Behnaz Arzani, Ishai Menache, Matei Zaharia, and Peter Bailis. 2021. Contracting Wide-area Network Topologies to Solve Flow Problems Quickly. InNSDI","work_id":"e7906b73-c932-4800-8ccf-8cbb741c0ca6","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"10.1145/3651890.3672237","year":2024,"title":"Rdma over ethernet for distributed training at meta scale","work_id":"7624824b-e6d7-482d-9b94-0e5d49db10f4","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2022,"title":"David Applegate, Mateo Díaz, Oliver Hinder, Haihao Lu, Miles Lubin, Brendan O’Donoghue, and Warren Schudy. 2022. Practical Large- Scale Linear Programming using Primal-Dual Hybrid Gradient. (2022). ar","work_id":"e9cbf8af-1e6a-48d4-a236-a47b05a74bd2","ref_index":6,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":48,"snapshot_sha256":"15dd4ce8441a663f174ce2c0e007d7b07838a7835edd9a4e798a8eacfd8ee424","internal_anchors":1},"formal_canon":{"evidence_count":2,"snapshot_sha256":"94f6c6095db3c257e7c5153f939f3d1966ea3d081c2b06d15ca15a65ff2bd975"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}