Data networks
Approximation algorithms for NP-hard problems
Approximation algorithms for NP-hard problems
The small-world phenomenon: an algorithmic perspective
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Proceedings of the 9th international World Wide Web conference on Computer networks : the international journal of computer and telecommunications netowrking
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
The Cost of Peer Discovery and Searching in the Gnutella Peer-to-peer File Sharing Protocol
ICON '01 Proceedings of the 9th IEEE International Conference on Networks
Making gnutella-like P2P systems scalable
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
The case for a hybrid p2p search infrastructure
IPTPS'04 Proceedings of the Third international conference on Peer-to-Peer Systems
| Hi-index | 0.00 |
Peer-to-peer overlay networks present new opportunities and challenges for achieving enhanced network functionality at the application level. In this paper we study the impact of point-to-point network latency on flooding broadcast operations in peer-to-peer overlay networks. We show that two standard protocol mechanisms, used to control the amount of network resources used during flooding, can in combination, significantly reduce the reach of broadcast messages. We prove that these standard mechanisms, known as "time-to-live bounds" and "unique message identification", can result in broadcast operations that only reach a vanishing fraction of the nodes. In addition, we provide empirical evidence that the trend suggested by our formal results are found in data obtained from the Gnutefla network and through network simulations.