This paper proposes a churn-resistant strategy designed on top of a highly reliable P2P overlay network , with degree
is the degree of a De Bruijn digraph . We show that when each node in the network periodically retransmits only one KEEPALIVE message to one of its neighbors in the network, any node’s failure can be detected within an optimal timeout. As a major contribution, we demonstrate that even in failure situations the lookup of any available resource is achieved with the lowest possible maintenance overhead
(1) along the shortest path of length
) – 1 with
being the maximal number of nodes in the network.