IDEAS home Printed from https://ideas.repec.org/a/spr/metcap/v23y2021i3d10.1007_s11009-020-09792-z.html
   My bibliography  Save this article

Upper and Lower Bounds for the Synchronizer Performance in Systems with Probabilistic Message Loss

Author

Listed:
  • Martin Zeiner

    (ECS)

  • Ulrich Schmid

    (ECS)

Abstract

In this paper, we revisit the performance of the α-synchronizer in distributed systems with probabilistic message loss as introduced in Függer et al. [Perf. Eval. 93(2015)]. In sharp contrast to the infinite-state Markov chain resp. the exponential-size finite-state upper bound presented in the original paper, we introduce a polynomial-size finite-state Markov chain for a new synchronizer variant α ′ $\alpha ^{\prime }$ , which provides a new upper bound on the performance of the α-synchronizer. Both analytic and simulation results show that our new upper bound is strictly better than the existing one. Moreover, we show that a modified version of the α ′ $\alpha ^{\prime }$ -synchronizer provides a lower bound on the performance of the α-synchronizer. By means of elaborate simulation results, we show that our new lower bound is also strictly better than the lower bound presented in the original paper.

Suggested Citation

  • Martin Zeiner & Ulrich Schmid, 2021. "Upper and Lower Bounds for the Synchronizer Performance in Systems with Probabilistic Message Loss," Methodology and Computing in Applied Probability, Springer, vol. 23(3), pages 1023-1056, September.
    • Handle: RePEc:spr:metcap:v:23:y:2021:i:3:d:10.1007_s11009-020-09792-z
    DOI: 10.1007/s11009-020-09792-z
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s11009-020-09792-z
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s11009-020-09792-z?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:metcap:v:23:y:2021:i:3:d:10.1007_s11009-020-09792-z. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.