Please use this identifier to cite or link to this item:
|Title:||Shortcut routing for chord graphs in the domus hash space|
|Keywords:||Distributed hash tables|
|Citation:||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.|
|Abstract:||We present and evaluate shortcut routing algorithms for Chord graphs in the hash space, speciﬁcally developed to accelerate distributed lookups in the Distributed Hash Tables (DHTs) of the Domus framework. The algorithms explore our ﬁndings 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 sufﬁciently low to make the algorithms useful in a broad set of application scenarios.|
|Appears in Collections:||IC - Publicações em Proceedings Indexadas ao ISI/Scopus|
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.