Optimistic voting for managing replicated data

DOI10.1007/BF02960779MaRDI QIDQ1433986zbMATH OpenFDO

Authors Huaizhong Lin, Chun Chen

Publication date 1 July 2004

Published in Journal of Computer Science and Technology (Search for Journal in Brave)

zbMATH Keywords

epidemic modelweakly connected environment

Mathematics Subject Classification ID

Distributed systems (68M14) Network protocols (68M12)

Recommendations

• Computational Science – ICCS 2005
• An Optimistic Concurrency Control Protocol for Replicated Databases
• An optimal voting scheme for minimizing the overall communication cost in replicated data management
• scientific article; zbMATH DE number 1950693
• Agreeing to Agree: Conflict Resolution for Optimistically Replicated Data

Cites work

• Decentralized replicated-object protocols

Cited in

(7)

• Consistency management in Deno
• scientific article; zbMATH DE number 1950672 (Why is no real title available?)
• An Optimistic Concurrency Control Protocol for Replicated Databases
• An optimal voting scheme for minimizing the overall communication cost in replicated data management
• A weighted voting algorithm for replicated directories
• Computational Science – ICCS 2005
• scientific article; zbMATH DE number 1950693 (Why is no real title available?)

This page was built for publication: Optimistic voting for managing replicated data

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1433986)