Paper Info
Title
Queueing Analysis of Fault-Tolerant Computer Systems
Abstract
In this paper we consider the queueing analysis of a fault-tolerant computer system. The failure/repair behavior of the server is modeled by an irreducible continuous-time Markov chain. Jobs arrive in a Poisson fashion to the system and are serviced according to FCFS discipline. A failure may cause the loss of the work already done on the job in service, if any; in this case the interrupted job is repeated as soon as the server is ready to deliver service. In addition to the delays due to failures and repairs, jobs suffer delays due to queueing. We present an exact queueing analysig of the system and study the steady-state behavior of the number of jobs in the system. As a numerical example, we consider a system with two processors subject to failures and repairs.
Year
DOI
Venue
1987
10.1109/TSE.1987.233168
IEEE Transactions on Software Engineering
Keywords
Field
DocType
Fault-tolerant systems,performance models,queueing theory,reliability analysis,Fault-tolerant systems,performance models,queueing theory,reliability analysis
Computer science,Fault tolerance,Layered queueing network,Queueing theory,Distributed computing
Journal
Volume
Issue
ISSN
SE
3
0098-5589
Citations 
PageRank 
References 
14
4.77
4
Authors
3
Name
Order
Citations
PageRank
Nicola, Victor F.116724.58
Vidyadhar G. Kulkarni253960.15
Trivedi, K.S.37721700.23