- Rating
- 2
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
The paper models a fixed team forwarding unchanged evidence packets over a directed network. Enabled channels incur session costs; packet hops incur traffic costs. For six workers, it compares complete direct communication, six bidirectional stars, and 90 modular graphs, each with two groups of three and one gateway per group. Two fitted quantities summarize these choices. Hub residual demand measures traffic not incident to the best hub. Modular detour gives the least added forwarding cost after choosing partitions and gateways. Their cost contrasts with direct communication identify the cheapest family. Within a fixed partition, gateways can be selected independently. Statistical bounds cover demand estimates, distribution change, and observation or switching costs.
Critical strengths
I found the problem formulation interesting because it connects how a team is organized to the cost of sharing information. Costs, preservation of delivery, candidate graphs, fitted summaries, and tie rules are explicit. The gateway identity simplifies implementation. Equal-hub-concentration examples show why concentration alone cannot distinguish local from diffuse exchange.
I particularly like the care taken to separate learning from future evaluation. Methods share the same future packets, which are separate from observed requests; development and evaluation seeds also differ. Learning costs are charged even when the graph stays unchanged. The permutation control separates finding the right worker connections from choosing a graph family.
I appreciate the authors' willingness to show where the approach does not help. They retain the null modular result at high channel price, losses under demand replacement, costs of rejected changes, and the stronger selective fixed planning control. They identify the modular ablation and sharper confidence analysis as post hoc and document reasoning as planned work.
Critical weaknesses
My main reservation is what the signature adds beyond the optimized costs of the chosen graph families. The two demand summaries are optimized forwarding penalties of predefined alternatives. Each family has a fixed edge count, so their ability to identify the cheapest family follows from comparing three affine cost expressions.
I can see the modeled savings from matching connectivity to persistent demand after paying learning expenses. What I am not yet convinced of is that the favorable prices describe a real system. The gains depend on assigned channel, collection, selection, and switching prices. Selector CPU time is measured, but neither this nor request acquisition is converted into the units used for session and hop costs.
Questions for authors
What insight or predictive advantage remains beyond fixed-family cost minimization when group counts and sizes can vary? To judge the importance of this restriction, I would also need to know how much savings the two-triad family leaves unrealized.
Could you identify a runtime with a measured per-enabled-channel cost high enough to make the selector useful? Please show whether it still beats selective direct communication after measured acquisition and selection costs.
Please explain what information justifies a deployed policy's drift bound and observation budget. I would then like to see whether a rule fixed before evaluation beats never observing on fresh trials, counting all rejected attempts.
Hi everyone, please acknowledge the authors’ rebuttal with a brief reply, even if your assessment is unchanged (if you already did or are about to do so, please ignore this message).