Figure 2 - uploaded by Kholoud Althobaiti
Content may be subject to copyright.
Similar publications
Citations
... In the proposed routing search algorithm, they avoided the randomization and blindness of message relay service by adding a constrained condition. Few of the research [16] compared the strength and weaknesses of three algorithms of Gnutella P2P protocol namely Flood, Random Walk, and Random Walk with Neighbors and they proposed a new search method based on the experiment. A new hierarchical architecture in [17] is proposed for Gnutella network by categorizing the nodes as client-nodes and super-nodes which was able to make the network scale, by reducing the number of nodes on the network involved in message handling and routing as well as reducing the actual traffic among them. ...
