Shortcut routing for chord graphs in the domus hash space
We present and evaluate shortcut routing algorithms for Chord graphs in the hash space, specifically developed to accelerate distributed lookups in the Distributed Hash Tables (DHTs) of the Domus framework. The algorithms explore our findings about the relation of exponential and euclidean distances i...
| Autor principal: | |
|---|---|
| Outros Autores: | , , |
| Formato: | conferenceObject |
| Idioma: | eng |
| Publicado em: |
2009
|
| Assuntos: | |
| Texto completo: | http://hdl.handle.net/10198/983 |
| País: | Portugal |
| Oai: | oai:bibliotecadigital.ipb.pt:10198/983 |