Utilize este identificador para referenciar este registo: http://hdl.handle.net/10198/983
Título: Shortcut routing for chord graphs in the domus hash space
Autor: Rufino, José
Pina, António
Alves, Albano
Exposto, José
Palavras-chave: Distributed hash tables
Distributed lookup
Data: 2008
Editora: Acta Press
Citação: Rufino, José; Pina, António; Alves, Albano; Exposto, José (2008) - Shortcut routing for chord graphs in the domus hash space. In IASTED International Conference on Parallel and Distributed Computing and Systems. Orlando, Florida, USA. p.316-323.
Resumo: 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 in Chord graphs, in conjunction with the availability, in each DHT node, of multiple routing tables of the underlying Chord graph. The outcome are routing decisions capable of achieving average distances as low as 40% of those offered by Chord’s conventional routing method. Moreover, the supplemental computational effort to take the shortcut routing decisions is sufficiently low to make the algorithms useful in a broad set of application scenarios.
Peer review: yes
URI: http://hdl.handle.net/10198/983
Versão do Editor: http://www.actapress.com/Abstract.aspx?paperId=34309
Aparece nas colecções:ESTiG - Publicações em Proceedings Indexadas à WoS/Scopus

Ficheiros deste registo:
Ficheiro Descrição TamanhoFormato 
pdcs2008-jose-rufino.pdf267,96 kBAdobe PDFVer/Abrir

FacebookTwitterDeliciousLinkedInDiggGoogle BookmarksMySpace
Formato BibTex MendeleyEndnote Degois 

Todos os registos no repositório estão protegidos por leis de copyright, com todos os direitos reservados.