Optimal Allocation Policies for Mobile Agents

  • M. D. Hamilton
  • I. Mitrani
Conference paper

DOI: 10.1007/3-540-46429-8_11

Part of the Lecture Notes in Computer Science book series (LNCS, volume 1786)
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

Abstract

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2000

Authors and Affiliations

  • M. D. Hamilton
    • 1
  • I. Mitrani
    • 1
  1. 1.Department of Computing ScienceUniversity of Newcastle upon TyneUK

Personalised recommendations