Shortcoming, problems and analytical comparison for flooding-based search techniques in unstructured P2P networks

Abstract

Peer-to-Peer networks attracted a significant amount of interest because of their capacity for resource sharing and content distribution. Content distribution applications allow personal computers to function in a coordinated manner as a distributed storage medium by contributing, searching, and obtaining digital content. Searching in unstructured P2P networks is an important problem, which has received considerable research attention. Acceptable searching techniques must provide large coverage rate, low traffic load, and optimum latency. This paper reviews flooding-based search techniques in unstructured P2P networks. It then analytically compares their coverage rate, and traffic overloads. Our simulation experiments have validated analytical results.

An Overview of Query-Broadcasting Techniques in Ad Hoc Networks

“…Consequences of packet diffusion can be analyzed in AODV [1], Least Clusterhead Change (LCC), and ZRP [12] that are overcome in [10,13] respectively. Similar broadcasting techniques were also proposed to reduce cost of packet diffusion [3]. The next section describes these approaches in detail.…”

“…The drawback of BERS+ is that its broadcast termination is source initiated causing additional latency in the processing of control packets. However, BCIR, BCIR*, tBERS, and tBERS* apply destination-initiated broadcast termination approach offering higher retransmission efficiency over BERS, BERS*, and BERS+ [3,6,11,14]. Large enough area of the network to find the route; usually depends on the routing history and location as well, e.g., QLT, LAR, and DREAM Small enough area of the network which depends on the predefined timeto-live (TTL) count…”

“…Each node in the network acts as a router with limited transmission range and is unable to directly communicate with nodes out of its transmission range. To communicate route discovery, using broadcasting query packet is employed, which can lead to flooding and broadcast storm [2,3] and hence network congestion. This congestion takes toll on the energy consumption and average latency, thereby degrading the performance of the network.…”

Resource discovery for distributed computing systems: A comprehensive survey

“…ALG-Flooding [208][209][210], Breadth First Search (BFS) [211][212][213] and Depth First Search (DFS) [214][215][216] are the most wellknown systematic search methods. Moreover, there are several other systematic and random search methods such as Depth Limited Search [217], Iterative Deepening [218], Uniform Cost Search [219], Random Walk [220][221][222] and Gossip based search methods (e.g., Newcast Gossiping [223], works in [224,225]).…”

State-of-the-art survey on P2P overlay networks in pervasive computing environments

“…However, performance of lookup operations is not as efficient as in structured solutions because it is mainly based on flooding. Since such an approach clearly does not scale, optimized solutions for resource discovery in unstructured overlays have been proposed (Barjini et al, 2012). In what follows we discuss widely deployed unstructured P2P overlays with the goal of describing their topologies, lookup operations and their performance.…”