- Rating
- 2
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This work addresses the problem of optimal active and low power state control in data center networks, It presents LinkRL where decentralized agents are trained for preempt the traffic behaviors. LinkRL claims significant power savings and latency improvement over baselines on network simulations.
Critical strengths
The paper’s suite of experiments and ablations appear to be thorough. Except for the significance concerns regarding Table 2 (See critical weaknesses), the experimental results appear to be compelling.
Critical weaknesses
In Table 2, the out of domain results (HPC and generic ML) have smaller gaps with or beat LinkRL on the NTG metric, especially within the reported standard deviation margin, so it is not clear whether LinkRL’s improvement is significant as the policy might be hyper-optimized for the in-domain 6 LLM training workloads. The training data detailed in Section 5.2 covers a wide range of model size, architectures, and schedules and is used as a one-size fit all policy for evaluations. A related concern is the impact of the size and quality of the training set, i.e. are the results replicable with just a smaller and less diverse subset of the training workloads?
Additionally, there is a major lack of documentation on training and test datasets and Section 5.2 and Appendix K are insufficient, which hinders replicability. Key missing details include the source of the data, training-holdout set split breakdown, and in the case of the LLM workloads breakdown of the number datapoints from each LLM model.
Questions for authors
1.The reward weight is swept across {40, 80, 120} and is noted to show monotonically decreasing performance across all evaluated metrics. Then why are reward weights smaller than 40 not tested given the monotonicity observation?
2.Why are Power Reduction and JTO metrics not reported in Table 2 for HPC and Generic ML workloads?
-
Do the authors have results on the individual held-out LLM workload? In other words, does the trained policy work similarly well across all workloads?
-
Section 5.2 mentions that there are 14.4 million LLM workload training points. What is the breakdown of these data points by LLM model?
-
How were the model sizes for the CNN and MLP layers (Appendix A) selected? Does the parameter count, as noted in Table 1, impact the performance given the same architecture?
-
Several tables in the appendix are missing titles and table numbers.
-
Details about the “Generic ML” traces appear to be missing from Appendix K.
We thank the reviewer for recognizing the experimental suite and for the concrete suggestions on generalization and reproducibility.
W1 (Out-of-domain gains and possible over-fitting): Table 2 now reports power reduction (PR), JTO and NTG for all workload groups. On HPC, LinkRL reaches 12.14% NTG versus 12.96% for Threshold, consistent with long, regular idle gaps favoring heuristics. On Generic ML, LinkRL reaches 7.56% versus 5.95% for the strongest baseline. On additional LLM workloads, it reaches 7.12% versus 5.06%. These results support transfer within the tested domains, rather than uniform superiority across domains. W2 directly tests training-workload diversity.
W2 (Smaller, less diverse training set): We ran an additional three- versus six-workload training ablation with three seeds. The retained workloads were GPT-4 MoE, GPT-3 175B dense and Llama 3 with SHARP. Mean NTG on their test segments was similar: 7.38% versus 7.68%. On omitted workloads, NTG was 2.37% versus 9.36%; on the ablation's held-out set, 2.54% versus 5.34%. Broader training therefore improves generalization. Appendix D, Table 8 reports the full matched comparison, including PR, JTO and standard deviations.
W3 (Dataset documentation): The LLM traces were recorded with NVIDIA Nsight at 100 μs intervals. We will release the full trace data. DNetSim replays interleaved compute and network operations. Each training recording is split chronologically into contiguous segments: approximately 80% training, 10% validation and 10% testing. Hyperparameters and checkpoints are selected by mean validation NTG; testing is reserved for final evaluation. We will expand Section 5.2 and Appendix K with this protocol and the breakdown below.
Q1 (Reward weights below 40): We ran additional tests at β = 10 and 20. Mean PR / JTO / NTG (%) was 13.85 / 4.02 / 8.44 and 12.49 / 2.99 / 8.95, respectively. The published β = 40 result is 10.87 / 0.90 / 8.88. Lower β increases power savings but also JTO. We prefer β = 40 because it retains similar NTG with lower JTO. Appendix D, Table 12 reports the lower-weight results.
Q2 (Missing HPC and Generic ML PR and JTO): These metrics are now included in manuscript Table 2. For LinkRL, PR / JTO / NTG (%) is 14.89 / 1.26 / 12.14 on HPC and 10.35 / 1.75 / 7.56 on Generic ML.
Q3 (Individual held-out LLM results): The breakdown below uses the original Table 2 evaluations. All metrics are percentages. NTG is positive on each workload, although its magnitude varies. Appendix K, Table 15 now reports this breakdown.
Q5 (Architecture and layer-size selection): We swept MLP, MLP-MLP and CNN-MLP architectures and layer sizes using validation performance. Larger models generally performed better in the size sweeps. All policy weights must fit in on-chip SRAM under a strict area budget, so we focused on compact models. Section 4.1, Table 1 and Figure 3 compare the architecture families; Appendix A lists the selected configuration. We will clarify this selection rationale.
Q6 (Missing appendix titles and numbering): The threshold, β and reallocation-factor sweeps now have numbered captions as Tables 5–7.
Q7 (Generic ML trace details): The three traces use uneven-cycle ring all-reduce workloads, alternating six-phase compute profiles with 1 MB collectives over 25 iterations. The profiles are balanced, bursty or ramped, providing controlled variation in compute and communication timing. We will add these construction details to Appendix K.