Mobile-Agent Planning in a Market-Oriented Environment
Jonathan L. Bredin, David F. Kotz, Daniela L. Rus · 1999
We propose a method for increasing incen-tives for sites to host arbitrary mobile agents in which mobile agents purchase their com-puting 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 prior-ities at each site to minimize execution time while preserving a prespecied budget con-straint. We present simulation results of our algorithm to show that our allocation pol-icy and planning algorithm scale well as more agents are added to the system. 1