Resource Discovery in Non-Structured Peer to Peer Grid Systems Using the Shuffled Frog Leaping Algorithm

Abstract

In Peer to Peer (P2P) grid systems, users can utilize the resources of other machines for their tasks without involving themselves in the detailed aspects of addressing. One of the greatest challenges for these systems is finding the resource that matches the user’s request to minimize query traffic in the network. Thus, inspired by the Shuffled Frog Leaping Algorithm (SFLA), this article presents a new method for resource discovery in grid systems. This algorithm finds the resource that matches the user’s request via sending requests to the most suitable neighbors, thus preventing the flooding of requests and reducing traffic. The evaluation and comparison of the proposed method with the Genetic Algorithm (GA) and Differential Evolution Algorithm (DEA) indicate that it yields higher performance considering the speed and number of sent queries in the network.