Skip to main content
SpringerLink
Log in
Book cover

International Conference on Algorithms and Architectures for Parallel Processing

ICA3PP 2015: Algorithms and Architectures for Parallel Processing pp 717–728Cite as

Crossing – A Highly Available Quorum Protocol for Arbitrary Planar Topologies

  • Conference paper
  • First Online:

  • 1757 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 9530))

Abstract

Quorums are a powerful concept that can be used to implement highly available services. Quorum protocols use replicas of data to increase service availability. Unfortunately, applying quorum protocols in real-world networks often turns out to be difficult, since efficient quorum protocols depend on a particular topology imposed on the replicas managed by it. To effectuate these protocols, the topology of the real-world network must be identical to the particular topology required by the protocol. Clearly, this is a very strong constraint. In this paper, we present a novel quorum protocol that overcomes this difficulty and works directly on arbitrary planar network topologies. To use the new protocol even on non-planar graphs, we present a method to transform non-planar graphs into planar graphs.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

References

  1. Davidson, S.B., García-Molina, H., Skeen, D.: Consistency in partitioned networks. ACM Comput. Surv. 17(3), 341–370 (1985)

    Article  Google Scholar 

  2. Wu, C.: Replica control protocols that guarantee high availability and low access cost. Ph.D. thesis, University of Illinois, Urbana-Champaign (1993)

    Google Scholar 

  3. Malkhi, D.: Quorum systems. In: Urban, J., Dasgupta, P. (eds.) The Encyclopedia of Distributed Computing. Kluwer Academic Publishers, Boston (2000)

    Google Scholar 

  4. Bernstein, P.A., Hadzilacos, V., Goodman, N.: Concurrency control and recovery in database systems. Addison Wesley, Boston (1987). ISBN-13 978–0201107159

    Google Scholar 

  5. Wu, C., Belford, G.G.: The triangular lattice protocol: A highly fault tolerant and highly efficient protocol for replicated data. In: Proceedings of the 11th Symposium on Reliable Distributed Systems (SRDS 1992). IEEE Computer Society Press, October 1992

    Google Scholar 

  6. Cheung, S.Y., Ammar, M.H., Ahamad, M.: The grid protocol: a high performance scheme for maintaining replicated data. IEEE Trans. Knowl. Data Eng. 4(6), 582–592 (1990)

    Article  Google Scholar 

  7. Thomas, R.H.: A majority consensus approach to concurrency control for multiple copy databases. ACM Trans. Database Syst. 4(2), 180–207 (1979)

    Article  Google Scholar 

  8. Gifford, D.K.: Weighted voting for replicated data. In: Proceedings of the 7th Symposium on Operating Systems Principles (SOSP 1979), pp. 150–161. ACM Press, December 1979

    Google Scholar 

  9. Peleg, D., Wool, A.: Crumbling walls: a class of high availability quorum systems. Technical report CS94-07, Faculty of Mathematical Sciences, Weizmann Institute of Science, Rehovot, Israel, 1 January 1994

    Google Scholar 

  10. Peleg, D., Wool, A.: The availability of crumbling wall quorum systems. Discrete Appl. Math. 74(1), 69–83 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  11. Theel, O., Pagnia-Koch, H.-H.: General design of grid-based data replication schemes using graphs and a few rules. In: Proceedings of the 15th International Conference on Distributed Computing Systems (ICDCS 1995), pp. 395–403. IEEE Computer Society Press, May 1995

    Google Scholar 

  12. Boyer, J.M., Myrvold, W.J.: On the cutting edge: simplified o(n) planarity by edge addition. J. Graph Algorithms Appl. 8, 2004 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  13. Moreira, A., Santos, M.Y.: Concave hull: a k-nearest neighbours approach for the computation of the region occupied by a set of points (2007)

    Google Scholar 

  14. Hart, P.E., Nilsson, N.J., Raphael, B.: A formal basis for the heuristic determination of minimum cost paths. IEEE Trans. Syst. Sci. Cybern. SSC–4(2), 100–107 (1968)

    Article  Google Scholar 

  15. Schadek, R., Theel, O.: A graph suite generator for real world quorum protocol analysis. In: Proceedings of the 2nd Argentinian National Conference on Engineer Informatics and Information Systems (CoNaIISI 2014), San Luis, Argentina, November 2014. Red de Carreras de Ingeniería Informática/Sistemas de Informatión (RIISIC)

    Google Scholar 

Download references

Acknowledgements

This work has been partially supported by the German Research Foundation (DFG) as part of the Transregional Collaborative Research Center “Automatic Verification and Analysis of Complex Systems” (SFB/TR 14 AVACS).

Author information

Authors and Affiliations

  1. Department of Computer Science, Carl von Ossietzky University of Oldenburg, 26111, Oldenburg, Germany

    Robert Schadek & Oliver Theel

Authors
  1. Robert Schadek
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Oliver Theel
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Robert Schadek .

Editor information

Editors and Affiliations

  1. Central South University, Changsha, China

    Guojun Wang

  2. The University of Sydney, Sydney, New South Wales, Australia

    Albert Zomaya

  3. University of Murcia, Murcia, Murcia, Spain

    Gregorio Martinez

  4. Hunan University, Changsha, China

    Kenli Li

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Schadek, R., Theel, O. (2015). Crossing – A Highly Available Quorum Protocol for Arbitrary Planar Topologies. In: Wang, G., Zomaya, A., Martinez, G., Li, K. (eds) Algorithms and Architectures for Parallel Processing. ICA3PP 2015. Lecture Notes in Computer Science(), vol 9530. Springer, Cham. https://doi.org/10.1007/978-3-319-27137-8_52

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-27137-8_52

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-27136-1

  • Online ISBN: 978-3-319-27137-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation