|
ハヤシバラ ナオヒロ
HAYASHIBARA NAOHIRO
林原 尚浩 所属 京都産業大学 情報理工学部 情報理工学科 職種 教授 |
|
| 言語種別 | 英語 |
| 発行・発表の年月 | 2004 |
| 形態種別 | 研究論文 |
| 査読 | 査読あり |
| 標題 | A mobile agent model for fault-tolerant manipulation on distributed objects |
| 執筆形態 | その他 |
| 掲載誌名 | Tertiary Education and Management |
| 出版社・発行元 | Routledge |
| 巻・号・頁 | 10(1),pp.81-93 |
| 著者・共著者 | Youhei Tanaka,Naohiro Hayashibara,Tomoya Enokido,Makoto Takizawa |
| 概要 | In this paper, we discuss how to realize fault-tolerant applications on distributed objects. Servers supporting objects can be fault-tolerant by taking advantage of replication and checkpointing technologies. However, there is no discussion on how application programs being performed on clients are tolerant of clients faults. For example, servers might block in the two-phase commitment protocol due to the client fault. We newly discuss how to make application programs fault-tolerant by taking advantage of mobile agent technologies where a program can move from a computer to another computer in networks. An application program to be performed on a faulty computer can be performed on another operational computer by moving the program in the mobile agent model. In this paper, we discuss a transactional agent model where a reliable and efficient application for manipulating objects in multiple computers is realized in the mobile agent model. In the transactional agent model, only a small part of the application program named routing subagent moves around computers. A routing subagent autonomously finds a computer which to visit next. We discuss a hierarchical navigation map which computer should be visited price to another computer in a transactional agent. A routing subagent makes a decision on which computer visit for the hierarchical navigation map. Programs manipulating objects in a computer are loaded to the computer on arrival of the routing subagent in order to reduce the communication overhead. This part of the transactional agent is a manipulating subagent. The manipulation subagent still exists on the computer even after the routing subagent leaves the computer in order to hold objects until the commitment. We assume every computer may stop by fault while networks are reliable. There are kinds of faulty computers for a transactional agent
current, destination, and sibling computers where a transactional agent now exists, will move, and has visited, respectively. The types of faults are detected by neighbouring manipulation subagents by communicating with each other. If some of the manipulation subagents are faulty, the routing subagent has to be aborted. However, the routing subagent is still moving. We discuss how to efficiently deliver the abort message to the moving routing sub-agent. We evaluate the transactional agent model in terms of how long it takes to abort the routing subagent if some computer is faulty. © Springer Science+Business Media, LLC 2007. |
| DOI | 10.1007/s10586-007-0007-x |
| ISSN | 1573-1936 |