Search and replication in unstructured peer-to-peer networks
ICS '02 Proceedings of the 16th international conference on Supercomputing
Random walks in peer-to-peer networks: algorithms and evaluation
Performance Evaluation - P2P computing systems
Performance of random walks in one-hop replication networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Efficient distributed random walks with applications
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Characteristics of Random Walk Search on Embedded Tree Structure for Unstructured P2Ps
ICPADS '10 Proceedings of the 2010 IEEE 16th International Conference on Parallel and Distributed Systems
| Hi-index | 0.00 |
A random walk in a network is a routing mechanism that chooses the next node to visit (uniformly) at random among the neighbors of the current node. Random walks have been extensively studied in Mathematics, and have been used in a wide range of applications such as statistic physics, population dynamics, bioinformatics, etc. When applied to communication networks, random walks have had a profound impact in algorithms and complexity theory. Some of the advantages of random walks are their simplicity, their small processing power consumption at the nodes, and the fact that they need only local information, avoiding the bandwidth overhead necessary in other routing mechanisms to communicate with other nodes.