Filters








237,949 Hits in 6.1 sec

When Is Operation Ordering Required in Replicated Transactional Storage?

Irene Zhang, Naveen Kr. Sharma, Adriana Szekeres, Arvind Krishnamurthy, Dan R. K. Ports
2016 IEEE Data Engineering Bulletin  
We describe how this analysis leads to our recent work on TAPIR, a transaction protocol that efficiently provides strict serializability by using a new replication protocol that provides fault tolerance  ...  We answer this question by analyzing existing transaction processing designs in terms of which replicated operations require ordering and which simply require fault tolerance.  ...  We also appreciate the support of our local zoo tapirs, Ulan and Bintang.  ... 
dblp:journals/debu/ZhangSSKP16 fatcat:m7y4e3fbcnhctg7kekw2yidv2u

Formal Modeling and Analysis of a Distributed Database Protocol in Maude

Peter Csaba Ölveczky
2008 2008 11th IEEE International Conference on Computational Science and Engineering - Workshops  
commit protocol for distributed databases.  ...  candidate to successfully analyze advanced state-of-the-art distributed database protocols.  ...  I thank Ragnar Normann for suggesting to analyze 2PC in Maude, and for clarifying different aspects of the protocol.  ... 
doi:10.1109/csew.2008.30 fatcat:qnz6okif25cahfw25na4x6tony

Моделювання двофазного протоколу підтвердження транзакцій з багатьма учасниками за допомогою розфарбовуваних мереж Петрі

M. Iwaniak, W. Khadzhynov
2013 Реєстрація, зберігання і обробка даних  
Розглянуто застосування розфарбовуваних мереж Петрі для побудови моделей та подальшої імітації двофазного протоколу підтвердження розподілених транзакцій — 2PC (Two-phase commit) з багатьма учасниками.  ...  The way of communication between TMs is defined by distributed transaction commit protocol. Most widely used and featured is Two-Phase Commit protocol.  ...  Resume In this work Coloured Petri Net model of 2PC protocol with two participants was presented. With usage of reachability analysis the selected scenarios of distributed transactions were shown.  ... 
doi:10.35681/1560-9189.2013.15.3.103431 fatcat:7vaksj7pb5hwph232h7lcv46ju

On the Performance Potential of Connection Fault-Tolerant Commit Processing in Mobile Environment

Tome Dimovski
2012 International Journal of Wireless & Mobile Networks  
It is inevitably harder to design efficient commit protocols, due to some intrinsic mobile environment limitations.  ...  A handful of protocols for transaction processing have been offered, but the majority considers only a limited number of communication models.  ...  The basic idea of the Two-Phase Commit Protocol for Mobile Wireless Environment (M-2PC) [10] is to adapt the 2PC protocol for mobile systems with distributed transactions.  ... 
doi:10.5121/ijwmn.2012.4503 fatcat:jrwnk54ccrhnrlklgk6fnafpvq

Security Analysis of Olvid's SAS-based Trust Establishment Protocol [article]

Michel Abdalla
2020 IACR Cryptology ePrint Archive  
In this report, we analyze the security of the trust establishment protocol used in the Olvid messaging protocol.  ...  The proof of security is in the random-oracle model and relies on the security of the underlying pseudorandom generator.  ...  Since the security analysis of the PV-SAS-MCA protocol shows that the string R ⊕ H(m B , K) is random and uniformly distributed, the same is true for prng(R ⊕ H(m B , K)) due to the security of the PRNG  ... 
dblp:journals/iacr/Abdalla20 fatcat:qzolju2v2zbwthjqytilw5zita

Adapting Commit Protocols for Large-Scale and Dynamic Distributed Applications [chapter]

Pawel Jurczyk, Li Xiong
2008 Lecture Notes in Computer Science  
In this paper, we present an adaptation of three-phase commit protocol for dynamic and scalable distributed systems.  ...  The continued advances in distributed data intensive applications have formed an increasing demand for distributed commit protocols that are adaptive to large scale and dynamic nature of the applications  ...  Below we identify a number of research challenges for adapting distributed commit protocols for such applications.  ... 
doi:10.1007/978-3-540-88871-0_33 fatcat:wrbinkuxabdwdcdjeujzs6vuvi

Arbitrarily Long Relativistic Bit Commitment

Kaushik Chakraborty, André Chailloux, Anthony Leverrier
2015 Physical Review Letters  
In particular, while the initial complexity of the protocol scaled double-exponentially with the commitment time, our analysis shows that the correct dependence is only linear.  ...  We consider the recent relativistic bit commitment protocol introduced by Lunghi et al. [Phys. Rev. Lett. 2015] and present a new security analysis against classical attacks.  ...  In particular, while the initial complexity of the protocol scaled double-exponentially with the commitment time, our analysis shows that the correct dependence is only linear.  ... 
doi:10.1103/physrevlett.115.250501 pmid:26722908 fatcat:7vkie2bndjd7pfl5a2n6ebqe6u

ROLA: A New Distributed Transaction Protocol and Its Formal Analysis [chapter]

Si Liu, Peter Csaba Ölveczky, Keshav Santhanam, Qi Wang, Indranil Gupta, José Meseguer
2018 Lecture Notes in Computer Science  
Designers of distributed database systems face the choice between stronger consistency guarantees and better performance.  ...  In this paper we define a new distributed transaction protocol, ROLA, that targets applications where only RA and PLU are needed. We formally model ROLA in Maude.  ...  In this work, we present our results on how to use formal modeling and analysis as early as possible in the design process to arrive at a mature design of a new distributed transaction protocol, called  ... 
doi:10.1007/978-3-319-89363-1_5 fatcat:spsjgekngfewrg4dvnhd6sflxi

Engineering Incentive Schemes for Ad hoc Networks [chapter]

Philipp Obreiter, Birgitta König-Ries, Georgios Papadopoulos
2004 Lecture Notes in Computer Science  
The suggested procedure comprises the analysis and adjustment of the cooperation protocol, the choice of appropriate incentives for cooperation, and guidelines for the evaluation of the incentive scheme  ...  In order to work effectively, incentive schemes need to be carefully tailored to the characteristics of the cooperation protocol they should support. This is a complex and demanding task.  ...  If exchange protocols are not viable, there exists another means of inducing the adherence to commitments, namely Distributed reputation systems.  ... 
doi:10.1007/978-3-540-30192-9_39 fatcat:oqab3jcnwbcltmjkf76qarsfza

On Scalable Synchronization for Distributed Embedded Real-Time Systems [chapter]

Sherif F. Fahmy, Binoy Ravindran, E. Douglas Jensen
2008 Lecture Notes in Computer Science  
We consider the problem of programming distributed embedded real-time systems with distributed dependencies.  ...  We also discuss several alternatives for implementing these programming abstractions and discuss the algorithms and protocols needed.  ...  A number of distributed commit protocols have been studied in the literature, with the two phase commit protocol being the most commercially successful protocol.  ... 
doi:10.1007/978-3-540-87785-1_35 fatcat:nupcizv2sbfghmaiuvkgmp4uje

Stochastic imitative game dynamics with committed agents

William H. Sandholm
2012 Journal of Economic Theory  
We show that unlike the standard imitative model, the model with committed agents generates unambiguous infinite horizon predictions: the asymptotics of the stationary distribution do not depend on the  ...  Financial support from NSF Grant SES-0851580 is gratefully acknowledged. ; website: http://www.ssc.wisc.edu/∼whs. 1 Imitative protocols can be interpreted as models of biological natural selection, with  ...  Fixed proportions of committed agents The analysis in Section 4.2 considered cases in which the numbers of committed agents were fixed independently of the population size, so that the proportions of committed  ... 
doi:10.1016/j.jet.2012.05.018 fatcat:b3xuswsiundbtgticuacneinfu

The quantum bit commitment: a complete classification of protocols [article]

Giacomo Mauro D'Ariano
2002 arXiv   pre-print
For such purpose, a complete classification of all possible bit commitment protocols is given, including all possible cheating attacks.  ...  However, it is shown that the closed system approach for the classification of commitment protocols unavoidably leads to infinite dimensions, which then invalidate the continuity argument at the basis  ...  of the commitment protocol is openly known, in the sense that the probability distribution of the state is given, and then the corresponding mixed state can be purified.  ... 
arXiv:quant-ph/0209150v1 fatcat:7lq7ghwiivbixmkoihdygluurm

Evaluating certification protocols in the partial database state machine

A. Sousa, A. Correia, F. Moura, J. Pereira, R. Oliveira
2006 First International Conference on Availability, Reliability and Security (ARES'06)  
In this paper, we present a detailed analysis of Partial Database State Machine (PDBSM) replication by comparing alternative partial replication protocols with full replication.  ...  In fact, if the chosen replica configuration prevents the local execution of transactions or if the overhead of consistency protocols offsets the savings of locality, potential gains cannot be realized  ...  The transaction then enters the committing state and the distributed termination protocol is started.  ... 
doi:10.1109/ares.2006.60 dblp:conf/IEEEares/SousaCMPO06 fatcat:e7flsf2h7jdgtgen4xashy3uai

Analysis of transaction management performance

D. Duchamp
1989 Proceedings of the twelfth ACM symposium on Operating systems principles - SOSP '89  
design improves throughput provided that log batching is used; multicasting reduces the variance of distributed commit protocols in a LAN environment; and the performance of transaction mechanisms such  ...  The conclusions of this study are: a simple optimization to two-phase commit reduces logging activity of distributed transactions; non-blocking commit is practical for some applications; multithreaded  ...  or of the United States Government.  ... 
doi:10.1145/74850.74868 dblp:conf/sosp/Duchamp89 fatcat:sclixtoryfc5voe4xdo5kn6fyu

Analysis of transaction management performance

D. Duchamp
1989 ACM SIGOPS Operating Systems Review  
design improves throughput provided that log batching is used; multicasting reduces the variance of distributed commit protocols in a LAN environment; and the performance of transaction mechanisms such  ...  The conclusions of this study are: a simple optimization to two-phase commit reduces logging activity of distributed transactions; non-blocking commit is practical for some applications; multithreaded  ...  or of the United States Government.  ... 
doi:10.1145/74851.74868 fatcat:h4deqaxkuvdk5mgjzow45rsire
« Previous Showing results 1 — 15 out of 237,949 results