DocumentCode :
950686
Title :
LightFlood: Minimizing Redundant Messages and Maximizing Scope of Peer-to-Peer Search
Author :
Jiang, Song ; Guo, Lei ; Zhang, Xiaodong ; Wang, Haodong
Author_Institution :
Wayne State Univ., Detroit
Volume :
19
Issue :
5
fYear :
2008
fDate :
5/1/2008 12:00:00 AM
Firstpage :
601
Lastpage :
614
Abstract :
Flooding 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 percent 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 LightFlood, 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. LightFlood identifies the neighbor with the highest connectivity and uses the link to that neighbor to form a suboverlay within the existing P2P overlay. In LightFlood, 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 suboverlay, significantly reducing the number of redundant messages. Our analysis and simulation experiments show that the LightFlood scheme provides a low-overhead broadcast facility that can be effectively used in P2P search. For example, compared with standard flooding with seven TTL hops, we show that LightFlood with an additional two to three hops can reduce up to 69 percent of the flooding messages and retain the same flooding scope. We believe that LightFlood ca- - n be widely used as a core mechanism for efficient message broadcasting in P2P systems due to its near-optimal performance.
Keywords :
message passing; peer-to-peer computing; tree searching; Gnutella network; LightFlood flooding scheme; message broadcasting; peer-to-peer file search operation; redundant query message; time-to-live counter; tree search; unstructured peer-to-peer file sharing system; File Searching; Overlay Network; Peer-to-Peer System; Query Flooding.;
fLanguage :
English
Journal_Title :
Parallel and Distributed Systems, IEEE Transactions on
Publisher :
ieee
ISSN :
1045-9219
Type :
jour
DOI :
10.1109/TPDS.2007.70772
Filename :
4359452
Link To Document :
بازگشت