Structured Gossip: A Partition-Resilient DNS for Internet-Scale Dynamic Networks

Network partitions pose fundamental challenges to distributed name resolution in mobile ad-hoc networks (MANETs) and edge computing. Existing solutions either require active coordination that fails to scale, or use unstructured gossip with excessive overhead. We present $\mathit{\text{Structured}}\mathit{\text{Gossip}}\mathit{\text{DNS}}$, exploiting DHT finger tables to achieve partition resilience through $\mathbf{\text{passive}}\mathbf{\text{stabilization}}$. Our approach reduces message complexity from $O(n)$ to $O(n\mathrm{/}\log n)$ while maintaining $O({\log }^{2}n)$ convergence. Unlike active protocols requiring synchronous agreement, our passive approach guarantees eventual consistency through commutative operations that converge regardless of message ordering. The system handles arbitrary concurrent partitions via version vectors, eliminating global coordination and enabling billion-node deployments.