Timed Mobile Agent Planning for Distributed Information Retrieval

摘要

The most significant performance factors in Mobile Agent Planning (MAP) are; (a) the number of mobile agents, (b) the total routing time consumed by the participated agents, and (c) the time constraints, (such as information ready time and deadline triggered unto each nodes to be visited). We propose the Timed Mobile Agent Planning (TMAP), a time constrained mobile agent planning method for finding the minimal number of agents and the best scheduled agents' itineraries for information retrieval from a distributed computing environment processed under the time-constraints while keeping the completion and the total routing time minimal. Experimental results show that this method is required and highly applicable directly to the time-constrained distributed information retrieval environment which has a time window which consists of a "ready-line" (information ready time) and a "deadline" (the end of the information's lifetime).