loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Sixth IEEE International Symposium on Cluster Computing and the Grid Workshops (CCGRIDW'06)
Structured Overlay without Consistent Hashing: Empirical Results
Singapore
May 16-May 19
ISBN: 0-7695-2585-7
ASCII Text
x 
 
Thorsten Schutt, Florian Schintke, Alexander Reinefeld, "Structured Overlay without Consistent Hashing: Empirical Results," Cluster Computing and the Grid, IEEE International Symposium on, vol. 2, pp. 8, Sixth IEEE International Symposium on Cluster Computing and the Grid Workshops (CCGRIDW'06), 2006.
 
 
BibTex
x
 
@article{ 10.1109/CCGRID.2006.175,
author = {Thorsten Schutt and Florian Schintke and Alexander Reinefeld},
title = {Structured Overlay without Consistent Hashing: Empirical Results},
journal ={Cluster Computing and the Grid, IEEE International Symposium on},
volume = {2},
year = {2006},
isbn = {0-7695-2585-7},
pages = {8},
doi = {http://doi.ieeecomputersociety.org/10.1109/CCGRID.2006.175},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Cluster Computing and the Grid, IEEE International Symposium on
TI - Structured Overlay without Consistent Hashing: Empirical Results
SN - 0-7695-2585-7
SP
EP
A1 - Thorsten Schutt,
A1 - Florian Schintke,
A1 - Alexander Reinefeld,
PY - 2006
KW - null
VL - 2
JA - Cluster Computing and the Grid, IEEE International Symposium on
ER -
 
Thorsten Schutt, Zuse Institute Berlin (ZIB), Germany
Florian Schintke, Zuse Institute Berlin (ZIB), Germany
Alexander Reinefeld, Zuse Institute Berlin (ZIB), Germany
Consistent hashing is at the core of many P2P protocols. It evenly distributes the keys over the nodes, thereby enabling logarithmic routing effort ?with high probability?. However, consistent hashing incurs unnecessary overhead as shown in this paper.

By removing consistent hashing from Chord, we derived a protocol that has the same favorable logarithmic routing performance but needs less network hops for updating its routing table. Additionally, our Chord# protocol supports range queries, which are not possible with Chord. Our empirical results indicate that Chord# outperforms Chord even under high churn, that is, when nodes frequently join and leave the system.

Citation:
Thorsten Schutt, Florian Schintke, Alexander Reinefeld, "Structured Overlay without Consistent Hashing: Empirical Results," ccgrid, vol. 2, pp.8, Sixth IEEE International Symposium on Cluster Computing and the Grid Workshops (CCGRIDW'06), 2006
Usage of this product signifies your acceptance of the Terms of Use.