Migration planning using modified Cuckoo Search Algorithm

Mobile agent is a distributed computing technology which allows the agents to carry their jobs on behalf of users from current processing server to the others. Hence, the migration planning is a significant issue for improving performance of mobile agent. In this paper, we propose an improving method for finding path of mobile agent migration planning based on Cuckoo Search Algorithm. Our proposed method modified the original Cuckoo Search Algorithm in two ways. That is, for the first one: in finding new nest, we propose random replacement instead of Lévy fight algorithm. Then, for the second one: in destroying egg, we propose a context sensitive parameter instead of a constant parameter. The experimental results, comparing with migration using the former proposed method, original Cuckoo Search Algorithm and Ant Colony System, confirm that the proposed migration algorithm improves the path finding within the limited time scale.