Difference: P2P (2 vs. 3)
Revision 32008-03-06 - AntonyChazapis
| Line: 1 to 1 | |||||||||
|---|---|---|---|---|---|---|---|---|---|
P2P Networks | |||||||||
| Added: | |||||||||
| > > | Peer-to-peer networks are distributed systems, where all participating entities both provide and utilize services to/from each other. Our research in P2P covers both unstructured and structured architectures (Distributed Hash Tables - DHTs). | ||||||||
XOROS | |||||||||
| Changed: | |||||||||
| < < | 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. | ||||||||
| > > | 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. 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.gr | ||||||||
Publications | |||||||||
| Deleted: | |||||||||
| < < | |||||||||
| \ No newline at end of file | |||||||||
| Added: | |||||||||
| > > |
| ||||||||
View topic | History: r9 < r8 < r7 < r6 | More topic actions...
