Metraipolis › archive › dc_fbc0724b347f

MATE: Multi-Agent Traffic Engineering for Topology-Aware Distributed SRv6 Scheduling under Bursty Traffic — arXiv:2611.01831

Source
arXiv (en)
Original
https://arxiv.org/abs/2611.01831
License (as archived)
CC0-1.0
Archived
2026-11-03T18:42:16.522Z
SHA-256 of the archived text
3f0367b370ef9836245124b7a14ea77158086c37bb9a1157ec0de263a2b7038d
Stable URL of this page
https://metraipolis.com/documento/dc_fbc0724b347f

How to cite

MATE: Multi-Agent Traffic Engineering for Topology-Aware Distributed SRv6 Scheduling under Bursty Traffic — arXiv:2611.01831 — arXiv (en), https://arxiv.org/abs/2611.01831 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_fbc0724b347f (Metraipolis archive dc_fbc0724b347f, sha256 3f0367b370ef9836245124b7a14ea77158086c37bb9a1157ec0de263a2b7038d)
BibTeX
@misc{dcfbc0724b347f,
  title = {MATE: Multi-Agent Traffic Engineering for Topology-Aware Distributed SRv6 Scheduling under Bursty Traffic — arXiv:2611.01831},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2611.01831},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_fbc0724b347f; sha256 3f0367b370ef9836245124b7a14ea77158086c37bb9a1157ec0de263a2b7038d},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.01831. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

As network traffic becomes increasingly dynamic and bursty, conventional centralized traffic engineering (TE) suffers from long control-loop delays caused by network-state aggregation, centralized computation, and policy distribution. In this paper, we propose MATE, a multi-agent TE method for proactive distributed scheduling in hybrid networks with partial deployment of Segment Routing over IPv6 (SRv6). MATE uses historical traffic stability to characterize the burst risk of each traffic demand and path sensitivity to quantify the ability of candidate paths to accommodate additional traffic, thereby enabling differentiated proactive scheduling tailored to heterogeneous traffic characteristics. MATE adopts an offline-centralized training and online-distributed execution architecture. During training, a shared global critic evaluates joint actions under a reward combining maximum link utilization (MLU) with variability-weighted path sensitivity, while counterfactual difference rewards provide agent-specific credit for actor learning. During online execution, edge agents generate traffic-splitting policies from local observations and apply them through SRv6, avoiding centralized optimization in each scheduling interval. Experiments on the China Environment for Network Innovations (CENI) testbed and simulations on the Sanet topology show that MATE outperforms a multi-agent reinforcement learning (MARL) ablation baseline without agent-specific credit assignment, COPE, and TEAL in most evaluated scenarios and approaches centralized FIGRET on measured traffic traces. On CENI-Abilene, MATE achieves MLU within 10% of the linear-programming optimum in up to 90.1% of test instances. MATE also achieves lower median normalized MLU than FIGRET in most tested failure scenarios, with mean neural-inference times of 2.05--3.14~ms.

Tema degli esploratori: calcolo e infrastrutture (elenco arXiv cs.NI, nuovi lavori del giorno).
Categorie arXiv: Networking and Internet Architecture (cs.NI).
Pagina del lavoro: https://arxiv.org/abs/2611.01831 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-11-03T18:13:22.773Z dalla pagina https://arxiv.org/list/cs.NI/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).