DocumentCode :
751829
Title :
Computing reliability intervals for k-resilient protocols
Author :
Rangarajan, Sampath ; Huang, Yennun ; Tripathi, Satish K.
Author_Institution :
Dept. of Electr. & Comput. Eng., Northeastern Univ., Boston, MA, USA
Volume :
44
Issue :
3
fYear :
1995
fDate :
3/1/1995 12:00:00 AM
Firstpage :
462
Lastpage :
466
Abstract :
k-resilient protocols are used in some parallel and distributed system applications for increased availability of resources. A protocol running on an n site system is k resilient if it could tolerate up to k failures and operate correctly. The reliability of such a protocol is defined as the probability that no more than k sites have failed. Such a k-resilient protocol is beneficial only when its reliability is greater than the reliability of a protocol running on a system with a single site. We consider k-resilient protocols and develop a general technique for approximately computing the time until which these protocols have higher reliability than protocols running on single site systems. We call this time the reliability interval. Our general techniques for computing the reliability interval can be used irrespective of the type of failure distribution (with respect to time) of the sites of the system. We use experimental results to validate our technique
Keywords :
computer network reliability; fault tolerant computing; protocols; availability of resources; k-resilient protocols; reliability interval; reliability intervals; Access protocols; Application software; Availability; Computer science; Concurrent computing; Distributed computing; Permission; Voting;
fLanguage :
English
Journal_Title :
Computers, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9340
Type :
jour
DOI :
10.1109/12.372039
Filename :
372039
Link To Document :
بازگشت