Mobile-Agent Planning in a Market-Oriented Environment
暂无分享,去创建一个
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.
[1] W. Hamilton,et al. The evolution of cooperation. , 1984, Science.
[2] Moshe Tennenholtz,et al. Adaptive Load Balancing: A Study in Multi-Agent Learning , 1994, J. Artif. Intell. Res..
[3] Andrew Whinston,et al. A Stochastic Equilibrium Model of Internet Pricing , 1997 .
[4] Christian F. Tschudin,et al. Open Resource Allocation for Mobile Code , 1997, Mobile Agents.
[5] Jonathan T. Moore,et al. Mobile Code Security Techniques , 1998 .