Open Access. Powered by Scholars. Published by Universities.®

Physical Sciences and Mathematics Commons

Open Access. Powered by Scholars. Published by Universities.®

Computer Sciences

2000

Mobile-agent

Articles 1 - 3 of 3

Full-Text Articles in Physical Sciences and Mathematics

Performance Analysis Of Mobile Agents For Filtering Data Streams On Wireless Networks, David Kotz, Guofei Jiang, Robert Gray, George Cybenko, Ronald A. Peterson Aug 2000

Performance Analysis Of Mobile Agents For Filtering Data Streams On Wireless Networks, David Kotz, Guofei Jiang, Robert Gray, George Cybenko, Ronald A. Peterson

Dartmouth Scholarship

Wireless networks are an ideal environment for mobile agents, because their mobility allows them to move across an unreliable link to reside on a wired host, next to or closer to the resources they need to use. Furthermore, client-specific data transformations can be moved across the wireless link, and run on a wired gateway server, with the goal of reducing bandwidth demands. In this paper we examine the tradeoffs faced when deciding whether to use mobile agents to support a data-filtering application, in which numerous wireless clients filter information from a large data stream arriving across the wired network. We …


Trading Risk In Mobile-Agent Computational Markets, Jonathan Bredin, David Kotz, Daniela Rus Jul 2000

Trading Risk In Mobile-Agent Computational Markets, Jonathan Bredin, David Kotz, Daniela Rus

Dartmouth Scholarship

Mobile-agent systems allow user programs to autonomously relocate from one host site to another. This autonomy provides a powerful, flexible architecture on which to build distributed applications. The asynchronous, decentralized nature of mobile-agent systems makes them flexible, but also hinders their deployment. We argue that a market-based approach where agents buy computational resources from their hosts solves many problems faced by mobile-agent systems. \par In our earlier work, we propose a policy for allocating general computational priority among agents posed as a competitive game for which we derive a unique computable Nash equilibrium. Here we improve on our earlier approach …


Mobile Agents: Motivations And State-Of-The-Art Systems, Robert S. Gray, George Cybenko, David Kotz, Daniela Rus Jan 2000

Mobile Agents: Motivations And State-Of-The-Art Systems, Robert S. Gray, George Cybenko, David Kotz, Daniela Rus

Dartmouth Scholarship

A mobile agent is an executing program that can migrate, at times of its own choosing, from machine to machine in a heterogeneous network. On each machine, the agent interacts with stationary service agents and other resources to accomplish its task. In this chapter, we first make the case for mobile agents, discussing six strengths of mobile agents and the applications that benefit from these strengths. Although none of these strengths are unique to mobile agents, no competing technique shares all six. In other words, a mobile-agent system provides a single general framework in which a wide range of distributed …