Performance Analysis of Restricted Path Flooding Scheme in Distributed P2P Overlay Networks

The Internet can be seen as a cooperative network composed of millions of hosts spread around the world and it is also a distributed shared resource. In the P2P technology, as opposed to the existing client/server concept, devices are actively connected with one another in order to share the resources and every participant is both a server and a client at the same time. 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. Key words: P2P, Peer to Peer, Floodin