Design and implementation of transactional agent Online publication date: Fri, 07-May-2010
by Youhei Tanaka, Tomoya Enokido, Makoto Takizawa
International Journal of Wireless and Mobile Computing (IJWMC), Vol. 4, No. 2, 2010
Abstract: A Transactional Agent (TA) is a mobile agent to manipulate objects with some type of commitment condition. For example, a transactional agent commits only if at least one object could be successfully manipulated in the at-least-one condition. Computers may stop by fault while networks are assumed to be reliable. In the Client-Server (CS) model, servers can be fault-tolerant according to traditional replication and checkpointing technologies. However, an application program cannot be performed if a client computer is faulty. An application program can be performed on another operational computer even if a computer is faulty in the transactional agent model. There are kinds of faulty computers for a transactional agent, current, destination, and sibling computers where a transactional agent now exist, will move, and has visited, respectively. We discuss how the transactional agent can be tolerant of the types of computer faults.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Wireless and Mobile Computing (IJWMC):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook