Search and replication in unstructured peer-to-peer networks
ICS '02 Proceedings of the 16th international conference on Supercomputing
Replication strategies in unstructured peer-to-peer networks
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
Improving Search in Peer-to-Peer Networks
ICDCS '02 Proceedings of the 22 nd International Conference on Distributed Computing Systems (ICDCS'02)
Semantic Small World: An Overlay Network for Peer-to-Peer Search
ICNP '04 Proceedings of the 12th IEEE International Conference on Network Protocols
Preferential walk: towards efficient and scalable search in unstructured peer-to-peer networks
WWW '05 Special interest tracks and posters of the 14th international conference on World Wide Web
Analysis of search and replication in unstructured peer-to-peer networks
SIGMETRICS '05 Proceedings of the 2005 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Modeling and Analysis of Random Walk Search Algorithms in P2P Networks
HOT-P2P '05 Proceedings of the Second International Workshop on Hot Topics in Peer-to-Peer Systems
Random walks in peer-to-peer networks: algorithms and evaluation
Performance Evaluation - P2P computing systems
Analysis Models for Blind Search in Unstructured Overlays
NCA '06 Proceedings of the Fifth IEEE International Symposium on Network Computing and Applications
Optimizing random walk search algorithms in P2P networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Survey of research towards robust peer-to-peer networks: search methods
Computer Networks: The International Journal of Computer and Telecommunications Networking
On constructing internet-scale p2p information retrieval systems
DBISP2P'04 Proceedings of the Second international conference on Databases, Information Systems, and Peer-to-Peer Computing
Improving search in unstructured P2P systems: intelligent walks (I-walks)
IDEAL'06 Proceedings of the 7th international conference on Intelligent Data Engineering and Automated Learning
A survey and comparison of peer-to-peer overlay network schemes
IEEE Communications Surveys & Tutorials
Probabilistic flooding for efficient information dissemination in random graph topologies
Computer Networks: The International Journal of Computer and Telecommunications Networking
| Hi-index | 0.24 |
Message propagation is used in a wide range of applications, such as search in unstructured P2P overlays, modeling infection spread in epidemiology, and modeling the spread of gossip in social networks. For example, in a P2P network that has an unstructured overlay, search for a piece of information is conducted by propagating the query message within the network, usually with the desire that as many nodes as possible are covered with as few message forwardings as possible. In this paper, we study the behavior of the message propagation process in random graph networks and give a simple model to describe this process. When applied to a large network with random graph topology, the message propagation process can usually be modeled as a random pick process or the coupon collection problem. We show that these models are less accurate when the number of covered nodes becomes large. We investigate the inaccuracy and then propose refined models which remedy the factors that cause the error. The refined models have been confirmed by our simulations to effectively compensate for the errors, especially under high coverage conditions. Thus, when a large number of messages is expected to be used in the message propagation process, the refined models of higher orders are essential.