Efficient Link-State Multicast Routing by Optimizing Link-Weight with MARL
Bibliographic record
Abstract
Networks deployed in contested environments typically have limited resources and face many security threads including information leakage. Multicast traffic engineering with carefully considering eavesdropping attacks can improve network performance while avoiding the information leakage problem. In this paper, we address the problem of achieving multicast traffic engineering based on link-state routing protocols according to the offered traffic while taking the problem of alleviating eavesdropping attacks into consideration. We first provide an Integer Linear Programming (ILP) formulation that finds the optimal link weights for Shortest Path Tree (SPT)-based multicast routing protocols to minimize total network cost. The problem is NP-Hard, and obtaining a solution to the problem in real-time to adapt to highly dynamic traffic demands is very challenging. To meet the real-time requirement, we design a Multi-Agent Reinforcement Learning (MARL) solution to the problem of optimizing link weights to achieve efficient multicast routing in a distributed fashion. In our design, the agents collaborate and communicate with the others in the local region and learn from their experiences to determine the best action to minimize the overall network cost. Our proposed solution is evaluated on a simulation of various traffic profiles and compared with the conventional manually configured link weights and a Genetic Algorithm (GA)-based heuristic solution. Experimental results show the advantages of our solutions in reducing network cost and suggest the potential of using MARL in achieving efficient multicast traffic engineering.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one teacher head, not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".