Restricted Path Flooding Scheme in Distributed P2P Overlay Networks
ABSTRACT In P2P overlay network, peers are able to directly share and exchange information without the help of a server. This results in a prompt and secure sharing of network resources and data handling. However, flooding algorithm that is used in distributed P2P network generated query message excessively. Our objective in this paper is to proposes a presents a restricted path flooding algorithm that can decrease query message's occurrence to solve P2P network's problems. It includes concepts as well as systematic procedures of the proposed scheme for fast path flooding in distributed P2P overlay networks.
- [Show abstract] [Hide abstract]
ABSTRACT: Based on the concept of the flooding algorithm and its improved algorithm the search algorithm in P2P networks is proposed based on the direction. This algorithm dynamically generates a search tree taken the source point to be its root which makes the search processing along the search tree. By this algorithm the production of redundant search packets can be effectively avoided in the search process, the network bandwidth can be saved and the efficiency and network performance can be improved. The analysis on experimental results of two dimensional digital data and image data fully reflects the effectiveness and feasibility of this algorithm in the search process, document.01/2011;
Conference Paper: Research on Direction Search Algorithm Based on LAN Agent in P2P Network[Show abstract] [Hide abstract]
ABSTRACT: In view of the problem of slow search speed conduced by failure topology and limited retransmission nodes quantity in MDBS search algorithm; we proposed the LAN agent-based direction search algorithm-ABDS algorithm. We expounded the basic thought and design principle of ABDS algorithm and carried on the theoretical analysis to such as aspects of its accuracy and parameter values. The analysis results show that ABDS algorithm greatly improves the search speed while doesn't reduce the network coverage.Wireless Communications, Networking and Mobile Computing, 2009. WiCom '09. 5th International Conference on; 10/2009
- [Show abstract] [Hide abstract]
ABSTRACT: Efficient searching for information is an important goal in peer-to-peer (P2P) networks. Searching in an unstructured P2P network is particularly challenging due to the random nature of the P2P overlay links. In this paper, we propose a novel probabilistic search mechanism called SPUN, that increases the success ratio of queries while keeping the bandwidth consumption considerably low. SPUN is an informed search mechanism that improves upon state-of-art probabilistic mechanism, namely, the Adaptive Probabilistic Search (APS). The core principle of our algorithm is to exploit the successful query paths that develop during the lifetime of P2P network and converge toward the target objects. Our work introduces a new neighbor selection criterion which allows a peer to evaluate its neighbors based on the strength of successful paths the neighbor leads to. We also introduce a peer profile exchange mechanism that supports the reduction in uncertainty in peer selection decision. Our extensive simulation results confirm that our path-based algorithm performs 25% better than APS and several of its variants and is capable of achieving higher success ratios with fewer walkers each with an average message size of 71 bytes.25th IEEE International Symposium on Parallel and Distributed Processing, IPDPS 2011, Anchorage, Alaska, USA, 16-20 May 2011 - Workshop Proceedings; 01/2011