Frank Dabek, Emma Brunskill, M. Frans Kaashoek, David Karger, Robert Morris, Ion Stoica, and Hari Balakrishnan. Building peer-to-peer systems with chord, a distributed lookup service. In Proceedings of the 8th Workshop on Hot Topics in Operating Systems, May 2001. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents
A distributed, value-oriented XML store - Thorn, Baumann, Fennestad, Sestoft (2003) (Correct)
....storage infrastructures. Existing peer to peer systems such as CFS [7, 5] PAST [17, 8] and OceanStore [3, 12] seek to take advantage of the rapid growth of resources to provide inexpensive, highly available storage without centralised servers. These systems are based on protocols (Chord [6, 18], Pastry [16] and Tapestry [24] that map data to servers, thereby essentially providing distributed hash table functionality. We present the XML Store, a distributed storage infrastructure for storing XML documents. Henglein [10] provided the initial idea of a value oriented XML Store, which is ....
....a distributed storage infrastructure for storing XML documents. Henglein [10] provided the initial idea of a value oriented XML Store, which is part of the ongoing Plan 10 project. Like the above peer to peer systems, the XML Store relies on a peer to peer distributed hash table, namely Chord [6, 18] that supports storage and retrieval of data as sequences of bytes associated with a bit hash value. However, the XML Store does not offer a conventional file system interface, but rather transparent storage of XML documents. The XML Store furthermore provides a rich API for processing ....
[Article contains additional citation context not shown here]
F. Dabek, E. Brunskill, M. F. Kaashoek, D. Karger, R. Morris, I. Stoica, and H. Balakrishan. Building peer-to-peer systems with Chord, a distributed lookup service. In Proceedings of the 8th Workshop on Hot Topics in Operating Systems (HotOS-VIII), pages 81--86, 2001.
DisCo: A Distribution Infrastructure for Securely.. - Freudenthal.. (2001) (Correct)
....number of peers. JXTA technology development thus far has emphasized locality and trust challenges [2] and has not dealt with decomposable applications. DisCo s activator tree structure can benefit from the hash based service lookup protocols proposed in infrastructures such as JXTA [15] or Chord [3], and its support for on demand service specialization can naturally accommodate locality considerations. The latter also provides DisCo with an advantage: a DisCo service can customize and dynamically download to a client a service component instance that is best suited to local application needs ....
Frank Dabek, Emma Brunskill, M. Frans Kaashoek, David Karger, Robert Morris, Ion Stoica, and Hari Balakrishnan. Building Peer-to-Peer Systems with Chord, a Distributed Lookup Service. In Proceedings of ACM SIGCOMM, 2001.
Novel Architectures for P2P Applications: the.. - Naor, Wieder (2002) (23 citations) (Correct)
....#x be a set of n points in I and define G #x to be the discretization of G as described in Section 2. Note that G #x has the ring like structure of DH, Chord [26] and Viceroy [16] It is possible to show that G #x is quite similar to chord. The various algorithms presented for Chord ( 26] 14] [5]) apply here as well. 3. DYNAMIC CACHING RELIEVING HOT SPOTS A highly popular data item may cause a bottleneck at and around its location. This phenomena cannot be dealt with locally. It is necessary to replicate the popular data item to other processors, such that the load of handling all ....
F. Dabek, E. Brunskill, M. F. Kaashoek, D. Karger, R. Morris, I. Stoica, and H. Balakrishnan. Building peer-to-peer systems with Chord, a distributed lookup service. In Eighth IEEE Workshop on Hot Topics in Operating Systems (HotOS-VIII), pages 81--86.
Context Aggregation and Dissemination in Ubiquitous Computing.. - Chen, Kotz (2002) (11 citations) (Correct)
....name resolution but may encounter a bottleneck at the root. Some structural conventions may be imposed on an attribute based approach to improve resolution scalability [2] While some recent peer to peer systems hash a full name as the first step in locating the object associated with a name [10, 13, 23], it is not clear how that approach might support wildcards and context sensitive names. 4.3 Event routing Although the graph abstraction links publishers directly to subscribers, routing events from a publisher to its set of subscribers is essentially a multicast problem that may be implemented ....
....or less efficient than the implicit filtering in content based event routing system like Siena. Solar names many of its publishers. We may be able to use names instead of addresses for routing [24, 2] Peerto peer systems typically hash the full text name into an ID for the purpose of routing [10, 13, 23]. These approaches do not easily support context sensitive subscriptions, however. 7 Summary To support context aware mobile applications, we propose a graph based abstraction for context aggregation and dissemination. The abstraction models the contextual information sources as event ....
F. Dabek, E. Brunskill, M. F. Kaashoek, D. Karger, R. Morris, I. Stoica, and H. Balakrishnan. Building peer-to-peer systems with Chord, a distributed lookup service. In Proceedings of the 8th Annual Workshop on Hot Topics in Operating Systems, Elmau, Germany, May 2001.
Efficient Search in Unbalanced, Randomized Peer-To-Peer Search.. - Aberer (2002) (Correct)
....architecture, a medium number of nodes, and typical by some form of global coordination, such as split coordinators or global directories. For implementing global scale resource access in a P2P architectures similar structures, so called distributed hash tables (DHT) have been been studied [1, 2, 3, 4, 9, 10, 11]. DHTs implement routing schemes for quickly locating resources identified by a data key in a network of peers (typically in time) The search can be started at any peer, without relying on a centralized directory. They differ from SDDSs through complete (or almost complete) ....
....For example, the peer key distribution could be uniform and the data key distribution could be highly skewed and vice versa. Therefore highly unevenly distributed workloads for peers in terms of storing data and routing search requests are likely to occur (a problem that is discussed in [4], for example) In the context of database systems this issue has been addressed by developing balanced search structures, such as B Trees. Thus, a possible approach is to develop distributed versions of balanced search trees. However, this imposes challenging problems in terms of maintaining the ....
[Article contains additional citation context not shown here]
F. Dabek, E. Brunskill, M.F. Kaashoek, D. Karger, R. Morris, I. Stoica, and H. Balakrishnan. Building peer-to-peer systems with CHORD, a distributed lookup service. In Proceedings of the 8th Workshop on Hot Topics in Operating Systems (HotOS-VIII), 2001.
Novel Architectures for P2P Applications: the.. - Naor, Wieder (2003) (23 citations) (Correct)
.... x be a set of n points in I and de ne G x to be the discretization of G as described in Section 2. Note that G x has the ring like structure of DH, Chord [26] and Viceroy [16] It is possible to show that G x is quite similar to chord. The various algorithms presented for Chord ( 26] 14] [5]) apply here as well. 3. DYNAMIC CACHING RELIEVING HOT SPOTS A highly popular data item may cause a bottleneck at and around its location. This phenomena cannot be dealt with locally. It is necessary to replicate the popular data item to other processors, such that the load of handling all ....
F. Dabek, E. Brunskill, M. F. Kaashoek, D. Karger, R. Morris, I. Stoica, and H. Balakrishnan. Building peer-to-peer systems with Chord, a distributed lookup service. In Eighth IEEE Workshop on Hot Topics in Operating Systems (HotOS-VIII), pages 81-86.
Make it Fresh, Make it Quick - Searching a Network of.. - Bawa, Bayardo, Jr. (2003) (4 citations) (Correct)
....a web search. P2P Research Proposals There have been many recent proposals for P2P systems and architectures that have yet to progress into deployment and use by a significant number of users. One such class of systems includes structured overlay networks called Distributed Hash Tables (DHTs) [24, 19, 26]. DHTs provide efficient key value lookups across peers, but DHTs alone do not support content search. PlanetP [18] is a research project that proposes another searchable P2P network. As in YouSearch, each peer constructs bloom filters to summarize its content. PlanetP peers then gossip with each ....
F. Dabek, E. Brunskill, M. F. Kaashoek, D. Karger, R. Morris, I. Stoica, and H. Balakrishnan. Building Peer-to-Peer Systems with Chord, a Distributed Lookup Service. In Proc. 8th Workshop on Hot Topics in Operating Systems (HotOS), 2001.
Analysis of the Evolution of Peer-to-Peer Systems - David Liben-Nowell Hari (2002) (14 citations) Self-citation (Karger Balakrishnan) (Correct)
No context found.
DABEK, F., BRUNSKILL, E., KAASHOEK, M. F., KARGER, D., MORRIS, R., STOICA, I., AND BALAKRISHNAN, H. Building peer-to-peer systems with Chord, a distributed location service. In Proc. IEEE Workshop on Hot Topics in Operating Systems (HotOS-VIII) (2001).
Chord: A Scalable Peer-to-peer Lookup Service for Internet.. - Ion Stoica Robert (2001) (1123 citations) Self-citation (Kaashoek Karger Morris Stoica Balakrishnan) (Correct)
No context found.
DABEK, F., BRUNSKILL, E., KAASHOEK, M. F., KARGER, D., MORRIS, R., STOICA, I., AND BALAKRISHNAN, H. Building peer-to-peer systems with Chord, a distributed location service. In Systems (HotOS-VIII) (Elmau/Oberbayern, Germany, May 2001), pp. 71--76.
Scalable Internet Routing on Topology-Independent Node Identities - Ford (2003) (Correct)
No context found.
Frank Dabek, Emma Brunskill, M. Frans Kaashoek, David Karger, Robert Morris, Ion Stoica, and Hari Balakrishnan. Building peer-to-peer systems with chord, a distributed lookup service. In Proceedings of the 8th Workshop on Hot Topics in Operating Systems, May 2001.
Glacier: Highly durable, decentralized storage despite - Massive Correlated Failures (Correct)
No context found.
Frank Dabek, Emma Brunskill, M. Frans Kaashoek, David Karger, Robert Morris, Ion Stoica, and Hari Balakrishnan. Building peer-to-peer systems with chord, a distributed lookup service. In Proc. HotOS, Schloss Elmau, Germany, May 2001.
Semantic-Based Matching and Personalization in FWEB, a - Publish Subscribe-Based Web (2005) (Correct)
No context found.
F. Dabek, E. Brunskill, M. F. Kaashoek, D. Karger, R. Morris, I. Stoica, and H. Balakrishnan. Building peer-to-peer systems with Chord, a distributed lookup service. In IEEE, editor, Eighth IEEE Workshop on Hot Topics in Operating Systems (HotOS-VIII). May 20--23, 2001.
A Robust Protocol for Building Superpeer Overlay Topologies - Alberto Montresor Department (2004) (1 citation) (Correct)
No context found.
F. Dabek et al. Building Peer-to-Peer Systems with Chord, a Distributed Lookup Service. In Proc. of the 8th Workshop on Hot Topics in Operating Systems (HotOS), Schloss Elmau, Germany, May 2001. IEEE Computer Society.
A distributed, value-oriented XML Store - Thorn, Baumann, Fennestad (2002) (Correct)
No context found.
F. Dabek, E. Brunskill, M. F. Kaashoek, D. Karger, R. Morris, I. Stoica, and H. Balakrishan. Building peer-to-peer systems with Chord, a distributed lookup service. In Proceedings of the 8th Workshop on Hot Topics in Operating Systems (HotOS-VIII), pages 81--86, 2001.
Project JXTA-C: Enabling a Web of Things - Bernard Traversat Mohamed (2003) (1 citation) (Correct)
No context found.
F. Dabek, E. Brunskill, M.F. Kaashoek, D. Karger, R. Morris, I. Stoica, and H. Balakrishnan, Building Peer-toPeer Systems with Chord, a Distributed Lookup Service, 2001.
Project JXTA 2.0 Super-Peer Virtual Network - Bernard Traversat Ahkil (Correct)
No context found.
F. Dabek, E. Brunskill, M.F. Kaashoek, D. Karger, R. Morris, I. Stoica, and H. Balakrishnan, Building Peerto -Peer Systems with Chord, a Distributed Lookup Service, 2001
Scalable Internet Routing on Topology-Independent Node Identities - Ford (2003) (Correct)
No context found.
Frank Dabek, Emma Brunskill, M. Frans Kaashoek, David Karger, Robert Morris, Ion Stoica, and Hari Balakrishnan. Building peer-to-peer systems with chord, a distributed lookup service. In Proceedings of the 8th Workshop on Hot Topics in Operating Systems, May 2001.
D3amcasT: A DHT-based Application-level Multicast - With Decentralized Control (Correct)
No context found.
F. Dabek, E. Brunskill, M. F. Kaashoek, D. Karger, R. Morris, I. Stoica and H. Balakrishnan, Building peer-to-peer systems with chord, a distributed lookup service, Proc. HotOS, Schloss Elmau (May 2001), 81--86.
Efficient Search in Structured Peer-to-Peer Systems:Binary.. - Punceva, Aberer (2003) (Correct)
No context found.
Dabek, F., Brunskill, E., Kaashoek, F.M., Karger, D., Morris, R., Stoica, I., Balakrishnan, H.: Building Peer-to-Peer Systems with Chord, a Distributed LookupService. Eighth Workshop on Hot Topics in Operating Systems (HotOS), (2001).
Project JXTA: A Loosely-Consistent DHT Rendezvous Walker - Bernard Traversat Mohamed (Correct)
No context found.
F. Dabek and al., Building Peer-to-Peer Systems with Chord, a Distributed Lookup Service, 2001.
Project JXTA Virtual Network - Bernard Traversat Mohamed (2002) (9 citations) (Correct)
No context found.
F. Dabek, E. Brunskill, M.F. Kaashoek, D. Karger, R. Morris, I. Stoica, and H. Balakrishnan, Building Peerto -Peer Systems with Chord, a Distributed Lookup Service, 2001
Service Duality: Vitalizing the Commons - Unpublished Draft Bryan (Correct)
No context found.
Frank Dabek, Emma Brunskill, M. Frans Kaashoek, David Karger, Robert Morris, Ion Stoica, and Hari Balakrishnan. Building peerto -peer systems with chord, a distributed lookup service. In Proceedings of the 8th Workshop on Hot Topics in Operating Systems, May 2001.
Project JXTA-C: Enabling a Web of Things - Traversat, Abdelaziz, Doolin.. (2003) (1 citation) (Correct)
No context found.
F. Dabek, E. Brunskill, M.F. Kaashoek, D. Karger, R. Morris, I. Stoica, and H. Balakrishnan, Building Peer-toPeer Systems with Chord, a Distributed Lookup Service, 2001.
Attack Resistant Trust Metrics - Levien (2002) (8 citations) (Correct)
No context found.
Frank Dabek, Emma Brunskill, M. Frans Kaashoek, David Karger, Robert Morris, Ion Stoica, and Hari Balakrishnan. Building peer-to-peer systems with Chord, a distributed lookup service. In Proceedings of the 8th Workshop on Hot Topics in Operating Systems (HotOS-VIII), Schloss Elmau, Germany, May 2001. IEEE Computer Society.
A peer-to-peer, value-oriented XML Store - Thorn, Baumann, Fennestad, Sestoft (2003) (Correct)
No context found.
F. Dabek, E. Brunskill, M. F. Kaashoek, D. Karger, R. Morris, I. Stoica, and H. Balakrishan. Building peer-to-peer systems with Chord, a distributed lookup service. In Proceedings of the 8th Workshop on Hot Topics in Operating Systems (HotOS-VIII), pages 81--86, 2001.
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