- Rating
- 2
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
This paper presents CORA, a learned improvement method for virtual network function reconfiguration. Starting from a feasible deployment supplied by a bounded repair procedure, CORA uses a graph policy to rank move and swap actions. An exact checker filters out infeasible successors, and a bounded multi-start search returns the best feasible solution encountered. The policy is trained using a truncated policy-gradient objective and early ranking supervision. Experiments across three types of starting solutions show consistent paired improvements. The paper also includes classical-search comparisons, ablations, topology-transfer tests, and a small-instance conditional-optimality study.
Critical strengths
- The separation between construction, repair, and improvement is useful. CORA can refine deployments from different providers through a common interface. Exact successor checks preserve modeled feasibility, and keeping the best incumbent prevents the returned solution from getting worse than the repaired start. This is a sensible design for constrained optimization.
- The paired evaluation is carefully handled. The authors compare solutions from identical repaired starts, aggregate policy replicas within problem instances, and bootstrap over problem seeds. They also report failed starts separately and include both evaluation-matched and time-matched comparisons. The consistent gains across three start classes support the claim that the refinement stage is reusable.
Critical weaknesses
- The added value of the learning components is not fully isolated, and ablation experiments are needed.
- The experiments cover a fairly controlled version of the application.The generator makes queue stability placement-invariant, relaxes deadlines when needed, and scales bandwidth demands down to keep initial link utilization below a specified level. Requests also share an ingress and egress, and SFC–VNFI assignments remain fixed. These assumptions are clearly disclosed, but they limit how much the experiments tell us about settings where queueing, bandwidth, and delay are simultaneously tight. The largest family has 120 SFCs, and each transfer family has only five problem seeds. More evidence is needed to establish the method’s practical value beyond the tested synthetic workload.
Questions for authors
- What is the exact relationship between the four incremental features and the one-step objective change? How expensive would it be to rank candidates directly using the same incremental calculations?
- Under the same features, supervision budget, and search procedure, how do a feature-only MLP and a ranking-only policy perform?
- How often do CPU, memory, bandwidth, and delay constraints each reject candidate actions? Does CORA retain its advantage when bandwidth and delay are tighter?
- Could you provide the instance generator, incremental checker, evaluation implementation, and model weights so that the main comparisons can be independently reproduced?
2 comments
Looking forward to your reply
Dear Reviewer QmEo,
We value your positive feedbacks and constructive suggestions for our paper and sincerely appreciate your effort in reviewing it. We hope we have effectively addressed all the concerns raised. As the end of the discussion is approaching, we are wondering if there are any additional potential clarifications or suggestions that you think would help us improve this manuscript.
Thank you again for your dedicated review and invaluable insights.
Kind regards,
Paper CORA(id:45326) Authors
We add controlled learning-component ablations, tighter-constraint and expanded-seed tests, audit the incremental objective calculations and constraint rejections, and specify the materials needed to reproduce
We thank the reviewer. We added matched ablations and harder tests.
W1&Q2.
Table 1. Component ablation (lower ΔJ is better).
Table 2. Full training versus ranking-only training (95% CI).
Table 3. Full CORA versus ranking-only GNN by scale.
Ranking supervision stabilizes candidate ranking; RL uses trajectories to improve the multi-step result. Full CORA gains 0.00129 [0.00062,0.00209] over ranking-only and 0.01589 [0.00766,0.02526] over RL-only. Feature MLP judges immediate change; graph encoding adds physical/service context for actions with similar local features but different later effects. They are complementary.
W2.
Table 4. CORA under tighter resources (95% CIs).
Topology/scale tests use ten seeds per condition. ΔJ is change from CORA's strict start, not a baseline contrast:
Table 5. Topology/scale tests (95% CIs).
These results show that CORA improves the same strictly feasible starts under bandwidth, latency, joint constraints, and traffic disturbances, rather than relying on lenient resources. We thank the reviewers for noting the limits of synthetic evaluation. Production data covering physical topology, VNF resources, service-chain demands, and migration records are difficult to obtain. For the deployment-refinement problem studied here, synthetic instances approximate relevant network conditions while enabling controlled resource stress and reproducible paired comparisons. Real networks may vary in capacity, traffic, constraints, and objectives; CORA’s separation of candidate generation, feasibility checking, and objective evaluation facilitates adaptation to these settings. We also test stricter resource conditions and more prespecified problem seeds. Of course,platform-specific performance still requires validation with real data.
Q1. We audited four increments—CPU, memory, and link variance plus affected-SFC delay—against full recomputation on 23 strict starts; they recover one-step change to numerical precision. Analytic incremental greedy shares starts, legal actions, checks, budget, and information. It wins on some tiny-budget starts, but CORA gains as budget and scale increase by selecting actions with later potential. A full analytic scan takes 154.8 ms versus 72.2 ms to score an already formed CORA batch; scopes differ, so end-to-end efficiency is assessed separately.
Q3. We added exact per-action rejection attribution.
Table 6. Rejection rates and CORA gains (95% CIs).
Across four pressure settings, CORA retains positive paired gains over the same-information baseline, including tight bandwidth and joint pressure.
Q4. We thank the reviewer for emphasizing reproducibility. We have organized a complete package and will provide it anonymously, including start construction, bridge repair, candidate generation, exact checks, and the learned policy.