2 Search Results for "Druschel, Peter"


Document
Quantitative Analysis of Consistency in NoSQL Key-Value Stores

Authors: Si Liu, Jatin Ganhotra, Muntasir Raihan Rahman, Son Nguyen, Indranil Gupta, and José Meseguer

Published in: LITES, Volume 4, Issue 1 (2017). Leibniz Transactions on Embedded Systems, Volume 4, Issue 1


Abstract
The promise of high scalability and availability has prompted many companies to replace traditional relational database management systems (RDBMS) with NoSQL key-value stores. This comes at the cost of relaxed consistency guarantees: key-value stores only guarantee eventual consistency in principle. In practice, however, many key-value stores seem to offer stronger consistency. Quantifying how well consistency properties are met is a non-trivial problem.  We address this problem by formally modeling key-value stores as probabilistic systems and quantitatively analyzing their consistency properties by both statistical model checking and implementation evaluation. We present for the first time a formal probabilistic model of Apache Cassandra, a popular NoSQL key-value store, and quantify how much Cassandra achieves various consistency guarantees under various conditions. To validate our model, we evaluate multiple consistency properties using two methods and compare them against each other. The two methods are: (1) an implementation-based evaluation of the source code; and (2) a statistical model checking analysis of our probabilistic model.

Cite as

Si Liu, Jatin Ganhotra, Muntasir Raihan Rahman, Son Nguyen, Indranil Gupta, and José Meseguer. Quantitative Analysis of Consistency in NoSQL Key-Value Stores. In LITES, Volume 4, Issue 1 (2017). Leibniz Transactions on Embedded Systems, Volume 4, Issue 1, pp. 03:1-03:26, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2017)


Copy BibTex To Clipboard

@Article{liu_et_al:LITES-v004-i001-a003,
  author =	{Liu, Si and Ganhotra, Jatin and Rahman, Muntasir Raihan and Nguyen, Son and Gupta, Indranil and Meseguer, Jos\'{e}},
  title =	{{Quantitative Analysis of Consistency in NoSQL Key-Value Stores}},
  booktitle =	{LITES, Volume 4, Issue 1 (2017)},
  pages =	{03:1--03:26},
  journal =	{Leibniz Transactions on Embedded Systems},
  ISSN =	{2199-2002},
  year =	{2017},
  volume =	{4},
  number =	{1},
  editor =	{Liu, Si and Ganhotra, Jatin and Rahman, Muntasir Raihan and Nguyen, Son and Gupta, Indranil and Meseguer, Jos\'{e}},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LITES-v004-i001-a003},
  doi =		{10.4230/LITES-v004-i001-a003},
  annote =	{Keywords: NoSQL Key-value Store, Consistency, Statistical Model Checking, Rewriting Logic, Maude}
}
Document
Abstracting out Byzantine Behavior

Authors: Peter Druschel, Andreas Haeberlen, and Petr Kouznetsov

Published in: Dagstuhl Seminar Proceedings, Volume 6371, From Security to Dependability (2007)


Abstract
Many distributed systems are designed to tolerate the presence of emph{Byzantine} failures: an individual process may arbitrarily deviate from the algorithm assigned to it. Depending on the application requirements, systems enjoy various levels of fault-tolerance. Systems based on state machine replication are able to emph{mask} failures so that their effect is not visible by the application. In contrast, cooperative peer-to-peer systems can tolerate bounded deviant behavior to some extent and therefore do not require masking, as long as each faulty node is emph{exposed}eventually. Finding an abstract way to reason about the levels of fault-tolerance is thus of immanent importance. We discuss how the information of deviant behavior can be abstracted out in the form of a emph{Byzantine failure detector} (BFD). We formally define a BFD abstraction, and we discuss two ways of using the abstraction: (1) monitoring systems in order to retroactively detect Byzantine failures and (2) enforcing systems in order to boost their level of fault-tolerance. Interestingly, the BFD formalism allowed us to determine the relative hardness of implementing two popular abstractions in distributed computing: state machine replication and weak interactive consistency.

Cite as

Peter Druschel, Andreas Haeberlen, and Petr Kouznetsov. Abstracting out Byzantine Behavior. In From Security to Dependability. Dagstuhl Seminar Proceedings, Volume 6371, pp. 1-12, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2007)


Copy BibTex To Clipboard

@InProceedings{druschel_et_al:DagSemProc.06371.3,
  author =	{Druschel, Peter and Haeberlen, Andreas and Kouznetsov, Petr},
  title =	{{Abstracting out Byzantine Behavior}},
  booktitle =	{From Security to Dependability},
  pages =	{1--12},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2007},
  volume =	{6371},
  editor =	{Christian Cachin and Felix C. Freiling and Jaap-Henk Hoepman},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.06371.3},
  URN =		{urn:nbn:de:0030-drops-8501},
  doi =		{10.4230/DagSemProc.06371.3},
  annote =	{Keywords: Fault-tolerance, Byzantine failures, masking, detection, total order broadcast, weak interactive consistency}
}
  • Refine by Author
  • 1 Druschel, Peter
  • 1 Ganhotra, Jatin
  • 1 Gupta, Indranil
  • 1 Haeberlen, Andreas
  • 1 Kouznetsov, Petr
  • Show More...

  • Refine by Classification
  • 1 Computer systems organization → Cloud computing
  • 1 Information systems → Key-value stores
  • 1 Software and its engineering → Model checking
  • 1 Theory of computation → Rewrite systems

  • Refine by Keyword
  • 1 Byzantine failures
  • 1 Consistency
  • 1 Fault-tolerance
  • 1 Maude
  • 1 NoSQL Key-value Store
  • Show More...

  • Refine by Type
  • 2 document

  • Refine by Publication Year
  • 1 2007
  • 1 2017

Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail