Peer Review Report

This manuscript presents an interesting exploration of consensus mechanisms adapted for resource-constrained edge computing environments. The authors propose a modified Raft protocol that reduces message complexity while maintaining safety guarantees.

• Clear motivation for the problem addressed
• Rigorous theoretical analysis of the proposed algorithm
• Comprehensive experimental evaluation across multiple scenarios
• Well-written with good organization and clarity

• Limited discussion of related work in edge computing consensus
• Experimental setup could benefit from larger-scale deployments
• Some notation inconsistencies in Section 3.2

Section 2 (Background): The background provides adequate context, though a deeper comparison with recent edge-specific consensus work would strengthen positioning.

Section 3 (Proposed Method): The core contribution is sound. The proof of Theorem 3.1 is correct, though the notation $\\alpha_i$ vs $\\alpha^i$ should be made consistent.

Section 4 (Evaluation): Experimental results are convincing for the tested scenarios. Consider adding results from deployments with >100 nodes to demonstrate scalability claims.

Decision: Accept with Minor Revisions

This is a solid contribution that advances the state of the art in edge computing consensus. The identified weaknesses are addressable through minor revisions and do not detract from the paper's core contributions. I recommend acceptance pending the following minor revisions:

1. Expand related work discussion in Section 2
2. Clarify notation in Section 3.2
3. Add brief discussion of larger-scale deployment considerations

The authors should be able to address these points without requiring a second round of review.