We describe a recovery protocol which boosts availability, fault tolerance and performance by enabling failed network nodes to resume an active role immediately after they start recovering. The protocol is designed to work in tandem with middleware-based eager update-everywhere strategies and related group communication systems. The latter provide view synchrony, i.e., knowledge about currently reachable nodes and about the status of messages delivered by faulty and alive nodes. That enables a fast replay of missed updates which defines dynamic database recovery partition. Thus, speeding up the recovery of failed nodes which, together with the rest of the network, may seamlessly continue to process transactions even before their recovery has completed. We specify the protocol in terms of the procedures executed with every message and event of interest and outline a correctness proof. © Springer-Verlag Berlin Heidelberg 2006.
CITATION STYLE
Armendáriz-Iñigo, J. E., Muñoz-Escoí, F. D., Decker, H., Juárez-Rodríguez, J. R., & De González Mendívil, J. R. (2006). A protocol for reconciling recovery and high-availability in replicated databases. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4263 LNCS, pp. 634–644). Springer Verlag. https://doi.org/10.1007/11902140_67
Mendeley helps you to discover research relevant for your work.