Minimizing Response Time for Quorum-System Protocols over Wide-Area Networks

  • Authors:
  • Florian Oprea;Michael K. Reiter

  • Affiliations:
  • Carnegie Mellon University, USA;Carnegie Mellon University, USA

  • Venue:
  • DSN '07 Proceedings of the 37th Annual IEEE/IFIP International Conference on Dependable Systems and Networks
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

A quorum system is a collection of sets (quorums) of servers,where any two quorums intersect. Quorum- based protocols underly modern edge-computing archi- tectures and throughput-scalable service implementa- tions. In this paper we propose new algorithms for plac- ing quorums in wide-area networks and tuning which quorums clients access, so as to optimize clients' aver- age response time in quorum-based protocols. We ex- amine 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 eval- uate our algorithms on topologies ranging from 50 to over 150 wide-area locations.