Mobile-Agent Planning in a Market-Oriented Environment

Dartmouth Technical Report PCS-TR99-345

	Jonathan Bredin
	David Kotz
	Daniela Rus

Date: May 1999

URL (compressed postscript): <http://www.cs.dartmouth.edu/reports/TR99-345.ps.Z> (304KB)

URL (PDF): <http://www.cs.dartmouth.edu/reports/TR99-345.pdf> (436KB)

Abstract:
 We propose a method for increasing incentives for sites to host
 arbitrary mobile agents in which mobile agents purchase their computing
 needs from host sites.  We present a scalable market-based CPU allocation
 policy and an on-line algorithm that plans a mobile agent's expenditure
 over a multihop ordered itinerary.  The algorithm chooses a set of sites
 at which to execute and computational priorities at each site to minimize
 execution time while preserving a prespecified budget constraint.  We
 present simulation results of our algorithm to show that our allocation
 policy and planning algorithm scale well as more agents are added to the
 system.

Note:
 See
 <a href="http://agent.cs.dartmouth.edu/papers/#market">related papers.</a>