Transactions and Concurrency Control for Peer-to-Peer-Wikis: An Evaluation

Supporting atomic transactions and concurrency control in peer-to-peer networks is difficult because nodes may leave, crash or join at any time. We propose a transaction processing scheme for peer-to-peer networks that ensures consistency and durability by constructing the overlay from replicated state machines. Our scheme supports a mixture of pessimistic, hybrid optimistic and multiversioning concurrency control techniques to minimize the impact of replication on latency and to maximize the speed of read operations.