Difference: P2P (1 vs. 9)

Revision 92009-05-04 - KaterinaDoka

Line: 1 to 1
 
META TOPICPARENT name="WebHome"

P2P Networks and Distributed Systems

Line: 17 to 17
 

PASS It ON (PASSION) Project

In 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 Project

Brown 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.
 
META FILEATTACHMENT attr="h" autoattached="1" comment="" date="1204801681" name="chazapis-icpp05.pdf" path="chazapis-icpp05.pdf" size="362824" user="Main.AntonyChazapis" version="1"
META FILEATTACHMENT attr="h" autoattached="1" comment="" date="1204801662" name="zissimos-pci2007.pdf" path="zissimos-pci2007.pdf" size="211231" user="Main.AntonyChazapis" version="1"
META FILEATTACHMENT attr="h" autoattached="1" comment="" date="1204801596" name="chazapis-pci2005.pdf" path="chazapis-pci2005.pdf" size="322104" user="Main.AntonyChazapis" version="1"

Revision 82008-07-15 - IoannisKonstantinou

Line: 1 to 1
 
META TOPICPARENT name="WebHome"

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) Project

In 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.
 
META FILEATTACHMENT attr="h" autoattached="1" comment="" date="1204801681" name="chazapis-icpp05.pdf" path="chazapis-icpp05.pdf" size="362824" user="Main.AntonyChazapis" version="1"
META FILEATTACHMENT attr="h" autoattached="1" comment="" date="1204801662" name="zissimos-pci2007.pdf" path="zissimos-pci2007.pdf" size="211231" user="Main.AntonyChazapis" version="1"
META FILEATTACHMENT attr="h" autoattached="1" comment="" date="1204801596" name="chazapis-pci2005.pdf" path="chazapis-pci2005.pdf" size="322104" user="Main.AntonyChazapis" version="1"

Revision 72008-07-11 - DimitrisTsoumakos

Line: 1 to 1
 
META TOPICPARENT name="WebHome"

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).

Changed:
<
<

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.
>
>

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.
 
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 Project

This is a system where multidimensional data organized in concept hierarchies are stored, indexed and queried in a fully distributed environment.

 
META FILEATTACHMENT attr="h" autoattached="1" comment="" date="1204801681" name="chazapis-icpp05.pdf" path="chazapis-icpp05.pdf" size="362824" user="Main.AntonyChazapis" version="1"
META FILEATTACHMENT attr="h" autoattached="1" comment="" date="1204801662" name="zissimos-pci2007.pdf" path="zissimos-pci2007.pdf" size="211231" user="Main.AntonyChazapis" version="1"

Revision 62008-03-13 - GeorgiosTsoukalas

Line: 1 to 1
 
META TOPICPARENT name="WebHome"

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).

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:
>
>

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.

 
META FILEATTACHMENT attr="h" autoattached="1" comment="" date="1204801681" name="chazapis-icpp05.pdf" path="chazapis-icpp05.pdf" size="362824" user="Main.AntonyChazapis" version="1"
META FILEATTACHMENT attr="h" autoattached="1" comment="" date="1204801662" name="zissimos-pci2007.pdf" path="zissimos-pci2007.pdf" size="211231" user="Main.AntonyChazapis" version="1"
META FILEATTACHMENT attr="h" autoattached="1" comment="" date="1204801596" name="chazapis-pci2005.pdf" path="chazapis-pci2005.pdf" size="322104" user="Main.AntonyChazapis" version="1"

Revision 52008-03-06 - GiorgosVerigakis

Line: 1 to 1
 
META TOPICPARENT name="WebHome"

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).

Changed:
<
<

XOROS

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

  • A. Chazapis and N. Koziris, "XOROS: A mutable Distributed Hash Table," in Proceedings of the 5th International Workshop on Databases, Information Systems and Peer-to-Peer Computing (DBISP2P 2007), Vienna, Austria, September 2007 [pdf]
  • A. Zissimos, K. Doka, A. Chazapis and N. Koziris, "GridTorrent: Optimizing data transfers in the Grid with collaborative sharing," in Proceedings of the 11th Panhellenic Conference on Informatics (PCI2007), Patras, Greece, May 2007 [pdf]
  • A. Chazapis, A. Zissimos, N. Koziris and P. Tsanakas, "Replica management services on the Grid: Evolving from a centralized design to a fully distributed, scalable and fault-tolerant peer-to-peer infrastructure," in Grid Technologies: Emerging from Distributed Architectures to Virtual Organizations, edited by M. P. Bekakos and G. A. Gravvanis, pp. 107-138, 2006, WIT Press, ISBN: 1-84564-055-1 [link]
  • A. Chazapis, A. Zissimos and N. Koziris, "A peer-to-peer replica management service for high-throughput Grids," in Proceedings of the 2005 International Conference on Parallel Processing (ICPP05), Oslo, Norway, June 2005 [pdf]
  • A. Chazapis and N. Koziris, "Storing and locating mutable data in structured P2P overlay networks," in Proceedings of the 10th Panhellenic Conference on Informatics (PCI2005), Volos, Greece, November 2005 [pdf]
>
>
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.
 
META FILEATTACHMENT attr="h" autoattached="1" comment="" date="1204801681" name="chazapis-icpp05.pdf" path="chazapis-icpp05.pdf" size="362824" user="Main.AntonyChazapis" version="1"
META FILEATTACHMENT attr="h" autoattached="1" comment="" date="1204801662" name="zissimos-pci2007.pdf" path="zissimos-pci2007.pdf" size="211231" user="Main.AntonyChazapis" version="1"

Revision 42008-03-06 - ArisSotiropoulos

Line: 1 to 1
 
META TOPICPARENT name="WebHome"
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
 
META TOPICPARENT name="WebHome"

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:
>
>
  • A. Chazapis and N. Koziris, "XOROS: A mutable Distributed Hash Table," in Proceedings of the 5th International Workshop on Databases, Information Systems and Peer-to-Peer Computing (DBISP2P 2007), Vienna, Austria, September 2007 [pdf]
  • A. Zissimos, K. Doka, A. Chazapis and N. Koziris, "GridTorrent: Optimizing data transfers in the Grid with collaborative sharing," in Proceedings of the 11th Panhellenic Conference on Informatics (PCI2007), Patras, Greece, May 2007 [pdf]
  • A. Chazapis, A. Zissimos, N. Koziris and P. Tsanakas, "Replica management services on the Grid: Evolving from a centralized design to a fully distributed, scalable and fault-tolerant peer-to-peer infrastructure," in Grid Technologies: Emerging from Distributed Architectures to Virtual Organizations, edited by M. P. Bekakos and G. A. Gravvanis, pp. 107-138, 2006, WIT Press, ISBN: 1-84564-055-1 [link]
  • A. Chazapis, A. Zissimos and N. Koziris, "A peer-to-peer replica management service for high-throughput Grids," in Proceedings of the 2005 International Conference on Parallel Processing (ICPP05), Oslo, Norway, June 2005 [pdf]
  • A. Chazapis and N. Koziris, "Storing and locating mutable data in structured P2P overlay networks," in Proceedings of the 10th Panhellenic Conference on Informatics (PCI2005), Volos, Greece, November 2005 [pdf]

META FILEATTACHMENT attr="h" autoattached="1" comment="" date="1204801681" name="chazapis-icpp05.pdf" path="chazapis-icpp05.pdf" size="362824" user="Main.AntonyChazapis" version="1"
META FILEATTACHMENT attr="h" autoattached="1" comment="" date="1204801662" name="zissimos-pci2007.pdf" path="zissimos-pci2007.pdf" size="211231" user="Main.AntonyChazapis" version="1"
META FILEATTACHMENT attr="h" autoattached="1" comment="" date="1204801596" name="chazapis-pci2005.pdf" path="chazapis-pci2005.pdf" size="322104" user="Main.AntonyChazapis" version="1"
META FILEATTACHMENT attr="h" autoattached="1" comment="" date="1204801710" name="chazapis-dbisp2p2007.pdf" path="chazapis-dbisp2p2007.pdf" size="111418" user="Main.AntonyChazapis" version="1"

Revision 22008-03-04 - AntonisZisimos

Line: 1 to 1
 
META TOPICPARENT name="WebHome"

P2P Networks

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. 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:
>
>
META TOPICPARENT name="WebHome"

P2P Networks

XOROS

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

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

No permission to view TWiki.WebBottomBar