The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.03 - March (1995 vol.44)
pp: 462-466
ABSTRACT
<p><it>Abstract</it>—<it>k</it>-resilient protocols are used in some parallel and distributed system applications for increased availability of resources. A protocol running on an <it>n</it> site system is <it>k</it> resilient if it could tolerate up to <it>k</it> failures and operate correctly. The <it>reliability</it> of such a protocol is defined as the probability that no more than <it>k</it> sites have failed. Such a <it>k</it>-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 <it>k</it>-resilient protocols and develop a general technique for approximately computing the <it>time</it> until which these protocols have higher <it>reliability</it> than protocols running on single site systems. We call this time the <it>reliability interval</it>. 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.</p>
INDEX TERMS
k-resilient protocols, reliability, reliability interval, scalable mission time.
CITATION
Yennun Huang, Sampath Rangarajan, Satish K. Tripathi, "Computing Reliability Intervals for k-Resilient Protocols", IEEE Transactions on Computers, vol.44, no. 3, pp. 462-466, March 1995, doi:10.1109/12.372039
22 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool