I'm building a mesh network where i need to detect the unexpected disappearance of a peer.Each node attempts to stay in communication with at least X peers. A node refuses connection from another peer if it already has at least Y neighbours. Nodes communicate the IP addresses of their peers on every connection attempt. If a peer disconnects, it will be noted by keep-alives from its neighbours and the disconnection message will make its way around the network.I'm a little worried about the case where there are two large clusters of nodes with a single node in the middle. If the sole 'bridge' node between two clusters disappears, the clusters will retain out-of-date information about peers in the other cluster.Are there values of X and Y i can choose, or replacement strategies for choosing peers to connect to, such that this behaviour is made impossible or very unlikely? i.e. There are always at least two paths between any pair nodes.I expect the network to grow to such a size where walking every edge is infeasible..
Strategies for preventing isolated nodes in a dynamically changing undirected cyclic graph
graph algorithms;network modeling