Random walks in peer-to-peer networks: algorithms and evaluation

Authors:
Christos Gkantsidis;Milena Mihail;Amin Saberi
Affiliations:
Georgia Institute of Technology, College of Computing, Atlanta, GA;Georgia Institute of Technology, College of Computing, Atlanta, GA;Georgia Institute of Technology, College of Computing, Atlanta, GA
Venue:
Performance Evaluation - P2P computing systems
Year:
2006

Citing 21
Cited 39

Deterministic simulation in LOGSPACE

STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
The algebraic eigenvalue problem

The algebraic eigenvalue problem
Algorithms for random generation and counting: a Markov chain approach

Algorithms for random generation and counting: a Markov chain approach
Randomized algorithms

Randomized algorithms
Inferring Web communities from link topology

Proceedings of the ninth ACM conference on Hypertext and hypermedia : links, objects, time and space---structure in hypermedia systems: links, objects, time and space---structure in hypermedia systems
A Chernoff Bound for Random Walks on Expander Graphs

SIAM Journal on Computing
Trawling the Web for emerging cyber-communities

WWW '99 Proceedings of the eighth international conference on World Wide Web
On power-law relationships of the Internet topology

Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Graph structure in the Web

Proceedings of the 9th international World Wide Web conference on Computer networks : the international journal of computer and telecommunications netowrking
Search and replication in unstructured peer-to-peer networks

ICS '02 Proceedings of the 16th international conference on Supercomputing
Peer-to-Peer: Harnessing the Power of Disruptive Technologies

Peer-to-Peer: Harnessing the Power of Disruptive Technologies
Self-similarity in the Web

Proceedings of the 27th International Conference on Very Large Data Bases
Conductance and congestion in power law graphs

SIGMETRICS '03 Proceedings of the 2003 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Deconstructing the Kazaa Network

WIAPP '03 Proceedings of the The Third IEEE Workshop on Internet Applications
Making gnutella-like P2P systems scalable

Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
Building Low-Diameter P2P Networks

FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
Peer-to-peer research at Stanford

ACM SIGMOD Record
Gossip-Based Computation of Aggregate Information

FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
On Certain Connectivity Properties of the Internet Topology

FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
A decentralized algorithm for spectral analysis

STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Fastest Mixing Markov Chain on a Graph

SIAM Review

On unbiased sampling for unstructured peer-to-peer networks

Proceedings of the 6th ACM SIGCOMM conference on Internet measurement
Randomized Protocols for Duplicate Elimination in Peer-to-Peer Storage Systems

IEEE Transactions on Parallel and Distributed Systems
Near-optimal dynamic replication in unstructured peer-to-peer networks

Proceedings of the twenty-seventh ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Analysis models for unguided search in unstructured P2P networks

International Journal of Ad Hoc and Ubiquitous Computing
GMAC: An overlay multicast network for mobile agent platforms

Journal of Parallel and Distributed Computing
Distinct value estimation on peer-to-peer networks

Proceedings of the 1st international conference on PErvasive Technologies Related to Assistive Environments
A Knowledge Plane for Autonomic Context-Aware Wireless Mobile Ad Hoc Networks

MMNS '08 Proceedings of the 11th IFIP/IEEE international conference on Management of Multimedia and Mobile Networks and Services: Management of Converged Multimedia Networks and Services
Modeling message propagation in random graph networks

Computer Communications
Efficient sampling of information in social networks

Proceedings of the 2008 ACM workshop on Search in social media
Random walk with long jumps for wireless ad hoc networks

Ad Hoc Networks
GRaSP: generalized range search in peer-to-peer networks

Proceedings of the 3rd international conference on Scalable information systems
Efficiency of Search Methods in Dynamic Wireless Networks

Wireless Systems and Mobility in Next Generation Internet
PUB-2-SUB: A Content-Based Publish/Subscribe Framework for Cooperative P2P Networks

NETWORKING '09 Proceedings of the 8th International IFIP-TC 6 Networking Conference
Tight Bounds for the Cover Time of Multiple Random Walks

ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Challenges for Routing and Search in Dynamic and Self-organizing Networks

ADHOC-NOW '09 Proceedings of the 8th International Conference on Ad-Hoc, Mobile and Wireless Networks
Modeling RPS and evaluating video repair with VQM

IEEE Transactions on Multimedia
Distributed online aggregations

Proceedings of the VLDB Endowment
Study of randomly replicated random walks for information dissemination over various network topologies

WONS'09 Proceedings of the Sixth international conference on Wireless On-Demand Network Systems and Services
Research on direction search algorithm based on LAN agent in P2P network

WiCOM'09 Proceedings of the 5th International Conference on Wireless communications, networking and mobile computing
DTDS: LAN agent-based dynamic transmit direction search algorithm in P2P network

WiCOM'09 Proceedings of the 5th International Conference on Wireless communications, networking and mobile computing
Modeling random walk search algorithms in unstructured P2P networks with social information

ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Time-based sampling of social network activity graphs

Proceedings of the Eighth Workshop on Mining and Learning with Graphs
Enabling content-based publish/subscribe services in cooperative P2P networks

Computer Networks: The International Journal of Computer and Telecommunications Networking
Dynamic TTL-Based Search in Unstructured Peer-to-Peer Networks

CCGRID '10 Proceedings of the 2010 10th IEEE/ACM International Conference on Cluster, Cloud and Grid Computing
Estimating and sampling graphs with multidimensional random walks

IMC '10 Proceedings of the 10th ACM SIGCOMM conference on Internet measurement
Fuzzy-based load self-configuration in mobile P2P services

Computer Networks: The International Journal of Computer and Telecommunications Networking
Xheal: localized self-healing using expanders

Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Walking on a graph with a magnifying glass: stratified sampling via weighted random walks

ACM SIGMETRICS Performance Evaluation Review - Performance evaluation review
Random walks, interacting particles, dynamic networks: randomness can be helpful

SIROCCO'11 Proceedings of the 18th international conference on Structural information and communication complexity
Analysis of latency of stateless opportunistic forwarding in intermittently connected networks

IEEE/ACM Transactions on Networking (TON)
An adaptive distribution model for multi-dimensional data in decentralized environments

WISM'11 Proceedings of the 2011 international conference on Web information systems and mining - Volume Part I
Evaluation of models for analyzing unguided search in unstructured networks

EUC'06 Proceedings of the 2006 international conference on Emerging Directions in Embedded and Ubiquitous Computing
Decentralized resources management for grid

OTM'06 Proceedings of the 2006 international conference on On the Move to Meaningful Internet Systems: AWeSOMe, CAMS, COMINF, IS, KSinBIT, MIOS-CIAO, MONET - Volume Part II
A model of self-avoiding random walks for searching complex networks

Networks
Scalable service discovery in ubiquitous and pervasive computing architectures: A percolation-driven approach

Future Generation Computer Systems
Resource location based on partial random walks in networks with resource dynamics

Proceedings of the 4th International Workshop on Theoretical Aspects of Dynamic Distributed Systems
SMBSRP: a search mechanism based on interest similarity, query relevance and distance prediction

IWANN'13 Proceedings of the 12th international conference on Artificial Neural Networks: advances in computational intelligence - Volume Part I
Enhancing decentralized service discovery in open service-oriented multi-agent systems

Autonomous Agents and Multi-Agent Systems
Modeling and optimizing Random Walk content discovery protocol over mobile ad-hoc networks

Performance Evaluation

Quantified Score

Hi-index	0.00

Visualization

Abstract

We quantify the effectiveness of random walks for searching and construction of unstructured peer-to-peer (P2P) networks. We have identified two cases where the use of random walks for searching achieves better results than flooding: (a) when the overlay topology is clustered, and (b) when a client re-issues the same query while its horizon does not change much. Related to the simulation of random walks is also the distributed computation of aggregates, such as averaging. For construction, we argue that an expander can be maintained dynamically with constant operations per addition. The key technical ingredient of our approach is a deep result of stochastic processes indicating that samples taken from consecutive steps of a random walk on an expander graph can achieve statistical properties similar to independent sampling. This property has been previously used in complexity theory for construction of pseudorandom number generators. We reveal another facet of this theory and translate savings in random bits to savings in processing overhead.