Mobile agents: Are they a good idea?

Chess, David M.; Harrison, Colin; Kershenbaum, Aaron

doi:10.1007/3-540-62852-5_4

Cited by 347 publications

(135 citation statements)

References 6 publications

Supporting

Mentioning

123

Contrasting

Unclassified

Order By: Relevance

“…Within the wider mobile-agent community, there is a good deal of concern for the security of mobile agents and agent based systems, as discussed in [14,16] and [17]. This section covers some of these issues.…”

Section: Securitymentioning

confidence: 99%

Communicating Mobile Processes

Welch

Barnes

2005

Communicating Sequential Processes. The First 25 Years

View full text Add to dashboard Cite

Abstract. This paper presents a new model for mobile processes in occam-π. A process, embedded anywhere in a dynamically evolving network, may suspend itself mid-execution, be safely disconnected from its local environment, moved (by communication along a channel), reconnected to a new environment and reactivated. Upon reactivation, the process resumes execution from the same state (i.e. data values and code positions) it held when it suspended. Its view of its environment is unchanged, since that is abstracted by its synchronisation (e.g. channels and barriers) interface and that remains constant. The environment behind that interface will (usually) be completely different. The mobile process itself may contain any number of levels of dynamic sub-network. This model is simpler and, in some ways, more powerful than our earlier proposal, which required a process to terminate before it could be moved. Its formal semantics and implementation, however, throw up extra challenges. We present details and performance of an initial implementation.

show abstract

Section: Securitymentioning

confidence: 99%

Communicating Mobile Processes

Welch

Barnes

2005

Communicating Sequential Processes. The First 25 Years

View full text Add to dashboard Cite

show abstract

“…In the Messengers system, applications are developed as collections of self-migrating threads, called Messengers. Like many implementations of mobile agents with strong mobility, (10)(11)(12)(13)(14)(15)(16) a Messenger can halt its execution, encapsulate the values of its variables, move to another node, restore the state, and continue executing. In Messengers, this sequence of operations is carried out by a hop() statement.…”

Section: The Messengers Systemmentioning

confidence: 99%

Distributed Parallel Computing Using Navigational Programming

Pan

Lai

Noguchi

et al. 2004

International Journal of Parallel Programming

View full text Add to dashboard Cite

Message Passing (MP) and Distributed Shared Memory (DSM) are the two most common approaches to distributed parallel computing. MP is difficult to use, whereas DSM is not scalable. Performance scalability and ease of programming can be achieved at the same time by using navigational programming (NavP). This approach combines the advantages of MP and DSM, and it balances convenience and flexibility. Similar to MP, NavP suggests to its programmers the principle of pivot-computes and hence is efficient and scalable. Like DSM, NavP supports incremental parallelization and shared variable programming and is therefore easy to use. The implementation and performance analysis of real-world algorithms, namely parallel Jacobi iteration and parallel Cholesky factorization, presented in this paper supports the claim that the NavP approach is better suited for general-purpose parallel distributed programming than either MP or DSM.

show abstract

“…Electronic commerce is generally seen as one of the most promising application fields for mobile agents [2].…”

Section: Mobile Agent Applicationsmentioning

confidence: 99%

An agent-based secure internet payment system for mobile computing

Romão

Silva

1998

Trends in Distributed Systems for Electronic Commerce

View full text Add to dashboard Cite

Abstract. The SET protocol, in particular its purchasing phase, is intended for users connected to the Internet during an entire transaction. This requirement cannot be easily met in high communication costs and/or low bandwidth settings, typically found in mobile computing environments. In this paper we propose SET/A, a system that works according to the SET rules for purchasing operations, without forcing the user to be connected during the entire transaction. This is achieved by sending an agent to the merchant's server carrying all the necessary data to order and pay for the products he or she wants to buy. The paper shows that this can be achieved safely and efficiently, providing an alternative way for on-line payments using the SET protocol.

show abstract

Mobile agents: Are they a good idea?

Cited by 347 publications

References 6 publications

Communicating Mobile Processes

Communicating Mobile Processes

Distributed Parallel Computing Using Navigational Programming

An agent-based secure internet payment system for mobile computing

Contact Info

Product

Resources

About