Publicação
Shortcut routing for chord graphs in the domus hash space
| 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. |
|---|---|
| Autores principais: | Rufino, José |
| Outros Autores: | Pina, António; Alves, Albano; Exposto, José |
| Assunto: | Distributed hash tables Distributed lookup Evaluation |
| Ano: | 2008 |
| País: | Portugal |
| Tipo de documento: | comunicação em conferência |
| Tipo de acesso: | acesso aberto |
| Instituição associada: | Instituto Politécnico de Bragança |
| Idioma: | inglês |
| Origem: | Biblioteca Digital do IPB |
| _version_ | 1867173000022851584 |
|---|---|
| author | Rufino, José |
| author2 | Pina, António Alves, Albano Exposto, José |
| author2_role | author author author |
| author_facet | Rufino, José Pina, António Alves, Albano Exposto, José |
| author_role | author |
| contributor_name_str_mv | Biblioteca Digital do IPB |
| country_str | PT |
| creators_json_txt | [{\"Person.name\":\"Rufino, José\",\"Person.identifier.orcid\":\"0000-0002-1344-8264\"},{\"Person.name\":\"Pina, António\"},{\"Person.name\":\"Alves, Albano\",\"Person.identifier.orcid\":\"0000-0001-9796-6810\"},{\"Person.name\":\"Exposto, José\",\"Person.identifier.orcid\":\"0000-0003-3857-6083\"}] |
| datacite.contributors.contributor.contributorName.fl_str_mv | Biblioteca Digital do IPB |
| datacite.creators.creator.creatorName.fl_str_mv | Rufino, José Pina, António Alves, Albano Exposto, José |
| datacite.date.Accepted.fl_str_mv | 2008-01-01T00:00:00Z |
| datacite.date.available.fl_str_mv | 2009-01-29T10:37:54Z |
| datacite.date.embargoed.fl_str_mv | 2009-01-29T10:37:54Z |
| datacite.rights.fl_str_mv | http://purl.org/coar/access_right/c_abf2 |
| datacite.subjects.subject.fl_str_mv | Distributed hash tables Distributed lookup Evaluation |
| datacite.titles.title.fl_str_mv | Shortcut routing for chord graphs in the domus hash space |
| dc.contributor.none.fl_str_mv | Biblioteca Digital do IPB |
| dc.creator.none.fl_str_mv | Rufino, José Pina, António Alves, Albano Exposto, José |
| dc.date.Accepted.fl_str_mv | 2008-01-01T00:00:00Z |
| dc.date.available.fl_str_mv | 2009-01-29T10:37:54Z |
| dc.date.embargoed.fl_str_mv | 2009-01-29T10:37:54Z |
| dc.format.none.fl_str_mv | application/pdf |
| dc.identifier.none.fl_str_mv | http://hdl.handle.net/10198/983 |
| dc.language.none.fl_str_mv | eng |
| dc.publisher.none.fl_str_mv | Acta Press |
| dc.rights.none.fl_str_mv | http://purl.org/coar/access_right/c_abf2 |
| dc.subject.none.fl_str_mv | Distributed hash tables Distributed lookup Evaluation |
| dc.title.fl_str_mv | Shortcut routing for chord graphs in the domus hash space |
| dc.type.none.fl_str_mv | http://purl.org/coar/resource_type/c_5794 |
| description | 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. |
| dirty | 0 |
| eu_rights_str_mv | openAccess |
| format | conferencePaper |
| fulltext.url.fl_str_mv | https://bibliotecadigital.ipb.pt/bitstreams/c36b8053-e8f2-4b59-bb62-7b79460a2c63/download |
| id | ipb_8094de073230d0b141ceb5ceec64b1ac |
| identifier.url.fl_str_mv | http://hdl.handle.net/10198/983 |
| instacron_str | ipb |
| institution | Instituto Politécnico de Bragança |
| instname_str | Instituto Politécnico de Bragança |
| language | eng |
| network_acronym_str | ipb |
| network_name_str | Biblioteca Digital do IPB |
| oai_identifier_str | oai:bibliotecadigital.ipb.pt:10198/983 |
| organization_str_mv | urn:organizationAcronym:ipb |
| person_str_mv | Rufino, José Rufino, José https://www.ciencia-id.pt/C414-F47F-6323 C414-F47F-6323 http://orcid.org/0000-0002-1344-8264 0000-0002-1344-8264 Pina, António Alves, Albano Alves, Albano https://www.ciencia-id.pt/281A-DD4A-2605 281A-DD4A-2605 http://orcid.org/0000-0001-9796-6810 0000-0001-9796-6810 Exposto, José Exposto, José https://www.ciencia-id.pt/DA10-808F-99EA DA10-808F-99EA http://orcid.org/0000-0003-3857-6083 0000-0003-3857-6083 |
| publishDate | 2008 |
| publisher.none.fl_str_mv | Acta Press |
| reponame_str | Biblioteca Digital do IPB |
| repository_id_str | urn:repositoryAcronym:ipb |
| service_str_mv | urn:repositoryAcronym:ipb |
| spelling | engActa PressenWe 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.application/pdfenShortcut routing for chord graphs in the domus hash spacePersonalRufino, JoséDSpacehttp://dspace.org/items/1e24d2ce-a354-442a-bef8-eebadd94b385DSpacehttp://dspace.org/items/1e24d2ce-a354-442a-bef8-eebadd94b385RufinoJoséCiência IDhttps://www.ciencia-id.ptC414-F47F-6323ORCIDhttp://orcid.org0000-0002-1344-8264Scopus Author IDhttps://www.scopus.com55947199100Scopus Author IDhttps://www.scopus.com57188967176Pina, AntónioPersonalAlves, AlbanoDSpacehttp://dspace.org/items/80d7f985-d700-4911-8974-b2678816db35DSpacehttp://dspace.org/items/80d7f985-d700-4911-8974-b2678816db35AlvesAlbanoCiência IDhttps://www.ciencia-id.pt281A-DD4A-2605ORCIDhttp://orcid.org0000-0001-9796-6810PersonalExposto, JoséDSpacehttp://dspace.org/items/66fd8128-90b1-4754-936e-2d9e9e0829ecDSpacehttp://dspace.org/items/66fd8128-90b1-4754-936e-2d9e9e0829ecExpostoJoséCiência IDhttps://www.ciencia-id.ptDA10-808F-99EAORCIDhttp://orcid.org0000-0003-3857-6083Scopus Author IDhttps://www.scopus.com56619498700HostingInstitutionOrganizationalBiblioteca Digital do IPBe-mailmailto:dspace@ipb.ptdspace@ipb.pt2009-01-29T10:37:54Z20082008-01-01T00:00:00ZHandlehttp://hdl.handle.net/10198/983http://purl.org/coar/access_right/c_abf2open accessDistributed hash tablesDistributed lookupEvaluation274388 bytesother research producthttp://purl.org/coar/resource_type/c_5794conference paperhttp://purl.org/coar/access_right/c_abf2application/pdffulltexthttps://bibliotecadigital.ipb.pt/bitstreams/c36b8053-e8f2-4b59-bb62-7b79460a2c63/download |
| spellingShingle | Shortcut routing for chord graphs in the domus hash space Rufino, José Distributed hash tables Distributed lookup Evaluation |
| status | SINGLETON |
| subject.fl_str_mv | Distributed hash tables Distributed lookup Evaluation |
| title | Shortcut routing for chord graphs in the domus hash space |
| title_full | Shortcut routing for chord graphs in the domus hash space |
| title_fullStr | Shortcut routing for chord graphs in the domus hash space |
| title_full_unstemmed | Shortcut routing for chord graphs in the domus hash space |
| title_short | Shortcut routing for chord graphs in the domus hash space |
| title_sort | Shortcut routing for chord graphs in the domus hash space |
| topic | Distributed hash tables Distributed lookup Evaluation |
| topic_facet | Distributed hash tables Distributed lookup Evaluation |
| url | http://hdl.handle.net/10198/983 |
| visible | 1 |