Random Walks on Regular and Irregular Graphs
SIAM Journal on Discrete Mathematics
Search and replication in unstructured peer-to-peer networks
ICS '02 Proceedings of the 16th international conference on Supercomputing
Chord: a scalable peer-to-peer lookup protocol for internet applications
IEEE/ACM Transactions on Networking (TON)
Deterministic approximation of the cover time
Random Structures & Algorithms
The impact and implications of the growth in residential user-to-user traffic
Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications
Bubblestorm: resilient, probabilistic, and exhaustive peer-to-peer search
Proceedings of the 2007 conference on Applications, technologies, architectures, and protocols for computer communications
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
Review: A survey on content-centric technologies for the current Internet: CDN and P2P solutions
Computer Communications
| Hi-index | 0.00 |
Dynamic overlay networks on the Internet as well as ad hoc networks often rely on self-organizing distributed communication and construction techniques. When there are no central management facilities and search indices available, flooding is a standard method to collect knowledge about the network structure and the content on the nodes. In recent time, random walks have attracted attention as an alternative search method in P2P networks. The efficiency of the method is usually evaluated by simulation studies. In this paper we use transient analysis as a simple and scalable approach to examine the properties of random walks. The convergence to steady state and the coverage of the network in the course of the random work are main characteristics to be analyzed. In our evaluations we consider network examples of different type and size.