Optimal Allocation Policies for Mobile Agents

  1. Lookup NU author(s)
  2. Michael Hamilton
  3. Emeritus Professor Isi Mitrani
Author(s)Hamilton MD, Mitrani I
Editor(s)Haverkort, B.R., Bohnenkamp, H.C., Smith, C.U.
Publication type Conference Proceedings (inc. Abstract)
Conference Name11th International Conference on Computer Performance Evaluation: Modelling Techniques and Tools (TOOLS)
Conference LocationSchaumburg, IL, USA
Year of Conference2000
Date27-31 March 2000
Volume1786
Pages145-155
Series TitleLecture Notes in Computer Science
ISBN9783540672609
Full text for this publication is not currently held within this repository. Alternative links are provided below where available.
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.
PublisherSpringer-Verlag
URLhttp://dx.doi.org/10.1007/3-540-46429-8_11
DOI10.1007/3-540-46429-8_11
ActionsLink to this publication
Library holdingsSearch Newcastle University Library for this item