Update README.md
Browse files
README.md
CHANGED
|
@@ -1,3 +1,45 @@
|
|
| 1 |
---
|
| 2 |
license: mit
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 3 |
---
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
---
|
| 2 |
license: mit
|
| 3 |
+
language:
|
| 4 |
+
- en
|
| 5 |
+
pipeline_tag: reinforcement-learning
|
| 6 |
+
tags:
|
| 7 |
+
- reinforcement-learning
|
| 8 |
+
- graph-neural-networks
|
| 9 |
+
- traffic-engineering
|
| 10 |
+
- routing
|
| 11 |
+
- nsfnet
|
| 12 |
+
- sb3
|
| 13 |
---
|
| 14 |
+
|
| 15 |
+
# GARRO: Graph-Aware Reinforcement Routing Optimizer (NSFNet Topology)
|
| 16 |
+
|
| 17 |
+
GARRO is a Graph Neural Network (GNN)-enhanced Reinforcement Learning (RL) routing policy designed for optimal traffic engineering in dynamic network topologies. This repository contains the trained model parameters, evaluation summaries, and performance benchmarks evaluated on the **NSFNet** topology.
|
| 18 |
+
|
| 19 |
+
- **GitHub Repository:** [DanielAgbeni/GARRO](https://github.com/DanielAgbeni/GARRO)
|
| 20 |
+
- **Framework:** PyTorch / Stable-Baselines3
|
| 21 |
+
- **Topology:** NSFNet
|
| 22 |
+
|
| 23 |
+
## Model Performance Benchmarks
|
| 24 |
+
|
| 25 |
+
Below is the comparative performance summary of GARRO against standard routing baselines (Random, ECMP, and OSPF) on the NSFNet topology:
|
| 26 |
+
|
| 27 |
+
| Algorithm | Mean Episode Reward (↑) | End-to-End Latency (ms) (↓) | Packet Delivery Ratio PDR (%) (↑) | Max Link Utilization (↓) |
|
| 28 |
+
| :--- | :--- | :--- | :--- | :--- |
|
| 29 |
+
| **Random** | ~41.5 | ~20.8 | ~99.6% | ~0.88 |
|
| 30 |
+
| **ECMP** | ~41.8 | ~20.8 | ~99.6% | ~0.88 |
|
| 31 |
+
| **OSPF** | ~52.8 | ~20.4 | ~99.7% | ~0.87 |
|
| 32 |
+
| **GARRO** | **~52.8** | **~20.4** | **~99.7%** | **~0.87** |
|
| 33 |
+
|
| 34 |
+
### Key Takeaways
|
| 35 |
+
* **High Reward Efficiency:** GARRO significantly outperforms standard multipath (ECMP) and uncoordinated random routing, achieving mean episode rewards comparable to optimized short-path routing protocols (OSPF).
|
| 36 |
+
* **Latency Optimization:** Minimizes end-to-end packet transmission latency across dynamic traffic environments.
|
| 37 |
+
* **Reliability & Load Balancing:** Maintains high overall Packet Delivery Ratio (PDR > 99.7%) while effectively balancing dynamic link utilization.
|
| 38 |
+
|
| 39 |
+
## Usage
|
| 40 |
+
|
| 41 |
+
To load and use the model with PyTorch/Stable-Baselines3, clone the core implementation repository:
|
| 42 |
+
|
| 43 |
+
```bash
|
| 44 |
+
git clone [https://github.com/DanielAgbeni/GARRO.git](https://github.com/DanielAgbeni/GARRO.git)
|
| 45 |
+
cd GARRO
|