Journal
THEORETICAL COMPUTER SCIENCE
Volume 355, Issue 1, Pages 25-36Publisher
ELSEVIER
DOI: 10.1016/j.tcs.2005.12.013
Keywords
peer-to-peer overlay networks; network broadcasting and flooding; distributed network algorithms; network reliability and reachability; network simulation
Categories
Ask authors/readers for more resources
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 Gnutella network and through network simulations. (c) 2006 Elsevier B.V. All rights reserved.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available