M. Theimer and M. B. Jones. Overlook: Scalable Name Service on an Overlay Network. In Proceedings of the 22nd ICDCS, July 2002. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Nondeterministic Queries in a Relational Grid Information Service - Dinda, Lu (2003) (2 citations) (Correct)
....and the query consists of a type specification for a procedure or object (the interface) and the result is matching instances. Jini uses a more general tuple of attribute value pairs as the service descriptor, and a tuple of attribute constraints as the query. One strand of recent research [1, 33, 17, 31] has focused on timelines of updates and on how services can push updates to users. Another strand has focused on distributing data throughout the network and then routing queries to likely nodes where matching data may reside using distributed hash tables [28, 26] In contrast to these systems, ....
THEIMER, M., AND JONES, M. B. Overlook: Scalable name service on an overlay network. In Proceedings of the 22nd International Conference on Distributed Computing Systems (ICDCS 2002.
USENIX Association - Usits Th Usenix (1992) (2 citations) Self-citation (Theimer Jones) (Correct)
No context found.
M. Theimer and M. B. Jones. Overlook: Scalable Name Service on an Overlay Network. In Proceedings of the 22nd ICDCS, July 2002.
Engineering Realities of Building a Working Peer-to-Peer System - Jones, Dunagan Self-citation (Jones) (Correct)
No context found.
Marvin Theimer and Michael B. Jones. Overlook: Scalable Name Service on an Overlay Network. In Proceedings of the 22 nd ICDCS, Vienna, Austria, July 2002.
SkipNet: A Scalable Overlay Network with Practical Locality.. - Michael (2003) (84 citations) Self-citation (Theimer Jones) (Correct)
.... at an overlay node whose node ID is closest to the result of applying a collision resistant hash function to that content s name (i.e. consistent hashing [15] Distributed hash tables have been used, for instance, in constructing the PAST [24] and CFS [7] distributed filesystems, the Overlook [29] scalable name service, the Squirrel [14] cooperative web cache, and scalable application level multicast [5, 25, 22] For most of these systems, if not all of them, the overlay network on which they were designed can easily be substituted with SkipNet. SkipNet has a fundamental philosophical ....
....and in the case of SkipNet, support for constrained load balancing. Seamless reassignment of traffic to well defined alternative nodes in the presence of node failures. Better support for higher level abstractions, such as application level multicast [5, 25, 22] and loadaware replication [29]. The ability to reach named destinations independent of the availability of the DNS name lookup service. 6.2 Single Overlay Networks Existing overlays are based on DHTs and depend on random assignment of node IDs in order to obtain a uniform distribution of nodes within their address ....
M. Theimer and M. B. Jones. Overlook: Scalable Name Service on an Overlay Network. In Proceedings of the 22nd ICDCS, July 2002.
SkipNet: A Scalable Overlay Network with Practical .. - Harvey, Dunagan.. (2003) (84 citations) Self-citation (Theimer Jones) (Correct)
.... at an overlay node whose node ID is closest to the result of applying a collision resistant hash function to that content s name (i.e. consistent hashing [18] Distributed hash tables have been used, for instance, in constructing the PAST [31] and CFS [8] distributed filesystems, the Overlook [37] scalable name service, the Squirrel [16] cooperative web cache, and scalable application level multicast [5, 32, 29] For most of these systems, if not all of them, the overlay network on which they were designed can easily be substituted with SkipNet. SkipNet has a fundamental philosophical ....
....and in the case of SkipNet, support for constrained load balancing. Seamless reassignment of traffic to welldefined alternative nodes in the presence of node failures. Better support for higher level abstractions, such as application level multicast [5, 32, 29] and load aware replication [37]. The ability to reach named destinations independent of the availability of the DNS name lookup service. 18 7.2 Single Overlay Networks Existing overlays are based on DHTs and depend on random assignment of node IDs in order to obtain a uniform distribution of nodes within their address ....
M. Theimer and M. B. Jones. Overlook: Scalable Name 37 Service on an Overlay Network. In Proceedings of the 22nd International Conference on Distributed Computing Systems (ICDCS). IEEE Computer Society, July 2002.
Engineering Realities of Building a Working Peer-to-Peer System - Jones, Dunagan (2004) (Correct)
No context found.
Marvin Theimer and Michael B. Jones. Overlook: Scalable Name Service on an Overlay Network. In Proceedings of the 22 nd ICDCS, Vienna, Austria, July 2002.
Nondeterministic Queries in a Relational Grid Information.. - Peter Dinda Dong (2003) (2 citations) (Correct)
No context found.
THEIMER, M., AND JONES, M. B. Overlook: Scalable name service on an overlay network. In Proceedings of the 22nd International Conference on Distributed Computing Systems (ICDCS 2002.
The Design and Implementation of a Next Generation Name.. - Ramasubramanian, Sirer (2004) (9 citations) (Correct)
No context found.
M. Theimer and M. Jones. Overlook: Scalable Name Service on an Overlay Network International Conference on Distributed Computing Systems, Vienna Austria, Jul 2002.
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