Title :
On message reachability of gossip algorithms in degree-biased peer-to-peer networks
Author :
Yamamasu, Daisuke ; Hayashibara, Naohiro
Author_Institution :
Grad. Sch. of Frontier Inf., Kyoto Sangyo Univ., Kyoto, Japan
Abstract :
In peer-to-peer networks, each node directly connects to other nodes without access points. This type of network system is useful for information sharing by using mobile devices (e.g., smart phones). On message delivery over the network, it is very difficult to assume the static routing if each node is assumed to move. In this paper, we suppose to use gossip-style epidemic message dissemination and show the performance evaluation of several gossip algorithms in terms of network topology. Specifically, we focus on the distribution of links in the network. Our results clarified the characteristics of those algorithms on the topologies that are biased the degree distribution locally.
Keywords :
peer-to-peer computing; degree distribution; degree-biased peer-to-peer network; gossip algorithm; gossip-style epidemic message dissemination; information sharing; message reachability; mobile devices; network topology; Algorithm design and analysis; Mathematical model; Network topology; Peer-to-peer computing; Routing; Standards; Topology;
Conference_Titel :
Parallel and Distributed Systems (ICPADS), 2014 20th IEEE International Conference on
DOI :
10.1109/PADSW.2014.7097888