Conference Paper

Restricted Path Flooding Scheme in Distributed P2P Overlay Networks

Namseoul Univ., Cheonan
DOI: 10.1109/ICISS.2008.43 Conference: Information Science and Security, 2008. ICISS. International Conference on
Source: IEEE Xplore

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.

0 Followers
 · 
82 Views
  • [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.
  • [Show abstract] [Hide abstract]
    ABSTRACT: We proposed the LAN Dynamic Transmit Direction Search Algorithm DTDS algorithm. We expounded the basic thought and the design principle of DTDS algorithm, carried on the theoretical analysis to such as aspects of its accuracy and parameter values. At last we took the simulation experiment, carried on the quantification analysis with the experimental datum to the algorithm, drew up the graph through using experimental datum, and presented the network search process through the image. We make the complex question to be clearer and direct-viewing. The simulation experiment verifies DTDS algorithm greatly improves the search speed while doesn't reduce the network coverage.
  • [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