Skip Navigation

The Computer Journal 2001 44(6):473-485; doi:10.1093/comjnl/44.6.473
© 2001 by British Computer Society
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Search for citing articles in:
ISI Web of Science (16)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Dohi, T.
Right arrow Articles by Trivedi, K.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Estimating Software Rejuvenation Schedules in High-Assurance Systems

Tadashi Dohi1, Katerina Goseva-Popstojanova2 and Kishor Trivedi3

1 Department of Industrial and Systems Engineering, Hiroshima University, Higashi-Hiroshima 739-8527, Japan Email: dohi@gal.sys.hiroshima-u.ac.jp 2 Lane Department of Computer Science and Electrical Engineering, West Virginia University, Morgantown, WV 26506-6109, USA 3 Department of Electrical and Computer Engineering, Duke University, Durham, NC 27708-0294, USA

Software rejuvenation is a preventive maintenance technique that has been extensively studied in recent literature. In this paper, we extend the classical result by Huang et al. (1995), and in addition propose a modified stochastic model to generate the software rejuvenation schedule. More precisely, the software rejuvenation models are formulated via the semi-Markov reward process, and the optimal software rejuvenation schedules are derived analytically in terms of the reward rate. In particular, we consider the two special cases: steady-state availability and expected cost per unit time in the steady state. Further, we develop non-parametric algorithms to estimate the optimal software rejuvenation schedules, provided that the statistically complete (unsensored) sample data of failure time is given. In numerical examples, we compare two models from the viewpoints of system availability and economic justification, and examine asymptotic properties for the statistical estimation algorithms.

Received 2 November, 2000. Revised 2 May, 2001.


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?


This article has been cited by other articles:


Home page
 IEICE Trans Inf & SystHome page
K. RINSAKA and T. DOHI
Behavioral Analysis of a Fault-Tolerant Software System with Rejuvenation
IEICE Trans D: Information, December 1, 2005; E88-D(12): 2681 - 2690.
[Abstract] [PDF]


Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.