Citation
F. Oprea and M. K. Reiter. "Minimizing response time for quorum-system protocols over wide-area networks". Proceedings of the 2007 International Conference on Dependable Systems and Networks, June, 2007.

Abstract
A quorum system is a collection of sets (quorums) of servers, where any two quorums intersect. Quorum-based protocols underly modern edge-computing architectures and throughput-scalable service implementations. In this paper we propose new algorithms for placing quorums in wide-area networks and tuning which quorums clients access, so as to optimize clients' average response time in quorum-based protocols. We examine scenarios in which the service is lightly loaded and hence network latency is the dominant delay, and in which client-induced load contributes significantly to the delay that clients observe. In each case, we evaluate our algorithms on topologies ranging from 50 to over 150 wide-area locations.

Electronic downloads
(No downloads are available for this publication.)

Citation formats

• HTML

  F. Oprea and M. K. Reiter. <a
  href="http://www.truststc.org/pubs/245.html">Minimizing
  response time for quorum-system protocols over wide-area
  networks</a>, Proceedings of the 2007 International
  Conference on Dependable Systems and Networks, June, 2007.

• Plain text

  F. Oprea and M. K. Reiter. "Minimizing response time for
  quorum-system protocols over wide-area networks".
  Proceedings of the 2007 International Conference on
  Dependable Systems and Networks, June, 2007.

• BibTeX

  @inproceedings{OpreaReiter07_MinimizingResponseTimeForQuorumsystemProtocolsOverWidearea,
      author = {F. Oprea and M. K. Reiter},
      title = {Minimizing response time for quorum-system
                protocols over wide-area networks},
      booktitle = {Proceedings of the 2007 International Conference
                on Dependable Systems and Networks},
      month = {June},
      year = {2007},
      abstract = {A quorum system is a collection of sets (quorums)
                of servers, where any two quorums intersect.
                Quorum-based protocols underly modern
                edge-computing architectures and
                throughput-scalable service implementations. In
                this paper we propose new algorithms for placing
                quorums in wide-area networks and tuning which
                quorums clients access, so as to optimize clients'
                average response time in quorum-based protocols.
                We examine scenarios in which the service is
                lightly loaded and hence network latency is the
                dominant delay, and in which client-induced load
                contributes significantly to the delay that
                clients observe. In each case, we evaluate our
                algorithms on topologies ranging from 50 to over
                150 wide-area locations.},
      URL = {http://www.truststc.org/pubs/245.html}
  }
  

Posted by Michael Reiter on 25 Mar 2007.
For additional information, see the Publications FAQ or contact webmaster at www truststc org..

Notice: This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright.