The Community for Technology Leaders
RSS Icon
Issue No.05 - May (2008 vol.19)
pp: 601-614
<em>Flooding</em> is a fundamental file search operation in unstructured peer-to-peer (P2P) file sharing systems, in which a peer starts the file search procedure by broadcasting a query to its neighbors, who continue to propagate it to their neighbors. This procedure repeats until a time-to-live (TTL) counter is decremented to 0. Flooding can seriously limit system scalability because the number of redundant query messages grows exponentially during the message propagation. Our study shows that more than 70% of the generated messages are redundant in a flooding with a TTL of 7 in a moderately connected Gnutella network. Existing efforts to address this issue have been focused on limiting the use of the flooding operation. We propose a new flooding scheme, called <em>LightFlood</em>, with the objective of minimizing the number of redundant messages and retaining a similar message propagating scope as that of the standard flooding. In the scheme, each peer keeps track of the connectivities of every immediate and next indirect neighbor peers, which can be acquired locally. <em>LightFlood</em> identifies the neighbor with the highest connectivity, and uses the link to that neighbor to form a sub-overlay within the existing P2P overlay. In <em>LightFlood</em>, flooding is divided into two stages. The first stage is a standard flooding with a limited number of TTL hops, where a message can spread to a sufficiently large scope with a small number of redundant messages. In the second stage, message propagating is only conducted along the sub-overlay, significantly reducing the number of redundant messages. Our analysis and simulation experiments show that the <em>LightFlood</em> scheme provides a low-overhead broadcast facility that can be effectively used in P2P search. For example, compared with standard flooding with 7 TTL hops, we show that <em>LightFlood</em> with an additional 2 to 3 hops can reduce up to 69% of the flooding messages, and retain the same flooding scope. We believe that <em>LightFlood</em> can be widely used as a core mechanism for efficient message broadcasting in P2P systems due to its near-optimal performance.
Peer-to-Peer System, File Searching, Overlay Network, Query Flooding.
Song Jiang, Lei Guo, Xiaodong Zhang, Haodong Wang, "LightFlood: Minimizing Redundant Messages and Maximizing Scope of Peer-to-Peer Search", IEEE Transactions on Parallel & Distributed Systems, vol.19, no. 5, pp. 601-614, May 2008, doi:10.1109/TPDS.2007.70772
[1] http:/, 2007.
[2] http:/, 2007.
[3] Clip2 Distributed Search Solutions, http:/, 2007.
[4] L. Guo, S. Jiang, L. Xiao, and X. Zhang, “Exploiting Content Localities for Efficient Search in P2P Systems,” Proc. 18th Ann. Conf. Distributed Computing (DISC '04), Oct. 2004.
[5] L. Guo, S. Jiang, L. Xiao, and X. Zhang, “Fast and Low Cost Search Schemes by Exploiting Localities in P2P Networks,” J. Parallel and Distributed Computing, vol. 65, no. 6, pp. 729-742, 2005.
[6] S. Jiang, L. Guo, and X. Zhang, “LightFlood: An Efficient Flooding Scheme for File Search in Unstructured Peer-to-Peer Systems,” Proc. 32nd Int'l Conf. Parallel Processing (ICPP '03), Oct. 2003.
[7] Q. Lv, P. Cao, E. Cohen, K. Li, and S. Shenker, “Search and Replication in Unstructured Peer-to-Peer Networks,” Proc. 16th Ann. ACM Int'l Conf. Supercomputing (ICS '02), June 2002.
[8] Q. Lv, S. Ratnasamy, and S. Shenker, “Can Heterogeneity Make Gnutella Scalable?” Proc. First Int'l Workshop Peer-to-Peer Systems (IPTPS '02), Mar. 2002.
[9] M.E.J. Newman, S.H. Strogatz, and D.J. Watts, “Random Graphs with Arbitrary Degree Distributions and Their Applications,” Physical Rev. E, vol. 64, p. 26118, 2001.
[10] M.K. Ramanathan, V. Kalogeraki, and J. Pruyne, “Finding Good Peers in Peer-to-Peer Networks,” Proc. 16th Int'l Parallel and Distributed Processing Symp. (IPDPS '02), Apr. 2002.
[11] M. Ripeanu and I. Foster, “Mapping Gnutella Network,” Proc. First Int'l Workshop Peer-to-Peer Systems (IPTPS '02), Mar. 2002.
[12] J. Ritter, Why Gnutella Can't Scale. No, Really, , Feb. 2001.
[13] S. Saroiu, P. Gummadi, and S. Gribble, “A Measurement Study of Peer-to-Peer File Sharing Systems,” Proc. SPIE/ACM Conf. Multimedia Computing and Networking (MMCN '02), Jan. 2002.
[14] K. Scipanidkulchai, B. Maggs, and H. Zhang, “Efficient Content Location Using Interest-Based Locality in Peer-to-Peer Systems,” Proc. IEEE INFOCOM '03, Mar. 2003.
[15] B. Yang and H. Garcia-Molina, “Designing a Super-Peer Network,” Proc. 19th IEEE Int'l Conf. Data Eng. (ICDE '03), Mar. 2003.
[16] B. Yang and H. Garcia-Molina, “Improving Search in Peer-to-Peer Systems,” Proc. 22nd IEEE Intl' Conf. Distributed Computing Systems (ICDCS '02), July 2002.
31 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool