Fast gossip-based overlay construction by adaptive membership exchange

Traditional gossip communications does not consider the difference between nodes in the overlay, and fix the number of node descriptors exchanged during an interaction. It severely reduces the effectiveness of the overlay construction. It takes nodes more time to reach stable state, and when a node achieves stable state, useless node descriptors exchanging incurs extra network bandwidth wasting. This paper proposes a novel adaptive method for membership information exchanging, which promotes the convergence speed of the overlay obviously and decreases extra bandwidth cost during maintaining neighbor views period.