HAND, S., AND ROSCOE, T. Mnemosyne: Peer-to-peer steganographic storage. In Proc. of the 1st IPTPS (Mar. 2001).  Home/Search   Document Details and Download   Summary   Related Articles   Check

....use coding to recover lost data. In the context of peer to peer systems, Weatherspoon and Kubiatowicz presented a nice argument for using coding instead of replication [40] Peer to peer archival systems in particular have made use of coding or secret sharing schemes to achieve high robustness [11, 5, 26, 22]. Most systems use Reed Solomon or Tornado erasure codes, whereas Mnemosyne [22] and DHash use IDA [31] 6.4 Replica Synchronization Like coding, e#cient synchronization of replicas is also a well studied topic. Rsync [39] is a widely used tool for file synchronization that exchanges just the ....

.... Kubiatowicz presented a nice argument for using coding instead of replication [40] Peer to peer archival systems in particular have made use of coding or secret sharing schemes to achieve high robustness [11, 5, 26, 22] Most systems use Reed Solomon or Tornado erasure codes, whereas Mnemosyne [22] and DHash use IDA [31] 6.4 Replica Synchronization Like coding, e#cient synchronization of replicas is also a well studied topic. Rsync [39] is a widely used tool for file synchronization that exchanges just the delta between two replicas. The use of Merkle hash [29] trees for e#cient ....

Hand, S., and Roscoe, T. Mnemosyne: Peer-to-peer steganographic storage. In 1st International Workshop on Peer-to-Peer Systems (IPTPS'02) (Mar. 2001). http: //www.cs.rice.edu/Conferences/IPTPS02/. 61

....on top of these P2P systems, validating them as novel application infrastructures. Several systems have application level multicast: CAN MC [21] CAN) Scribe [22] Pastry) and Bayeux [5] Tapestry) In addition, several decentralized file systems have been proposed: CFS [23] Chord) Mnemosyne [24] (Chord, Tapestry) OceanStore [4] Tapestry) and PAST [25] Pastry) Structured P2P overlays also support novel applications (e.g. attack resistant networks [26] network indirection layers [27] and similarity searching [28] III. TAPESTRY ALGORITHMS This section details Tapestry s ....

....available storage utility deployed on the PlanetLab testbed. OceanStore servers use Tapestry to disseminate encoded file blocks efficiently, and clients can quickly locate and retrieve nearby file blocks by their ID, all despite server and network failures. Other applications include Mnemosyne [24], a stegnographic file system, Bayeux [5] an efficient self organizing application level multicast system, and SpamWatch [28] a decentralized spam filtering system utilizing a similarity search engine implemented on Tapestry. VII. CONCLUSION We described Tapestry, an overlay routing network ....

Steven Hand and Timothy Roscoe, "Mnemosyne: Peer-to-peer steganographic storage," in Proceedings of IPTPS, Mar 2002.

....For example, the RAFDA project is investigating partitioning Java applications into components capable of being executed on different virtual machines. Recently a new generation of storage architectures has emerged based on Peer To Peer (P2P) technologies. These include OceanStore [22] Mnemosyne [23], PAST [24] Pastry [25] FreeHaven [26] and Freenet [27] and all provide some degree of abstraction over the location of data and utilise storage available in a network of peers. Most of the above are based on a deterministic routing algorithm by Plaxton [28] which permits the discovery of ....

S. Hand and T. Roscoe, Mnemosyne: Peer-to-Peer Steganographic Storage. In Proc. 1st International Workshop on Peer-to-Peer Systems, 2002

....the zone containing the key. The main features of CAN are: Purely decentralized. Scalable (nodes maintain only a small part of the state of the system, independent of the number of nodes in the system) Fault tolerant (nodes can route around failures) Figure 7. CAN: a) Example 2 d [0,1]X[0,1] coordinate space partitioned between 5 CAN nodes; b) Example 2 d space after node F joins. CAN uses a virtual d dimensional Cartesian coordinate space (see Figure 7 to store (key K, value V) pairs as follows: First, K is deterministically mapped onto a point P in the coordinate space. ....

....zone containing the key. The main features of CAN are: Purely decentralized. Scalable (nodes maintain only a small part of the state of the system, independent of the number of nodes in the system) Fault tolerant (nodes can route around failures) Figure 7. CAN: a) Example 2 d [0,1]X[0,1] coordinate space partitioned between 5 CAN nodes; b) Example 2 d space after node F joins. CAN uses a virtual d dimensional Cartesian coordinate space (see Figure 7 to store (key K, value V) pairs as follows: First, K is deterministically mapped onto a point P in the coordinate space. The (K, ....

S.Hand and T.Roscoe. Mnemosyne: Peer-to-peer steganographic storage. In Proceedings of the 1st International Workshop on Peer-to-Peer Systems (IPTPS '02), MIT Faculty Club, Cambridge, MA, USA, March 2002.

....[3] and Mojo Nation [5] They were not designed for security or locality. Several P2P file sharing systems have been designed to enable anonymous storage and censorshipresistant publishing. This set includes the Eternity Ser vice [6] Freenet [12] FreeHaven [16] Publius [22] and Mnemosyne [20]. They each provide various guarantees of privacy and sometimes also data integrity. These systems all assume that their data is immutable, or at most modifiable by a single author, and even then only rarely. Consistency and time travel are therefore not meaningful topics. Locality and efficiency ....

S. Hand and T. Roscoe. Mnemosyne: Peer-to-peer steganographic storage. In Proc. of IPTPS, March 2002.

No context found.

Steven Hand and Timothy Roscoe. Mnemosyne: Peerto -Peer Steganographic Storage. In Proceedings of the 1st International Workshop on Peer-to-Peer Systems, Boston, MA, March 2002.

No context found.

Steven Hand and Timothy Roscoe. Mnemosyne: Peer-to-Peer Steganographic Storage. In Proceedings of the 1st International Workshop on Peer-to-Peer Systems, March 2002.

No context found.

Steven Hand and Timothy Roscoe. Mnemosyne: peer-to-peer steganographic storage. In Proceedings of the 1st International Workshop on Peer-to-Peer Systems, March 2002.

No context found.

S. Hand and T. Roscoe. Mnemosyne: Peer-to-Peer Steganographic Storage. In Proc. of the 1st International Workshop on Peer-to-Peer Systems, March 2002.

....Distributed Hash Tables (DHTs) and Decentralized Object Location and Routing networks (DOLRs) We argue that benchmarks are essential in understanding how overlays will behave in a particular application. Our work is driven partly by our experience implementing the OceanStore [6] and Mnemosyne [4] systems. We want to benchmark structured peer to peer overlays for three reasons. The first is naturally for pure performance comparisons. However, in this paper we are not interested in declaring one overlay better or worse than another by measuring them on the same scale. The real value of ....

S. Hand and T. Roscoe. Mnemosyne: Peer-to-peer steganographic storage. In Proc. of IPTPS, 2002.

....Distributed Hash Tables (DHTs) and Decentralized Object Location and Routing networks (DOLRs) We argue that benchmarks are essential in understanding how overlays will behave in a particular application. Our work is driven partly by our experience implementing the OceanStore [6] and Mnemosyne [4] systems. We want to benchmark structured peer to peer overlays for three reasons. The rst is naturally for pure performance comparisons. However, in this paper we are not interested in declaring one overlay better or worse than another by measuring them on the same scale. The real value of ....

S. Hand and T. Roscoe. Mnemosyne: Peer-to-peer steganographic storage. In Proc. of IPTPS, 2002.

....Distributed Hash Tables (DHTs) and Decentralized Object Location and Routing networks (DOLRs) We argue that benchmarks are essential in understanding how overlays will behave in a particular application. Our work is driven partly by our experience implementing the OceanStore [6] and Mnemosyne [4] systems. We want to benchmark structured peer to peer overlays for three reasons. The first is naturally for pure performance comparisons. However, in this paper we are not interested in declaring one overlay better or worse than another by measuring them on the same scale. The real value of ....

S. Hand and T. Roscoe. Mnemosyne: Peer-to-peer steganographic storage. In Proc. of IPTPS, 2002.

No context found.

HAND, S., AND ROSCOE, T. Mnemosyne: Peer-to-peer steganographic storage. In Proc. of the 1st IPTPS (Mar. 2001).

No context found.

HAND, S., AND ROSCOE, T. Mnemosyne: Peer-to-Peer Steganographic Storage. In Proceedings of the IPTPS 2002.

No context found.

Steven Hand and Timothy Roscoe. Mnemosyne: Peer-to-Peer Steganographic Storage. In Proceedings of the 1st International Workshop on Peerto -Peer Systems (IPTPS '02), Boston, MA, USA, March 2002.

No context found.

Hand, S., and Roscoe, T. Mnemosyne: Peer-to-peer steganographic storage. In Proc. of IPTPS (Mar 2002), pp. 130--140.

No context found.

S. Hand and T. Roscoe. Mnemosyne: Peer-to-peer steganographic storage. In Proceedings of the 1st International Workshop on Peer-to-Peer Systems (IPTPS '02), MIT Faculty Club, Cambridge, MA, USA, March 2002.

No context found.

Hand, S., and Roscoe, T. Mnemosyne: Peer-to-peer steganographic storage. In Proc. of IPTPS (Mar 2002), pp. 130--140.

No context found.

HAND, S., AND ROSCOE, T. Mnemosyne: Peer-to-Peer Steganographic Storage. In Proceedings of the IPTPS 2002.

No context found.

S. Hand and T. Roscoe. Mnemosyne: Peer-to-Peer Steganographic Storage. In Proceedings of the 1st International Workshop on Peer-to-Peer Systems, March 2002.

No context found.

S. Hand and T. Roscoe, "Mnemosyne: Peer-to-peer steganographic storage," in Proc. IPTPS, Cambridge, CA, Mar. 2002, pp. 130--140.

No context found.

HAND, S., AND ROSCOE, T. Mnemosyne: Peer-to-peer steganographic storage. In Proc. of the 1st IPTPS (Mar. 2001).

No context found.

S. Hand and T. Roscoe, "Mnemosyne: Peer-to-peer steganographic storage," in Proceedings of IPTPS, Cambridge, CA, Mar 2002, pp. 130--140.

No context found.

Steven Hand and Timothy Roscoe. Mnemosyne: Peer-to-Peer Steganographic Storage. In Proceedings of the 1st International Workshop on Peerto -Peer Systems (IPTPS '02), Boston, MA, USA, March 2002.

First 50 documents

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC