P. Druschel and A. Rowstron. Past: Persistent and anonymous storage in a peer-to-peer networking environment. In Proceedings of the 8th IEEE Workshop on Hot Topics in Operating Systems, 2001.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....to obtain (pull) the information within just two hops. Keywords: Distributed computing, peer to peer computing, distributed information sharing, peer communities 1. Introduction Current peer to peer (P2P) systems are often targeted for information sharing [1] 2] file storage [1] 3] 4] [5], searching [6] 7] and indexing [8] 9] by using an overlay network. The ability of P2P systems to harness vast amounts of storage from a scalable collection of peers and its emphasis on de centralization and lack of a central authority seems to empower everyday home computer users by allowing ....

P. Druschel and A. Rowstron, "Past: Persistent and anonymous storage in a peer-to-peer networking environment," in Proc. the 8th IEEE Work. Hot Topics in Operating Systems (HotOS), Germany, May 2001, pp. 65--70.

....key. The easiest way to implement a content addressable network is to maintain a directory of key assignments; unfortunately, maintaining this directory consistently in a distributed environment is too resource intensive to scale. Many P2P routing protocols like CAN [10] Chord [12] Pastry [3], and Tapestry [14] induce a connected overlay network across the Internet, with a rich structure that enables efficient key lookups. The typical approach to the design of such overlays is roughly as follows. First, an ideal overlay structure is specified, under which key lookups are ....

....allows a node to join or leave the network, properly rearranging the ideal overlay to account for their presence or absence. One then can consider the issue of fault tolerance e.g. showing that the ideal overlay can still route efficiently even after the failure of some fraction of the nodes [3, 4, 12]. The Problem. Unfortunately, the approach described above ignores the fact that a P2P network is a continuously evolving system. The join protocol may work well if joins happen sequentially, but what if many joins happen concurrently The ideal overlay may tolerate faults, but once those faults ....

[Article contains additional citation context not shown here]

DRUSCHEL, P., AND ROWSTRON, A. Past: Persistent and anonymous storage in a peer-to-peer networking environment. In Proceedings of the 8th IEEE Workshop on Hot Topics in Operating Systems (HotOS-VIII) (2001), pp. 65--70.

....that queries never travel further in network distance than the node where the key is stored. The advantage of Chord is that it is substantially less complicated and handles concurrent node joins and failures well. The Chord protocol is also similar to Pastry, the location algorithm used in PAST [8]. However, Pastry is a prefix based routing protocol, and di#ers in other details from Chord. CAN uses a d dimensional Cartesian coordinate space (for some fixed d) to implement a distributed hash table that maps keys onto values [20] Each node maintains O(d) state, and the lookup cost is O(dN ....

Druschel, P., and Rowstron, A. Past: Persistent and anonymous storage in a peer-to-peer networking environment. In Proceedings of the 8th IEEE Workshop on Hot Topics in Operating Systems (HotOS 2001.

....routing is that queries are forwarded from node to node until they reach their destinations. The importance of the location independent routing problem has spawned a host of proposals, many of them in the context of data sharing infrastructures such as OceanStore [13] FarSite [3] CFS [11] PAST [8]. To permit locality optimizations, it is important that the routing process use as few network hops as possible and that these hops should be as short as possible. The set of properties that a routing infrastructure should exhibit is small but significant: 1. Deterministic Location: Objects ....

DRUSCHEL, P., AND ROWSTRON, A. Past: Persistent and anonymous storage in a peer-to-peer networking environment. Submission to ACM HOTOS VIII, 2001.

....routing is that queries are forwarded from node to node until they reach their destinations. The importance of the location independent routing problem has spawned a host of proposals, many of them in the context of data sharing infrastructures such as OceanStore [13] FarSite [3] CFS [11] PAST [8]. To permit locality optimizations, it is important that the routing process use as few network hops as possible and that these hops should be as short as possible. The set of properties that a routing infrastructure should exhibit is small but significant: 1. Deterministic Location: Objects ....

DRUSCHEL, P., AND ROWSTRON, A. Past: Persistent and anonymous storage in a peer-to-peer networking environment. Submission to ACM HOTOS VIII, 2001.

....few years. To overcome the scaling problems with unstructured P2P systems such as Gnutella where dataplacement and overlay network construction are essentially random, a number of groups have proposed structured P2P designs. These proposals support a Distributed Hash Table (DHT) functionality [11, 14, 12, 3, 18]. While there are significant implementation di#erences between these DHT systems (as we will call them) these systems all support (either directly or indirectly) a hash table interface of put(key,value) and get(key) Moreover, these systems are extremely scalable; lookups can be resolved in log ....

Druschel, P., and Rowstron, A. Past: Persistent and anonymous storage in a peer-to-peer networking environment. In Proceedings of the 8th IEEE Workshop on Hot Topics in Operating Systems (HotOS

....get files based on their key, thereby supporting the hash table like interface. This DHT functionality has proved to be a useful substrate for large distributed systems; a number of projects are proposing to build Internet scale facilities layered above DHTs, including distributed file systems [5, 7, 4], application layer multicast [11, 16] event notification services [3, 1] and chat services [2] With so many applications being developed in so short a time, we expect the DHT functionality to become an integral part of the future P2P landscape. The core of these DHT systems is the routing ....

DRUSCHEL, P., AND ROWSTRON, A. Past: Persistent and anonymous storage in a peer-to-peer networking environment. In Proceedings of the 8th IEEE Workshop on Hot Topics in Operating Systems (HotOS

....begun to attack the decentralized routing problem with different 21 approaches, including Pastry [10] CHORD [28] and CAN [22] We discuss Tapestry s approach in the context of these and other work on network location, content routing, network measurements and overlay networks. 6. 1 Pastry PAST [11] is a recent project begun at Microsoft Research focusing on peer to peer anonymous storage. The PAST routing and location layer, called Pastry [10] is a location protocol sharing many similarities with Tapestry. Key similarities include the use of prefix suffix address routing, and similar ....

Peter Druschel and Antony Rowstron. Past: Persistent and anonymous storage in a peer-to-peer networking environment. Submission to ACM HOTOS VIII, 2001.

....that queries never travel further in network distance than the node where the key is stored. The advantage of Chord is that it is substantially less complicated and handles concurrent node joins and failures well. The Chord protocol is also similar to Pastry, the location algorithm used in PAST [8]. However, Pastry is a prefix based routing protocol, and differs in other details from Chord. CAN uses a dimensional Cartesian coordinate space (for some fixed ) to implement a distributed hash table that maps keys onto values [20] Each node maintains state, and the lookup cost is ....

DRUSCHEL, P., AND ROWSTRON, A. Past: Persistent and anonymous storage in a peer-to-peer networking environment. In Proceedings of the 8th IEEE Workshop on Hot Topics in Operating Systems (HotOS

....that queries never travel further in network distance than the node where the key is stored. The advantage of Chord is that it is substantially less complicated and handles concurrent node joins and failures well. The Chord protocol is also similar to Pastry, the location algorithm used in PAST [8]. However, Pastry is a prefix based routing protocol, and differs in other details from Chord. CAN uses a d dimensional Cartesian coordinate space (for some fixed d) to implement a distributed hash table that maps keys onto values [20] Each node maintains O(d) state, and the lookup cost is O(dN ....

DRUSCHEL, P., AND ROWSTRON, A. Past: Persistent and anonymous storage in a peer-to-peer networking environment. In Proceedings of the 8th IEEE Workshop on Hot Topics in Operating Systems (HotOS 2001) (Elmau/Oberbayern, Germany, May 2001), pp. 65--70.

No context found.

P. Druschel and A. Rowstron. Past: Persistent and anonymous storage in a peer-to-peer networking environment. In Proceedings of the 8th IEEE Workshop on Hot Topics in Operating Systems, 2001.

No context found.

DRUSCHEL, P., AND ROWSTRON, A. Past: Persistent and anonymous storage in a peer-to-peer networking environment. In Proceedings of the 8th IEEE Workshop on Hot Topics in Operating Systems (HotOS-VIII) (2001), pp. 65--70.

No context found.

DRUSCHEL, P. AND ROWSTRON, A. Past: Persistent and anonymous storage in a peer-to-peer networking environment. In Proceedings of the 8 th IEEE Workshop on Hot Topics in Operating Systems (HotOS 2001).

No context found.

DRUSCHEL, P., AND ROWSTRON, A. Past: Persistent and anonymous storage in a peer-to-peer networking environment. In Proceedings of the 8th IEEE Workshop on Hot Topics in Operating Systems (HotOS 2001.

No context found.

P. Druschel and A. Rowstron. Past: Persistent and anonymous storage in a peer-to-peer networking environment. In Proceedings of the 8th IEEE Workshop on Hot Topics in Operating Systems, 2001.

No context found.

DRUSCHEL, P., AND ROWSTRON, A. Past: Persistent and anonymous storage in a peer-to-peer networking environment. Submission to ACM HOTOS VIII, 2001.

No context found.

DRUSCHEL, P., AND ROWSTRON, A. Past: Persistent and anonymous storage in a peer-to-peer networking environment. In Systems (HotOS 2001.

No context found.

Peter Druschel and Antony Rowstron. Past: Persistent and anonymous storage in a peer-to-peer networking environment. Submission to ACM HOTOS VIII, 2001.

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