Employing Data Driven Random Membership Subset Algorithm for QoS-Aware Peer-to-Peer Streaming
FMN '09 Proceedings of the 2nd International Workshop on Future Multimedia Networking
Uniform Sampling for Directed P2P Networks
Euro-Par '09 Proceedings of the 15th International Euro-Par Conference on Parallel Processing
Fundamenta Informaticae - Methodologies for Intelligent Systems
Energy efficient and low latency biased walk techniques for search in wireless sensor networks
Journal of Parallel and Distributed Computing
Computer Networks: The International Journal of Computer and Telecommunications Networking
GPM: A generic and scalable P2P model that optimizes tree depth for multicast communications
International Journal of Communication Systems
| Hi-index | 14.98 |
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.