. J.Considine and T.Florio, "Scalable peer-to-peer indexing with constant state," Technical Report, September 2002 Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Cluster-based Optimizations for Distributed Hash Tables - Considine (2002) Self-citation (Considine) (Correct)
....points to the node responsible for ### of the way around the ring, the second points ### of the way around the ring, etc. Routing then proceeds by repeatedly following the longest pointers not passing the desired item. This takes ##### ## hops with high probability. Derivative schemes such as [6, 1] achieve similar ##### ## hop routing using fewer but more elaborately arranged pointers but the general ideas are the same. Relatively little work has been done with topological optimizations of Chord with the exception of [2] In short, they note that the distance covered by a finger pointer is ....
....of the extra edges all other costs are amortized away as part of optimized searches for maintaining the full network. As a final note with respect to 3 these costs, if they are still deemed excessive, then the idea of cluster overlays applies equally well to fixed degree schemes such as [6, 1]. 3 Extensions In this section, we discuss two more classes of optimizations that are possible using this framework. The first takes advantage of the cluster overlay to distribute knowledge of all nodes known to the cluster. The second strengthens spatial locality by considering the effects of ....
CONSIDINE, J., AND FLORIO, T. Scalable peer-topeer indexing with constant state. Tech. rep., CS Department, Boston University, September 2002.
Cluster-based Optimizations for Distributed Hash Tables - Considine (2002) Self-citation (Considine) (Correct)
....points to the node responsible for 1=2 of the way around the ring, the second points 1=4 of the way around the ring, etc. Routing then proceeds by repeatedly following the longest pointers not passing the desired item. This takes O(log n) hops with high probability. Derivative schemes such as [6, 1] achieve similar O(log n) hop routing using fewer but more elaborately arranged pointers but the general ideas are the same. Relatively little work has been done with topological optimizations of Chord with the exception of [2] In short, they note that the distance covered by a finger pointer is ....
....of the extra edges all other costs are amortized away as part of optimized searches for maintaining the full network. As a final note with respect to 3 these costs, if they are still deemed excessive, then the idea of cluster overlays applies equally well to fixed degree schemes such as [6, 1]. 3 Extensions In this section, we discuss two more classes of optimizations that are possible using this framework. The first takes advantage of the cluster overlay to distribute knowledge of all nodes known to the cluster. The second strengthens spatial locality by considering the effects of ....
CONSIDINE, J., AND FLORIO, T. Scalable peer-topeer indexing with constant state. Tech. rep., CS Department, Boston University, September 2002.
Peer-to-Peer Overlay Networks: A Survey - Chonggang Wang Bo (Correct)
No context found.
. J.Considine and T.Florio, "Scalable peer-to-peer indexing with constant state," Technical Report, September 2002
Graph-Theoretic Analysis of Structured Peer-to-Peer.. - Loguinov, Kumar, Rai, .. (2003) (22 citations) (Correct)
No context found.
J. Considine and T.A. Florio, "Scalable Peer-to-Peer Indexing with Constant State," Boston U. Technical Report 2002-026, August 2002.
Graph-Theoretic Analysis of Structured Peer-to-Peer.. - Loguinov, Kumar, Rai, .. (2003) (22 citations) (Correct)
No context found.
J. Considine and T.A. Florio, "Scalable Peer-to-Peer Indexing with Constant State," Boston U. Technical Report 2002.
Routing Networks for Distributed Hash Tables - Manku (2003) (16 citations) (Correct)
No context found.
J. Considine and T. Florio. Scalable peer-to-peer indexing with constant state. Technical Report 2002-026, Computer Science Deptt., Boston University, Sep 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