Abstract
The PC framework has been advanced from a solid PC gadget to a significantly more perplexing customer worker condition in earlier years. One of those recently evolved advancements is Mobile Agent. A Mobile Agent is a creation of program and information that can (move) starting with one PC then migrates onto the next node and proceeds with its execution on the goal PC. As a general rule, the portable operator is the code/object moving which goes in its itinerary inside the system of associated hubs. In this work, the best way in insignificant time is found by relocating the Mobile Agent from the source hub to the goal hub utilizing the numerical procedure and streamlining strategy. This work centers around how to locate the best way to utilize the Ant Colony Optimization calculation (ACO), then figuring out the best path, the path will be compared with those of similar works that used the master-slave design pattern with the Genetic algorithm and Node Compression Algorithm
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: International Journal of Advanced Trends in Computer Science and Engineering
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
