An algorithmic theory of mobile agents

Authors:
Evangelos Kranakis;Danny Krizanc
Affiliations:
School of Computer Science, Carleton University, Ottawa, ON, Canada;Department of Mathematics and Computer Science, Wesleyan University, Middletown, Connecticut
Venue:
TGC'06 Proceedings of the 2nd international conference on Trustworthy global computing
Year:
2006

Citing 16
Cited 4

Computing on an anonymous ring

Journal of the ACM (JACM)
Collisions among random walks on a graph

SIAM Journal on Discrete Mathematics
Randomized algorithms

Randomized algorithms
The Rendezvous Search Problem

SIAM Journal on Control and Optimization
Designing distributed applications with mobile code paradigms

ICSE '97 Proceedings of the 19th international conference on Software engineering
Mobility: processes, computers, and agents

Mobility: processes, computers, and agents
Intelligent agents

Multiagent systems
Collaborative Robot Exploration and Rendezvous: Algorithms, Performance Bounds and Observations

Autonomous Robots
Mole – Concepts of a mobile agent system

World Wide Web
The Architecture of the Ara Platform for Mobile Agents

MA '97 Proceedings of the First International Workshop on Mobile Agents
Strategically Mobile Agents

MA '97 Proceedings of the First International Workshop on Mobile Agents
Security and Reliability in Concordia

HICSS '98 Proceedings of the Thirty-First Annual Hawaii International Conference on System Sciences-Volume 7 - Volume 7
Agent-Based Computational Economics: Growing Economies From the Bottom Up

Artificial Life
Design and Analysis of Distributed Algorithms (Wiley Series on Parallel and Distributed Computing)

Design and Analysis of Distributed Algorithms (Wiley Series on Parallel and Distributed Computing)
Mobile objects and agents (MOA)

COOTS'98 Proceedings of the 4th conference on USENIX Conference on Object-Oriented Technologies and Systems - Volume 4
A survey of active network research

IEEE Communications Magazine

The power of tokens: rendezvous and symmetry detection for two mobile agents in a ring

SOFSEM'08 Proceedings of the 34th conference on Current trends in theory and practice of computer science
Randomized rendez-vous with limited memory

LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
Randomized rendezvous with limited memory

ACM Transactions on Algorithms (TALG)
Randomized rendezvous of mobile agents in anonymous unidirectional ring networks

SIROCCO'12 Proceedings of the 19th international conference on Structural Information and Communication Complexity

Quantified Score

Hi-index	0.00

Visualization

Abstract

Mobile agents are an extension of multiagent systems in which the agents are provided with the ability to move from node to node in a distributed system. While it has been shown that mobility can be used to provide simple, efficient, fault-tolerant solutions to a number of problems in distributed computing, mobile agents have yet to become common in mainstream applications. One of the reasons for this may be the lack of an algorithmic theory which would provide a framework in which different approaches can be analyzed and the limits of mobile agent computing explored. In this paper we attempt to provide such an algorithmic theory.