LightFlood: Minimizing Redundant Messages and Maximizing the Scope of Peer-to-Peer Search
Cached
Download Links
| Citations: | 4 - 0 self |
BibTeX
@MISC{Jiang_lightflood:minimizing,
author = {Song Jiang and Lei Guo and Xiaodong Zhang and Senior Member and Haodong Wang},
title = {LightFlood: Minimizing Redundant Messages and Maximizing the Scope of Peer-to-Peer Search},
year = {}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
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
Keyphrases
minimizing redundant message peer-to-peer search redundant message ttl hop standard flooding p2p overlay new flooding scheme simulation experiment flooding operation file search procedure message propagation gnutella network fundamental file search operation p2p search lightflood scheme redundant query message next indirect neighbor peer abstract flooding similar message-propagating scope unstructured peer-to-peer small number generated message message propagating second stage system scalability first stage low-overhead broadcast facility large scope limited number
