{"title":"Pronto: a fast failover protocol for off-the-shelf commercial databases","authors":"F. Pedone, Svend Frølund","doi":"10.1109/RELDI.2000.885405","DOIUrl":"https://doi.org/10.1109/RELDI.2000.885405","url":null,"abstract":"Enterprise applications typically store their state in databases. If a database fails, the application is unavailable while the database recovers. Database recovery is time consuming because it involves replaying the persistent transaction log. To isolate end users from database failures, we introduce Pronto, a protocol to orchestrate the transaction processing by multiple, standard databases so that they collectively implement the illusion of a single, highly available database. The key challenge in implementing this illusion is to enable fast failover from one database to another so that database failures do not interrupt the transaction processing. We solve this problem with a novel replication protocol that handles non-determinism without relying on perfect failure detection.","PeriodicalId":355208,"journal":{"name":"Proceedings 19th IEEE Symposium on Reliable Distributed Systems SRDS-2000","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-10-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115439034","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"An investigation of membership and clique avoidance in TTP/C","authors":"G. Bauer, M. Paulitsch","doi":"10.1109/RELDI.2000.885399","DOIUrl":"https://doi.org/10.1109/RELDI.2000.885399","url":null,"abstract":"Avoiding the partitioning of a cluster into cliques that are not able to communicate with each other is an important issue in the time-triggered communication protocol TTP/C. This is achieved by a mechanism called clique avoidance. The clique avoidance algorithm always selects one partition (clique) to win and causes all nodes of other partitions to shut down. In this paper, we investigate the properties of this algorithm by analyzing its performance, elaborating the properties and showing how the clique avoidance algorithm interacts with the implicit acknowledgement algorithm of TTP/C.","PeriodicalId":355208,"journal":{"name":"Proceedings 19th IEEE Symposium on Reliable Distributed Systems SRDS-2000","volume":"78 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-10-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126315575","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Abstractions for devising Byzantine-resilient state machine replication","authors":"A. Doudou, R. Guerraoui, B. Garbinato","doi":"10.1109/RELDI.2000.885402","DOIUrl":"https://doi.org/10.1109/RELDI.2000.885402","url":null,"abstract":"State machine replication is a common approach for making a distributed service highly available and resilient to failures, by replicating it on different processes. It is well known, however that the difficulty of ensuring the safety and liveness of a replicated service increases significantly when no synchrony assumptions are made, and when processes can exhibit Byzantine behaviors. The contribution of the work is to break the complexity of devising a Byzantine-resilient state machine replication protocol, by decomposing it into key modular abstractions. In addition to being modular, the protocol we propose always preserves safety in the presence of less than one third of Byzantine processes, independently of any synchrony assumptions. As for the liveness of our protocol, it relies on a Byzantine failure detector that encapsulates a sufficient amount of synchrony.","PeriodicalId":355208,"journal":{"name":"Proceedings 19th IEEE Symposium on Reliable Distributed Systems SRDS-2000","volume":"107 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-10-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114540799","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
M. Wiesmann, A. Schiper, F. Pedone, Bettina Kemme, G. Alonso
{"title":"Database replication techniques: a three parameter classification","authors":"M. Wiesmann, A. Schiper, F. Pedone, Bettina Kemme, G. Alonso","doi":"10.1109/RELDI.2000.885408","DOIUrl":"https://doi.org/10.1109/RELDI.2000.885408","url":null,"abstract":"Data replication is an increasingly important topic as databases are more and more deployed over clusters of workstations. One of the challenges in database replication is to introduce replication without severely affecting performance. Because of this difficulty, current database products use lazy replication, which is very efficient but can compromise consistency. As an alternative, eager replication guarantees consistency but most existing protocols have a prohibitive cost. In order to clarify the current state of the art and open up new avenues for research, this paper analyses existing eager techniques using three key parameters (server architecture, server interaction and transaction termination). In our analysis, we distinguish eight classes of eager replication protocols and, for each category, discuss its requirements, capabilities and cost. The contribution lies in showing when eager replication is feasible and in spelling out the different aspects a database replication protocol must account for.","PeriodicalId":355208,"journal":{"name":"Proceedings 19th IEEE Symposium on Reliable Distributed Systems SRDS-2000","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-10-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122889772","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A pragmatic implementation of e-transactions","authors":"Svend Frølund, R. Guerraoui","doi":"10.1109/RELDI.2000.885406","DOIUrl":"https://doi.org/10.1109/RELDI.2000.885406","url":null,"abstract":"Three-tier applications have nice properties, which make them scalable and manageable: clients are thin and servers are stateless. However, it is challenging to implement or even define end-to-end reliability for such applications. Furthermore, it is especially hard to make these applications reliable without violating their nice properties. In previous work, we identified e-transactions as a desirable and practical end-to-end reliability guarantee for three-tier applications (S. Frolund and R. Guerraoui, 1999). Essentially, an e-transaction guarantees that the server-side transactional side-effect happens exactly once, and that the client receives the result of the server-side computation. Thus, e-transactions mask server and database failures relative to the client. We present a pragmatic implementation of e-transactions that maintains the nice properties of three-tier applications in the special, but very common case of a single back-end database.","PeriodicalId":355208,"journal":{"name":"Proceedings 19th IEEE Symposium on Reliable Distributed Systems SRDS-2000","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-10-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134067820","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Optimistic Virtual Synchrony","authors":"Jeremy B. Sussman, I. Keidar, K. Marzullo","doi":"10.1109/RELDI.2000.885391","DOIUrl":"https://doi.org/10.1109/RELDI.2000.885391","url":null,"abstract":"We present Optimistic Virtual Synchrony (OVS), a new form of group communication which provides the same capabilities as Virtual Synchrony with better performance. It does so by allowing applications to send messages during periods in which services implementing Virtual Synchrony block. OVS also allows applications to determine the policy as to when messages sent optimistically should be delivered and when they should be discarded. Thus, OVS gives applications fine grain control over the specific semantics they require, and does not impose costs for enforcing any semantics that they do not require. At the same time, OVS provides a single easy-to-use interface for all applications.","PeriodicalId":355208,"journal":{"name":"Proceedings 19th IEEE Symposium on Reliable Distributed Systems SRDS-2000","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-10-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130805066","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Detection of livelocks in communication protocols by means of a polygon time structure","authors":"J. Brzeziński, M. Sajkowski","doi":"10.1109/RELDI.2000.885396","DOIUrl":"https://doi.org/10.1109/RELDI.2000.885396","url":null,"abstract":"As has been shown, the polygon time structure overcomes the main limitations of the interval time structure, and allows one to verify communication protocols, in which the explicit concurrency of both competing and supporting events is considered. The authors apply the polygon time structure to the verification of dynamic properties (like livelocks) of a simple protocol. As a result, they show that an application of the previously used interval time structure may lead to the evaluation of a protocol as incorrect, while it is livelock free.","PeriodicalId":355208,"journal":{"name":"Proceedings 19th IEEE Symposium on Reliable Distributed Systems SRDS-2000","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-10-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128150389","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Issues insufficiently resolved in Century 20 in the fault-tolerant distributed computing field","authors":"Kwang-rok Kim","doi":"10.1109/RELDI.2000.885398","DOIUrl":"https://doi.org/10.1109/RELDI.2000.885398","url":null,"abstract":"As the 21st Century has just opened up, it is a fitting time to reflect on the evolution of the fault-tolerant distributed computing technology that occurred in the last century. The author's view of that evolution is sketched in this paper, with emphasis on the major issues that were insufficiently resolved in the 20th Century. Such issues are naturally among what the author believes to be the prime subjects that need to be addressed in this decade by the research community. A substantial part of this paper deals with the issues that need to be resolved to advance the real-time fault-tolerant distributed computing branch into a mature practicing field.","PeriodicalId":355208,"journal":{"name":"Proceedings 19th IEEE Symposium on Reliable Distributed Systems SRDS-2000","volume":"58 3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-10-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132186762","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Deterministic scheduling for transactional multithreaded replicas","authors":"R. Jiménez-Peris, M. Patiño-Martínez, S. Arévalo","doi":"10.1109/RELDI.2000.885404","DOIUrl":"https://doi.org/10.1109/RELDI.2000.885404","url":null,"abstract":"One way to implement a fault-tolerant service is by replicating it at sites that fail independently. One of the replication techniques is active replication where each request is executed by all the replicas. Thus, the effects of failures can be completely masked, resulting in an increase of service availability. In order to preserve consistency among replicas, replicas must exhibit a deterministic behavior, which has traditionally been achieved by restricting replicas to being single-threaded. However, this approach cannot be applied in some setups like transactional systems, where it is not admissible to process transactions sequentially. The authors present a deterministic scheduling algorithm for multithreaded replicas in a transactional framework. To ensure replica determinism, requests to replicated servers are submitted by means of reliable and totally ordered multicast. Internally, a deterministic scheduler ensures that all threads are scheduled in the same way at all replicas which guarantees replica consistency.","PeriodicalId":355208,"journal":{"name":"Proceedings 19th IEEE Symposium on Reliable Distributed Systems SRDS-2000","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-10-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114693274","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Semantically reliable multicast protocols","authors":"J. Pereira, R. Oliveira, L. Rodrigues","doi":"10.1109/RELDI.2000.885393","DOIUrl":"https://doi.org/10.1109/RELDI.2000.885393","url":null,"abstract":"Reliable multicast protocols can strongly simplify the design of distributed applications. However it is hard to sustain a high multicast throughput when groups are large and heterogeneous. In an attempt to overcome this limitation, previous work has focused on weakening reliability properties. The authors introduce a novel reliability model that exploits semantic knowledge to decide in which specific conditions messages can be purged without compromising application correctness. This model is based on the concept of message obsolescence: a message becomes obsolete when its content or purpose is overwritten by a subsequent message. We show that message obsolescence can be expressed in a generic way and can be used to configure the system to achieve higher multicast throughput.","PeriodicalId":355208,"journal":{"name":"Proceedings 19th IEEE Symposium on Reliable Distributed Systems SRDS-2000","volume":"81 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-10-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123174355","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}