Presentation 2003/7/30
A study on the N+1 redundancy of dependable mobile agents system
Satoshi OGAWA,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) The N+1 redundancy is widely used for dependability and has the least redundancy for the economical reason. Mobile Agents can be constructed to have N+M redundancy, which is expanded from N+1 redundancy. Clone mobile agents have the object level N+M redundancy, and have no design diversity. In the case of clone agents, it is easy to generate a stand-by agent, because the generation is just a generation of software object. This paper proposes the effect of 2-out-of-N voting of mobile agents for a quick decision and the endless-recovery of the clone agents like Zombie for the eternal life.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) Software Reliability / Mobile Agent / Software Fault-tolerance
Paper # DC2003-10
Date of Issue

Conference Information
Committee DC
Conference Date 2003/7/30(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Vice Chair

Paper Information
Registration To Dependable Computing (DC)
Language JPN
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) A study on the N+1 redundancy of dependable mobile agents system
Sub Title (in English)
Keyword(1) Software Reliability
Keyword(2) Mobile Agent
Keyword(3) Software Fault-tolerance
1st Author's Name Satoshi OGAWA
1st Author's Affiliation Kurashiki University of Science and the Arts()
Date 2003/7/30
Paper # DC2003-10
Volume (vol) vol.103
Number (no) 250
Page pp.pp.-
#Pages 6
Date of Issue