Proactive Uniform Data Replication by Density Estimation in Apollonian P2P Networks
Globe '09 Proceedings of the 2nd International Conference on Data Management in Grid and Peer-to-Peer Systems
A path-traceable query routing mechanism for search in unstructured peer-to-peer networks
Journal of Network and Computer Applications
SCDN: Stable Content Distribution Network based on demands
Journal of Parallel and Distributed Computing
Expansion and search in networks
CIKM '10 Proceedings of the 19th ACM international conference on Information and knowledge management
The weight-constrained maximum-density subtree problem and related problems in trees
The Journal of Supercomputing
An efficient hybridflood searching algorithm for unstructured peer-to-peer networks
ICICA'10 Proceedings of the First international conference on Information computing and applications
A scalable multi-attribute range query approach on cluster-based hybrid overlays
MTPP'10 Proceedings of the Second Russia-Taiwan conference on Methods and tools of parallel programming multicomputers
Computer Networks: The International Journal of Computer and Telecommunications Networking
Inexpensive high availability solutions for the SIP-based VoIP service
Multimedia Tools and Applications
On the design of semi-structured multi-star hybrid-overlays for multi-attribute range queries
GPC'10 Proceedings of the 5th international conference on Advances in Grid and Pervasive Computing
GPM: A generic and scalable P2P model that optimizes tree depth for multicast communications
International Journal of Communication Systems
Enhancing Routing Robustness of Unstructured Peer-to-Peer Networks Using Mobile Agents
Journal of Network and Systems Management
Analytical studies and experimental examines for flooding-based search algorithms
ICICA'12 Proceedings of the Third international conference on Information Computing and Applications
Gossiping for resource discovering: An analysis based on complex network theory
Future Generation Computer Systems
| Hi-index | 0.01 |
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% 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 sub-overlay 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 sub-overlay, 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 7 TTL hops, we show that LightFlood 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 LightFlood can be widely used as a core mechanism for efficient message broadcasting in P2P systems due to its near-optimal performance.