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 euclidian distances...

ver descrição completa

Detalhes bibliográficos
Autor principal: Rufino, José (author)
Outros Autores: Pina, António Manuel Silva (author), Alves, Albano Agostinho Gomes (author), Exposto, José (author)
Formato: conferencePaper
Idioma:eng
Publicado em: 2008
Assuntos:
DHT
Cluster
Chord Graohics
Routing
Evaluation
Distributed lookup
Distributed hash tables
Texto completo:http://hdl.handle.net/1822/18869
País:Portugal
Oai:oai:repositorium.sdum.uminho.pt:1822/18869

Texto Completo

http://hdl.handle.net/1822/18869

Registros relacionados