
| Line: 1 to 1 | ||||||||
|---|---|---|---|---|---|---|---|---|
XOROS | ||||||||
| Line: 8 to 8 | ||||||||
Publications | ||||||||
| Changed: | ||||||||
| < < |
| |||||||
| > > |
| |||||||
| ||||||||
| Changed: | ||||||||
| < < |
| |||||||
| > > |
| |||||||
| \ No newline at end of file | ||||||||
| Line: 1 to 1 | ||||||||
|---|---|---|---|---|---|---|---|---|
| Added: | ||||||||
| > > |
XOROSData 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. To this end, we have designed and implemented 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. More info at: http://xoros.cslab.ece.ntua.grPublications
| |||||||