Hi everyone,
I’m an undergraduate student from India applying for Master's programs in Computer Science in Japan (targeting the MEXT University & Embassy tracks for the October 2027–2028 intake). I’d love a quick sanity check from the community on the structure and scope of my 2-page research proposal before I finish sending out my professor inquiries.
Background: I already built a working P2P distributed file storage prototype in Go (featuring custom TCP binary framing, consistent hashing, and content-addressable storage). My proposed research extends this baseline.
1-Minute Pitch of the Proposal:
Title: Congestion-Aware Verifiable Pipelined Repair for Erasure-Coded Decentralized Storage
The Problem: Reed-Solomon erasure coding saves over 50% storage space compared to 3-way replication, but recovering a failed node causes heavy network incast. Pipelined repair protocols (like ECPipe and PivotRepair) fix the network bottleneck by routing 64 KiB repair slices through helper relays. However, they assume all helpers are completely honest. In a decentralized network, a single compromised relay can silently corrupt partial parity in transit (Byzantine parity pollution).
My Proposed Solution: Extend my Go storage engine to benchmark and compare two lightweight, SIMD-accelerated GF(28)-linear homomorphic MAC schemes using 128-bit tags over GF(2128) (bypassing heavy elliptic-curve pairings):
Scheme A (In-Transit Verification): Uses cover-free key families so intermediate relays can verify slices hop-by-hop without being able to forge tags for downstream nodes.
Scheme B (Optimistic Sink Verification + Binary Search): Only the sink/gateway holds the master key, incurring low hop CPU overhead during normal repairs. Each relay signs a fast Ed25519 receipt of its outgoing slice. If the final chunk fails verification, the gateway runs a log2(k) binary search over the receipts to isolate the polluting node.
24-Month Plan:
Months 1–6: Integrate (6,4), (14,10), and (10,8) Reed-Solomon coding (klauspost/reedsolomon) + basic pipelined repair into my Go engine.
Months 7–12: Implement congestion-aware pivot routing + Scheme A and Scheme B verification.
Months 13–24: Multi-container cluster benchmarks using Linux Traffic Control (tc netem) to evaluate degraded-read latency and fault isolation under injected corruption.
What I’d love feedback on:
Scope: Does comparing Scheme A vs. Scheme B on top of a working Go prototype sound realistic for a 2-year Master's thesis, or is it too broad?
Clarity: Is the problem statement flowing naturally into the methodology?
Red flags: Anything here that might make a potential professor hesitate when reviewing it?
Happy to share the full text or discuss the technical design in the comments. Thanks in advance for any advice!