Difference: P2P (1 vs. 9)
Revision 92009-05-04 - KaterinaDoka
| Line: 1 to 1 | ||||||||
|---|---|---|---|---|---|---|---|---|
P2P Networks and Distributed Systems | ||||||||
| Line: 17 to 17 | ||||||||
PASS It ON (PASSION) ProjectIn this project, we describe a distributed algorithm for adaptive load balancing in systems that support range queries. We address the issue of uneven load distribution among the peers that occurs when nodes index items of varying popularity. | ||||||||
| Added: | ||||||||
| > > | Brown Dwarf ProjectBrown Dwarf is a distributed system designed to efficiently store, query and update multidimensional data over a Peer-to-Peer overlay. It manages to answer both point and aggregate queries on-line through cooperating nodes that hold parts of a fully or partially materialized data cube. Updates are also performed on-line. | |||||||
| ||||||||
Revision 82008-07-15 - IoannisKonstantinou
| Line: 1 to 1 | ||||||||
|---|---|---|---|---|---|---|---|---|
P2P Networks and Distributed Systems | ||||||||
| Line: 14 to 14 | ||||||||
| This is a system where multidimensional data organized in concept hierarchies are stored, indexed and queried in a fully distributed environment. | ||||||||
| Added: | ||||||||
| > > | PASS It ON (PASSION) ProjectIn this project, we describe a distributed algorithm for adaptive load balancing in systems that support range queries. We address the issue of uneven load distribution among the peers that occurs when nodes index items of varying popularity. | |||||||
| ||||||||
Revision 72008-07-11 - DimitrisTsoumakos
| Line: 1 to 1 | ||||||||
|---|---|---|---|---|---|---|---|---|
P2P Networks and Distributed SystemsPeer-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). | ||||||||
| Changed: | ||||||||
| < < | XOROSXOR Object Store (or XOROS for short) is a structured peer-to-peer system (Distributed Hash Table) designed with data updates in mind. Most current DHT implementations require that data values, once written, should not be modified. XOROS addresses this issue, by incorporating related distributed mutex and Byzantine-tolerant communication protocols at the peer-to-peer level. | |||||||
| > > | XOROSXOR Object Store (or XOROS for short) is a structured peer-to-peer system (Distributed Hash Table) designed with data updates in mind. Most current DHT implementations require that data values, once written, should not be modified. XOROS addresses this issue, by incorporating related distributed mutex and Byzantine-tolerant communication protocols at the peer-to-peer level. | |||||||
| Changed: | ||||||||
| < < | Grid4All | |||||||
| > > | Grid4All | |||||||
We are developing a peer-to-peer filesystem for Grid4all , an EU funded research project that proposes a democratic grid, based on peer-to-peer technology. | ||||||||
| Added: | ||||||||
| > > | HiPPIS ProjectThis is a system where multidimensional data organized in concept hierarchies are stored, indexed and queried in a fully distributed environment. | |||||||
| ||||||||
Revision 62008-03-13 - GeorgiosTsoukalas
| Line: 1 to 1 | ||||||||
|---|---|---|---|---|---|---|---|---|
P2P Networks and Distributed SystemsPeer-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). | ||||||||
| Added: | ||||||||
| > > | XOROS | |||||||
| XOR Object Store (or XOROS for short) is a structured peer-to-peer system (Distributed Hash Table) designed with data updates in mind. Most current DHT implementations require that data values, once written, should not be modified. XOROS addresses this issue, by incorporating related distributed mutex and Byzantine-tolerant communication protocols at the peer-to-peer level. | ||||||||
| Added: | ||||||||
| > > | Grid4AllWe are developing a peer-to-peer filesystem for Grid4all, an EU funded research project that proposes a democratic grid, based on peer-to-peer technology. | |||||||
| ||||||||
Revision 52008-03-06 - GiorgosVerigakis
| Line: 1 to 1 | ||||||||
|---|---|---|---|---|---|---|---|---|
P2P Networks and Distributed SystemsPeer-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). | ||||||||
| Changed: | ||||||||
| < < | 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.gr
Publications
| |||||||
| > > | XOR Object Store (or XOROS for short) is a structured peer-to-peer system (Distributed Hash Table) designed with data updates in mind. Most current DHT implementations require that data values, once written, should not be modified. XOROS addresses this issue, by incorporating related distributed mutex and Byzantine-tolerant communication protocols at the peer-to-peer level. | |||||||
| ||||||||
Revision 42008-03-06 - ArisSotiropoulos
| Line: 1 to 1 | ||||||||
|---|---|---|---|---|---|---|---|---|
| ||||||||
| Changed: | ||||||||
| < < | P2P Networks | |||||||
| > > | P2P Networks and Distributed Systems | |||||||
| 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). | ||||||||
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: | |||||||||
| > > |
| ||||||||
Revision 22008-03-04 - AntonisZisimos
| Line: 1 to 1 | ||||||||
|---|---|---|---|---|---|---|---|---|
P2P NetworksXOROS | ||||||||
| 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. 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. | |||||||
Publications | ||||||||
| Deleted: | ||||||||
| < < | ||||||||
| \ No newline at end of file | ||||||||
| Added: | ||||||||
| > > | ||||||||
| \ No newline at end of file | ||||||||
Revision 12008-03-03 - GiorgosVerigakis
| Line: 1 to 1 | ||||||||
|---|---|---|---|---|---|---|---|---|
| Added: | ||||||||
| > > |
P2P NetworksXOROSData 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.Publications | |||||||
View topic | History: r9 < r8 < r7 < r6 | More topic actions...
