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
 · 
85 Views
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: In this paper, the search algorithm based on the direction - DBS algorithm is proposed. Through the methods designated the search direction, the shortcoming of the massive redundant search message are solved, when searching by flooding and its improved algorithm in unstructured P2P network. The problem that the search speed of flooding and its improved algorithm is slow is solved through dividing the search region and improving search parallelism. Finally, the simulation of the DBS algorithm and its improved algorithm by program is realized. The algorithm was analyzed through the experimental results. The experimental data show that the DBS algorithm is correct and viable, and greatly improves the search performance in unstructured P2P network.
    Wireless Communications, Networking and Mobile Computing, 2008. WiCOM '08. 4th International Conference on; 11/2008
  • [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