TWiki> CSLab Web>P2P (revision 1)EditAttach

P2P Networks


Data redundancy in DHTs is commonly accomplished through automatic replication of values to a set of close participating nodes. Such copies, once written, should not be modified, as there is no inherent DHT function that can operate on a dynamic set of mutable replicas. In this paper, we present XOROS β a system based on the Kademlia routing scheme, that addresses the problem by implementing a Byzantine-tolerant protocol for serializable data updates directly at the peer-to-peer level. Based upon related works that study distributed replica synchronization, mutual exclusion and communication in the presence of Byzantine behavior, we propose a unified DHT-based algorithm, that ties corresponding practices together in order to consistently propagate changes to all primary replicas of any key-value pair stored in the network. A multitude of applications may benefit from the resulting distributed read/write storage substrate as it retains all the advanced features of DHTs and is backwards compatible with existing put/get semantics.


Edit | Attach | Watch | Print version | History: r9 | r4 < r3 < r2 < r1 | Backlinks | Raw View | Raw edit | More topic actions...
Topic revision: r1 - 2008-03-03 - GiorgosVerigakis

No permission to view TWiki.WebTopBar

This site is powered by the TWiki collaboration platform Powered by Perl

No permission to view TWiki.WebBottomBar