Message Diffusion in Unstructured Overlay Networks

• Published in: Sixth IEEE International Symposium on Network Computing and Applications (NCA 2007) pp. 126 - 133
• Main Authors: Jianxia Chen, Ramaswamy, L., Meka, A.
• Format: Conference Proceeding
• Language: English
• Published: IEEE 01.07.2007
• Subjects: Aggregates; Application software; Computer applications; Computer networks; Computer science; IP networks; Joining processes; Network topology; Peer to peer computing; Resource management
• ISBN: 0769529224; 9780769529226
• DOI: 10.1109/NCA.2007.32

Many unstructured overlay-based peer-to-peer (P2P) applications require techniques that can effectively send messages to various topological regions of the overlay. While searching in unstructured P2P networks has been widely studied in literature, the problem of diffusing messages to various parts of an arbitrary overlay network has received surprisingly little research attention. In this paper we analyze the message diffusion problem and make two technical contributions towards addressing it. First, we propose a novel message propagation technique called the cluster resilient random walk (CRW). While the CRW technique preserves the overall framework of random walks, at each step of message forwarding, it favors the neighbors that are more likely to send the message deeper into the network. Second, in order to ensure effective message diffusion in networks with small cuts, we introduce a unique message fission technique in which messages are split when they reach peers connecting two or more topological regions of the network. Our experiments show that the proposed technique are very effective in diffusing messages across overlay networks of various topologies.