- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 1
Read review
Paper summary
This paper propsoes a network foundation model called NetCast, which is pretained by predicting the latent embeddings of future traffic bursts based past history. 4 datasets were used for validation.
Critical strengths
The idea of pre-training by predicting the latent embeddings of future traffic bursts from hisoty of past bursts has value.
Critical weaknesses
No headline claim is statistically supported. Numbers in tables 1-5 lack statisticaly significancne. Average with standard deviation can be more convincing if put in those tables to make any statistically valid conclusions or claims. The mean CKA margin 0.002 is small. The downstream average margin 0.26 (84.39 vs. 84.13) is also very small that may not support the conclussion of better performance when comapred with existing methods. Appendix D did show the standard devistion but those standard deviations are big (e.g., 0.405 ± 0.369), too big to claim the the average margin is statistially meaningful.
Also, no downstream advantage over the strongest fair baseline. Against netFound-base (225M), NetCast ties on all three tasks. The efficiency difference (48M vs 225M) may not be a meaningful win when it runs on a netowrk device, in terms of the networking metrics such as latency and throughput. Both fits in a modern GPU easily. So, the practical impact on netowrking is very minimum.
Questions for authors
none
Rebuttal:
We thank the reviewer for the assessment and for recognizing the value of predicting future burst representations from past traffic. We clarify our contribution in parameter efficiency and the interpretation of Appendix D, particularly the review's reasoning about GPU capacity and standard deviation.
Parameter efficiency and downstream performance
The review assesses downstream benefits mainly through the comparison with netFound base. However, an important contribution is competitive task performance within a smaller parameter budget. The comparison with the closest model in size, netFound small (53M), therefore also deserves consideration.
At a comparable parameter scale, NetCast improves Crossmarkets Acc@10 from 47.27 to 60.64 and VPN F1 from 89.20 to 92.53. These comparisons use the same pretraining corpus and input processing pipeline.
Compared with the 225M netFound base, NetCast achieves nearly identical Crossmarkets performance and a higher VPN F1 point estimate with approximately 21% of the parameters. Describing the results only through the average downstream score difference of 0.26 overlooks model size. Our central result combines a smaller parameter budget with competitive task performance.
GPU capacity and practical deployment value
The review argues that practical value is minimal because both models fit on a modern GPU. We believe that whether a model fits on a GPU is insufficient to assess parameter efficiency or deployment value.
Fitting on a GPU only establishes that the model meets the device's capacity constraint. It does not imply equal memory consumption, supported batch sizes, inference latency, throughput, or concurrency. These depend on the hardware and workload and cannot be inferred from GPU fit alone.
NetCast (48M) uses approximately 79% fewer parameters than netFound base (225M) while achieving competitive downstream performance. This demonstrated parameter efficiency does not disappear because both models fit on the same GPU. Fewer parameters do not automatically imply lower latency or higher throughput, but sufficient GPU capacity does not establish that resource differences have no practical value either. We therefore ask that the assessment consider model size and task performance rather than GPU fit alone.
Our new measurements on a single NVIDIA A100 provide direct evidence of this distinction. At batch size 256, NetCast (48M) processes approximately 1,958 flows/s, compared with 1,548 for netFound-small (53M) and 330 for netFound-base (225M). It also supports batch size 1,024, whereas netFound-large (640M) runs out of memory at batch sizes 512 and 1,024. These results demonstrate higher batched throughput and greater supported batch capacity in the measured setting. We invite the reviewer to consult Section 4.5 and Figure 3 of the revised manuscript for the full throughput, latency, and memory-capacity comparison.
Appendix D and the main CKA comparison
The review cites 0.405 ± 0.369 from Appendix D to question the average CKA difference in Table 3. However, this standard deviation describes alignment with one traffic feature, not uncertainty in the average difference between models.
A large standard deviation for one feature does not show whether the aggregate model difference is statistically significant. That requires uncertainty estimates for the comparison itself. Appendix D therefore cannot directly support the conclusion that the average CKA difference is not meaningful.