Optimal Allocation Policies for Mobile Agents
- Cite this paper as:
- Hamilton M.D., Mitrani I. (2000) Optimal Allocation Policies for Mobile Agents. In: Haverkort B.R., Bohnenkamp H.C., Smith C.U. (eds) Computer Performance Evaluation.Modelling Techniques and Tools. TOOLS 2000. Lecture Notes in Computer Science, vol 1786. Springer, Berlin, Heidelberg
This paper examines a distributed system where users employ a mobile software agent to perform a sequence of tasks associated with different network nodes. Each operation can be carried out either locally or remotely, and may or may not involve moving the agent from one node to another; in general, all these options have different costs. The problem is to determine the optimal agent allocation policy, for a given cost structure and pattern of user demand. The methodology adopted is that of Markov Decision Processes. Two numerical approaches are presented for the general problem, and a closed-form solution is obtained in a non-trivial special case.
Unable to display preview. Download preview PDF.