"DV-Flood": An Optimized Flooding and Clustering Based Approach for Lookup Acceleration in P2P Networks

• Main Authors: Amad, M., Meddahi, A.
• Format: Conference Proceeding
• Language: English
• Subjects: Algorithm design and analysis; Clustering algorithms; Floods; Lead; Peer to peer computing; Routing; Servers
• ISSN: 2376-6492
• DOI: 10.1109/IWCMC.2008.97

Resource retrieval is a key element for P2P networks. In this paper we focus on unstructured peer-to-peer networks and present an approach for resources retrieval called DV-Flood. This approach aims to minimize lookup and get delay. The architecture of our proposed model is organized as a several clusters connected through gateways (leader node). Each cluster is represented by a super node (leader) using an optimized algorithm; all nodes in a given cluster keep a distance lower than a maximum pre-configured parameter D (from the leader node). The leader node is considered as a super node in its cluster. If the request does not get any response in such cluster, the super node relays the request to its neighboring super nodes in other clusters. For this a flooding technique is used, with a range ("TTL") limited to a maximum of V hops (V is also a pre-configured parameter). The proposed solution eliminates the need of replication techniques used in legacy P2P models, providing scalability and practicability, particularly for P2P critical environments such as P2P ad Hoc networks or sensor networks.