Team for Research in
Ubiquitous Secure Technology

Citation
F. Oprea, M. 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

• HTML

  F. Oprea, M. 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, M. 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. 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.