2010•Journal of Computer ApplicationsRequires access

Improvement of route algorithm for P2P network based on Gnutella

Yaping Deng

Open publisher page 0 citations

Abstract

The huge redundant messages generated by flooding which is the basic routing algorithm of unstructured P2P network,severely reduce the efficiency of the algorithm.Combining the advantages of flooding search algorithm and random walk algorithm,such as short response time,high stability,simple structure,to greatly reduce the redundancy of messages,this paper proposed an improved route search algorithm: JumpRandom-flood.The simulation results show that the algorithm can reduce the redundant messages,increase the efficiency of search,and improve the network environment while maintaining the desired coverage rate of nodes.

About this research paper

What this paper is about

The huge redundant messages generated by flooding which is the basic routing algorithm of unstructured P2P network,severely reduce the efficiency of the algorithm.Combining the advantages of flooding search algorithm and random walk algorithm,such as short response time,high stability,simple structure,to greatly reduce the redundancy of messages,this paper proposed an improved route search algorithm: JumpRandom-flood.The simulation results show that the algorithm can reduce the redundant messages,increase the efficiency of search,and improve the network environment while maintaining the desired coverage rate of nodes.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

The huge redundant messages generated by flooding which is the basic routing algorithm of unstructured P2P network,severely reduce the efficiency of the algorithm.Combining the advantages of flooding search algorithm and random walk algorithm,such as short response time,high stability,simple structure,to greatly reduce the redundancy of messages,this paper proposed an improved route search algorithm: JumpRandom-flood.The simulation results show that the algorithm can reduce the redundant messages,increase the efficiency of search,and improve the network environment while maintaining the desired coverage rate of nodes.

Key concepts: Computer science, Flooding (psychology), Routing algorithm, Redundancy (engineering), Algorithm, Search algorithm, Routing (electronic design automation), Distributed computing

Related papers

Back to paper searchBrowse research topicsOriginal source
Improvement of route algorithm for P2P network based on Gnutella — Research Paper | ScholarLens