The Community for Technology Leaders
Green Image
ABSTRACT
Network structure construction and global state maintenance are expensive in large-scale, dynamic peer-to-peer (p2p) networks. With inherent topology independence and low state maintenance overhead, random walks have been widely used in such network environments. However, the current uses are limited to unguided or heuristic random walks with no guarantee on their converged node visitation probability distribution. Such a convergence guarantee is essential for strong analytical properties and high performance of many p2p applications. In this paper, we investigate an approach for random walks to converge to application-desired node visitation probability distributions while only requiring information about direct neighbors of each peer. Our approach is guided by the Metropolis-Hastings algorithm that is typically used in Monte Carlo Markov Chain sampling. We examine the effectiveness and practical issues of our approach using three application studies: random membership subset management, search, and load balancing. Both search and load balancing desire random walks with biased node visitation distributions to achieve application-specific analytical features. Our theoretical analysis, simulations, and Internet experiments demonstrate the advantage of our random walks compared with alternative topology-independent index-free approaches.
INDEX TERMS
Distributed networks, Distributed applications, Distributed systems
CITATION
Ming Zhong, Joel Seiferas, Kai Shen, "The Convergence-Guaranteed Random Walk and Its Applications in Peer-to-Peer Networks", IEEE Transactions on Computers, vol. 57, no. , pp. 619-633, May 2008, doi:10.1109/TC.2007.70837
114 ms
(Ver 3.1 (10032016))