Completeness theorems for non-cryptographic fault-tolerant distributed computation
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Fast asynchronous Byzantine agreement with optimal resilience
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
The Byzantine Generals Problem
ACM Transactions on Programming Languages and Systems (TOPLAS)
Communications of the ACM
The design and implementation of a secure auction service
SP '95 Proceedings of the 1995 IEEE Symposium on Security and Privacy
Itinerant Agents for Mobile Computing
IEEE Communications Surveys & Tutorials
Classification of malicious host threats in mobile agent computing
SAICSIT '02 Proceedings of the 2002 annual research conference of the South African institute of computer scientists and information technologists on Enablement through technology
D'Agents: applications and performance of a mobile-agent system
Software—Practice & Experience - Special issue: Mobile agent systems
ACM Transactions on Internet Technology (TOIT)
FANTOMAS: Fault Tolerance for Mobile Agents in Clusters
IPDPS '00 Proceedings of the 15 IPDPS 2000 Workshops on Parallel and Distributed Processing
Agent-Mediated Secure Electronic Transaction for Online Interdependent Purchases
E-Commerce Agents, Marketplace Solutions, Security Issues, and Supply and Demand
Language Issues in Mobile Program Security
Mobile Agents and Security
D'Agents: Security in a Multiple-Language, Mobile-Agent System
Mobile Agents and Security
SPMH: a solution to the problem of malicious hosts
Journal of Computer Science and Technology
Hardening Functions for Large Scale Distributed Computations
SP '03 Proceedings of the 2003 IEEE Symposium on Security and Privacy
Architectural components for the efficient design of mobile agent systems
SAICSIT '03 Proceedings of the 2003 annual research conference of the South African institute of computer scientists and information technologists on Enablement through technology
RDS: Remote Distributed Scheme for Protecting Mobile Agents
AAMAS '04 Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems - Volume 1
Approaches to fault-tolerant and transactional mobile agent execution---an algorithmic view
ACM Computing Surveys (CSUR)
A security protocol for mobile agents based upon the cooperation of sedentary agents
Journal of Network and Computer Applications
The agent migration and fault-tolerance management in dynamic network security system
International Journal of Information Technology and Management
Secure brokerage mechanisms for mobile electronic commerce
Computer Communications
Algorithms and theory of computation handbook
Modeling fault-tolerant and reliable mobile agent execution in distributed systems
EC'05 Proceedings of the 6th WSEAS international conference on Evolutionary computing
Searching for high-value rare events with uncheatable grid computing
ACNS'05 Proceedings of the Third international conference on Applied Cryptography and Network Security
A secure protocol for mobile agents in hostile environment
MATA'05 Proceedings of the Second international conference on Mobility Aware Technologies and Applications
| Hi-index | 0.00 |
Mobile processes, or agents, have been proposed for a variety of applications in the Internet and other large distributed systems. But little work has been directed at operating-system support for agents. This paper discusses one aspect of the problem---implementing fault-tolerance without specialized hardware.In traditional client-server settings, a central and trusted host may send all messages and receive all replies, thereby implementing a star-shaped communications pattern. In contrast, an agent can execute autonomously at a succession of remote sites without returning to the host that launched it. Thus, computations structured using agents may consume less network-bandwidth in performing tasks that involve multiple hosts. Moreover, for some settings, it is unrealistic to presume the existence of a central host that remains connected to the network---mobile computing and wireless networks are obvious examples.In an open distributed system, agents comprising an application must not only survive (possibly malicious) failures of the hosts they visit, but they must also be resilient to the potentially hostile actions of other hosts. Correctness of a computation should depend only on hosts that would be visited in a failure-free run. We assume that faulty hosts produce erroneous messages, that they can masquerade as other faulty hosts, but that they cannot assume the identities and do not have access to secrets of non-faulty hosts.Replication and voting are necessary to survive malicious behavior by visited hosts. However, faulty hosts that are not visited by agents can confound a naive replica-management scheme by spoofing. With this in mind, we have been investigating protocols for replication and voting in a family of applications. Our protocols use cryptographic techniques in novel ways. Furthermore, our experiments reveal that fast (correct) hosts can mask delays caused by slow ones, so replication actually speeds up some applications.Section 2 characterizes the family of applications treated in this paper. Section 3 describes experiments we ran to explore performance implications of replication and voting in this setting. The role of cryptographic techniques in our protocols is discussed in section 4. Section 5 contains our conclusions.