Skip to main navigation Skip to search Skip to main content

Computing Reliability Intervals for k-Resilient Protocols

  • Sampath Rangarajan
  • , Yennun Huang
  • , Satish K. Tripathi
    • Northeastern University
    • Nokia

    Research output: Contribution to journal › Article › peer-review

    1 Scopus citations

    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 ft-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.

    Original languageEnglish
    Pages (from-to)462-466
    Number of pages5
    JournalIEEE Transactions on Computers
    Volume44
    Issue number3
    DOIs
    StatePublished - Mar 1995

    Fingerprint

    Dive into the research topics of 'Computing Reliability Intervals for k-Resilient Protocols'. Together they form a unique fingerprint.

    Cite this