Improvement of route algorithm for P2P network based on Gnutella
Yaping Deng
Abstract
Yaping Deng
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.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
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