Spatial gossip and resource location protocols
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Chord: A scalable peer-to-peer lookup service for internet applications
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Comparison of broadcasting techniques for mobile ad hoc networks
Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
Search and replication in unstructured peer-to-peer networks
ICS '02 Proceedings of the 16th international conference on Supercomputing
Regular Article: The Diameter of Sparse Random Graphs
Advances in Applied Mathematics
A local search mechanism for peer-to-peer networks
Proceedings of the eleventh international conference on Information and knowledge management
Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems
Middleware '01 Proceedings of the IFIP/ACM International Conference on Distributed Systems Platforms Heidelberg
Criticality-based Analysis and Design of Unstructured Peer-to-Peer Networks as "Complex Systems"
CCGRID '03 Proceedings of the 3st International Symposium on Cluster Computing and the Grid
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and
Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and
Adaptive Probabilistic Search for Peer-to-Peer Networks
P2P '03 Proceedings of the 3rd International Conference on Peer-to-Peer Computing
Predictive Models to Rebroadcast in Mobile Ad Hoc Networks
IEEE Transactions on Mobile Computing
Optimal Controlled Flooding Search in a Large Wireless Network
WIOPT '05 Proceedings of the Third International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks
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
Performance Analysis of Communications Networks and Systems
Performance Analysis of Communications Networks and Systems
IEEE/ACM Transactions on Networking (TON)
IEEE/ACM Transactions on Networking (TON) - Special issue on networking and information theory
On the Performance of Flooding-Based Resource Discovery
IEEE Transactions on Parallel and Distributed Systems
Probabilistic heuristics for disseminating information in networks
IEEE/ACM Transactions on Networking (TON)
Random graphs as models of hierarchical peer-to-peer networks
Performance Evaluation
Modeling message propagation in random graph networks
Computer Communications
WONS'09 Proceedings of the Sixth international conference on Wireless On-Demand Network Systems and Services
Analysis of probabilistic flooding: how do we choose the right coin?
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
A survey and comparison of peer-to-peer overlay network schemes
IEEE Communications Surveys & Tutorials
IEEE Transactions on Information Theory
Probabilistic flooding in stochastic networks: Analysis of global information outreach
Computer Networks: The International Journal of Computer and Telecommunications Networking
Performance improvements for network-wide broadcast with instantaneous network information
Journal of Network and Computer Applications
| Hi-index | 0.00 |
Probabilistic flooding has been frequently considered as a suitable dissemination information approach for limiting the large message overhead associated with traditional (full) flooding approaches that are used to disseminate globally information in unstructured peer-to-peer and other networks. A key challenge in using probabilistic flooding is the determination of the forwarding probability so that global network outreach is achieved while keeping the message overhead as low as possible. In this paper, by showing that a probabilistic flooding network, generated by applying probabilistic flooding to a connected random graph network, can be (asymptotically) ''bounded'' by properly parameterized random graph networks and by invoking random graph theory results, asymptotic values of the forwarding probability are derived guaranteeing (probabilistically) successful coverage, while significantly reducing the message overhead with respect to traditional flooding. Asymptotic expressions with respect to the average number of messages and the average time required to complete network coverage are also derived, illustrating the benefits of the properly parameterized probabilistic flooding scheme. Simulation results support the claims and expectations of the analytical results and reveal certain aspects of probabilistic flooding not covered by the analysis.