Advertisement

Delay Optimizations in Quorum Consensus

  • Xuemin Lin
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2223)

Abstract

The management of replicated data in distributed database systems is a classic problem with great practical importance. Quorum consensus is one of the popular methods, combining with eager replication, for managing replicated data. In this paper, we will investigate the problems of delay-optimal quorum consensus. Firstly, we will show that the problem of minimizing the total-delay (or mean-delay) is NPhard. However, we can show that the problem restricted to some specific network topology, such as trees, rings, and meshes, can be solved in polynomial time. We also developed an approximate algorithm for a general case. The algorithm gives an approximate ratio less than 2. Secondly, we will present an efficient algorithm, based on the dynamic programming technique, to solve the problem of minimizing the maximal-delay.

Keywords

Quorum Consensus Replicated Data Management and Optimizations 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    B. Awerbuch, Y. Bartal, and A. Fiat, Distributed paging for general networks, Journal of Algorithms, 28:67–104, 1998.MathSciNetCrossRefMATHGoogle Scholar
  2. 2.
    P. Bernstein, V. Hadzilocs and N. Goodman, Concurrency Control and Recovery in Database Systems, Addison-Wesley, Reading, Mass., 1987.Google Scholar
  3. 3.
    Y. Breitbart, R. Komondoor, R. Rastogi, and S. Seshadri, Update Propagation Protocols for Replicated Databases, Proceedings of the 1999 ACM SIGMOD, 97–108, 1999.Google Scholar
  4. 4.
    Y. Breitbart and H. F. Korth, Replication and Consistency: Being lazy helps sometimes, Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, Tucson, Arizona, 1997.Google Scholar
  5. 5.
    H. Chen and J. Tang, An Efficient Method for Mutual Exclusion in Truly Distributed Systems, Int. Conf. on Distributed Computing Systems, 97–104, 1994.Google Scholar
  6. 6.
    P. Chundi, D. J. Rosenkratz, and S. S. Ravi, Deferred Updates and Data Placement in Distributed Databases, Proceedings of the Twelveth International Conference on Data Engineering, New Orleans, Louisiana, 1996.Google Scholar
  7. 7.
    T. H. Cormen, C. E. Leiserson, and R. L. Rivest, Introduction to Algorithms, MIT press, 1990.Google Scholar
  8. 8.
    A. W. Fu, Delay-Optimal Quorum Consensus for Distributed Systems, IEEE Transactions on Parallel and Distributed Systems, 8(1), 59–69, 1997.MathSciNetCrossRefGoogle Scholar
  9. 9.
    H. Garcia-Molina and D. Barbara, How to Assign Votes in a Distributed Systems, J. ACM, 32(4), 841–860, 1985.MathSciNetCrossRefMATHGoogle Scholar
  10. 10.
    J. Gray, P. Helland, P. O’Neil, and Dennis Shasha, The Dangers of Replication and a Solution, Proceedings of the ACM SIGMOD Conference, Montreal, Quebec, Canada, 1996.Google Scholar
  11. 11.
    T. Ibaraki, H. Nagamochi, and T. Kameda, Optimal Coteries for Rings and Related Networks, Distributed Computing, 8, 191–201, 1995.MathSciNetCrossRefGoogle Scholar
  12. 12.
    A. Kumar, Hierarchical Quorum Consensus: A New Algorithm for Managing Replicated Data, IEEE Transactions on Computers, 40(9), 996–1004, 1991.CrossRefGoogle Scholar
  13. 13.
    A. Kumar and A. Segev, Cost and Availability Tradeoffs in Replicated Data Concurrency Control, ACM Transactions on Database Systems, 18(1), 102–131, 1993.CrossRefGoogle Scholar
  14. 14.
    X. Lin, AFully Distributed Quorum Consensus Method with High Fault-Tolerance and Low Communication Overhead, Theoretical Computer Science, 185(2), 259–275, 1997.MathSciNetCrossRefMATHGoogle Scholar
  15. 15.
    X. Lin, Delay Optimizations in Quorum Consensus, full paper, 2001. (http://www.cse.unsw.edu.au/∼lxue.)
  16. 16.
    X. Lin and M. E. Orlowska, An Efficient Optimal Algorithm for Minimizing the Overall Communication Cost in Replicated Data Management, J. Parallel and Distributed Comput. 35, 97–103, 1996.CrossRefMATHGoogle Scholar
  17. 17.
    M. Maekawa, A √N Algorithm for Mutual Exclusion in Decentralized Systems, ACM Transactions on Computer Systems, 3(2), 145–159, 1985.CrossRefGoogle Scholar
  18. 18.
    M. T. Ozsu and P. Valduriez, Principles of Distributed Database Systems, Prentice Hall, 1991.Google Scholar
  19. 19.
    B. Maggs, F. Mayer auf der Heide, B. Vocking, and M. Westermann, Exploiting Locality for Data Management in Systems of Limited Bandwidth, Proc. of the 38th IEEE Symp. on Foundations of Computer Science (FOCS), 284–293, 1997.Google Scholar
  20. 20.
    C. H. Papadimitriou and M. Sideri, Optimal Coteries, Proceedings of ACM 10th Symposium of Distributed Computing, 75–80, 1991.Google Scholar
  21. 21.
    D. Saha, S. Rangarajan, and S. K. Tripathi, An Analysis of the Average Message Overhead in Replica Control Protocols, IEEE Transactions on Parallel and Distributed Systems, 7(10), 1026–1034, 1995.CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2001

Authors and Affiliations

  • Xuemin Lin
    • 1
  1. 1.School of Computer Science and EngineeringThe University of New South WalesSydneyAustralia

Personalised recommendations