Distributed transaction processing as a reliability concept for mobile agents

Vogler, Hartmut; Kunkelmann, Thomas; Moschgath, Marie-Luise

doi:10.1109/ftdcs.1997.644704

Cited by 15 publications

(5 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In Vogler et al (1997) an architecture is presented for a mobile agent system which offers fault tolerance for the whole agent system at a high level. Being involved in money transactions, supplementary security features for mobile agent systems have to be ensured.…”

Section: Resultsmentioning

confidence: 99%

“…Being involved in money transactions, supplementary security features for mobile agent systems have to be ensured. In Vogler et al (1997) an architecture is presented for a mobile agent system which offers fault tolerance for the whole agent system at a high level. This architecture claims to guarantee security for the host as well as for the agent.…”

Section: Resultsmentioning

confidence: 99%

See 1 more Smart Citation

Ontological modelling of e‐services to ensure appropriate mobile transactions

Terziyan

2002

Intelligent Systems in Accounting, Finance and Management

View full text Add to dashboard Cite

The main goal of this paper is to provide simple ontological support to mobile electronic commerce. The description of an ontology‐driven Transaction Monitor (TM) for mobile business applications is considered. The approach is based on the assumption that the transaction management tool can be implemented in a mobile terminal, allowing integration of different distributed external e‐services. We use the ontology‐based framework for transaction management so that the TM will be able to manage transaction across multiple e‐services and we consider management of distributed location‐based services as an example of such ontology‐based TM implementation. The core of the approach is very simple service ontologies. Ontologies should be ‘placed’ both in mobile terminals and in e‐services. They define common multiple clients—multiple services standards and vocabularies for the use of the names, types, schemas, default values for parameters, atomic service actions with appropriate structure of action's input and output. In our implementation ontologies help to the TM to deal with multiple services during transactions and to simplify the appropriate user interface. Copyright © 2003 John Wiley & Sons, Ltd.

show abstract

Section: Resultsmentioning

confidence: 99%

Section: Resultsmentioning

confidence: 99%

Ontological modelling of e‐services to ensure appropriate mobile transactions

Terziyan

2002

Intelligent Systems in Accounting, Finance and Management

View full text Add to dashboard Cite

show abstract

“…ACID transactions and distributed ACID transactions [19], which ensure that multiple parties agree on the outcome of a given interaction, also play a key role in servers that must execute requests only once. The large body of work on the atomic commit and consensus problems [20] is a fundamental part of the solution for distributed transactions.…”

Section: Exactly-once Execution Of Requestsmentioning

confidence: 99%

A taxonomy of reliable request-response protocols

Ivaki

Laranjeiro

Araújo

2015

Proceedings of the 30th Annual ACM Symposium on Applied Computing

View full text Add to dashboard Cite

Reliable request-response interactions, in which the server never executes a given request more than once, are being used to support business and safety-critical operations in diverse sectors, such as banking, E-commerce, or healthcare. This form of interactions can be quite difficult to implement, because the client, server, or communication channel may fail, potentially requiring diverse and complex recovery procedures, which may result in duplicate messages being processed at the server. In this paper we address the following question: could we provide a meaningful taxonomy of reliable request-response protocols? We generate valid sequences of client and server actions, organize the generated sequences into a prefix tree, and classify them according to their reliability semantics and memory requirements. The tree reveals three families of protocols matching common real-world implementations that try to deliver exactly-once or at-most-once. The strict organization of the protocols provides a solid foundation for creating correct services, and we show that it also serves to easily identify fallacies and pitfalls of existing implementations.

show abstract

“…Vogler et al [83,84] use the SSC approach. Their main focus is to ensure exactly-once semantics for the transfer of the agent between two consecutive places p i and p i+1 .…”

Section: Vogler Et Al's Approachmentioning

confidence: 99%

“…We consider the following commit-after-stage approaches: the Byzantine failures approach [45,73], Concordia [85], the exception handling approach [54], FANTOMAS [53], Fatomas [58,59], Lyu and Wong's approach [42], MAgNET [15], Mishra and Huang's ARP family of protocols [47], NAP [33], the transaction and leader-election based approaches of [68] and [5], and Vogler et al's approach [83,84].…”

Section: Commit-after-stage Approachesmentioning

confidence: 99%

Approaches to fault-tolerant and transactional mobile agent execution---an algorithmic view

Pleisch

Schiper

2004

ACM Comput. Surv.

View full text Add to dashboard Cite

Over the past years, mobile agent technology has attracted considerable attention, and a significant body of literature has been published. To further develop mobile agent technology, reliability mechanisms such as fault tolerance and transaction support are required. This article aims at structuring the field of fault-tolerant and transactional mobile agent execution and thus at guiding the reader to understand the basic strengths and weaknesses of existing approaches. It starts with a discussion on providing fault tolerance in a system in which processes simply fail. For this purpose, we first identify two basic requirements for faulttolerant mobile agent execution: (1) non-blocking (i.e., a single failure does not prevent progress of the mobile agent execution) and (2) exactly-once (i.e., multiple executions of the agent are prevented). This leads us to introduce the notion of a local transaction as the basic building block for fault-tolerant mobile agent execution and to classify existing approaches according to when and by whom the local transactions are committed. In a second part, we show that transactional mobile agent execution additionally ensures execution atomicity and present a survey of existing approaches. In the last part of the survey, we extend the notion of fault tolerance to arbitrary Byzantine failures and security-related issues of the mobile agent execution.

show abstract

Distributed transaction processing as a reliability concept for mobile agents

Abstract: Mobile agents offer a new possibility for the development of applications in distributed systems

Cited by 15 publications

References 10 publications

Ontological modelling of e‐services to ensure appropriate mobile transactions

Ontological modelling of e‐services to ensure appropriate mobile transactions

A taxonomy of reliable request-response protocols

Approaches to fault-tolerant and transactional mobile agent execution---an algorithmic view

Contact Info

Product

Resources

About