DHT-based functionalities using hypercubes

Autores
Alvarez Hamelin, José I.; Amorim, Marcelo D. de
Año de publicación
2006
Idioma
inglés
Tipo de recurso
documento de conferencia
Estado
versión publicada
Descripción
Decoupling the permanent identifi er of a node from the node's topology-dependent address is a promising approach toward completely scalable self-organizing networks. Existing solutions use a logical tree-like structure that, although allowing for simple address assignment and management, lead to low route selection flexibility. This clearly results in low routing performance and poor resilience to failures. In this paper, we propose to increase the number of candidate paths by using incomplete hypercubes. We will see that this solution can cover a wide range of applications by adapting to the dynamics of the network
1st IFIP International Conference on Ad-Hoc NetWorking
Red de Universidades con Carreras en Informática (RedUNCI)
Materia
Ciencias Informáticas
Network Protocols
self-organizing networks
indirect routing
DHT
hypercubes
Nivel de accesibilidad
acceso abierto
Condiciones de uso
http://creativecommons.org/licenses/by-nc-sa/2.5/ar/
Repositorio
SEDICI (UNLP)
Institución
Universidad Nacional de La Plata
OAI Identificador
oai:sedici.unlp.edu.ar:10915/23832
Acceder
id SEDICI_f2164bc116a1e9599a78ee95314ee67a
oai_identifier_str oai:sedici.unlp.edu.ar:10915/23832
network_acronym_str SEDICI
repository_id_str 1329
network_name_str SEDICI (UNLP)
spelling DHT-based functionalities using hypercubesAlvarez Hamelin, José I.Amorim, Marcelo D. deCiencias InformáticasNetwork Protocolsself-organizing networksindirect routingDHThypercubesDecoupling the permanent identifi er of a node from the node's topology-dependent address is a promising approach toward completely scalable self-organizing networks. Existing solutions use a logical tree-like structure that, although allowing for simple address assignment and management, lead to low route selection flexibility. This clearly results in low routing performance and poor resilience to failures. In this paper, we propose to increase the number of candidate paths by using incomplete hypercubes. We will see that this solution can cover a wide range of applications by adapting to the dynamics of the network1st IFIP International Conference on Ad-Hoc NetWorkingRed de Universidades con Carreras en Informática (RedUNCI)2006-08info:eu-repo/semantics/conferenceObjectinfo:eu-repo/semantics/publishedVersionObjeto de conferenciahttp://purl.org/coar/resource_type/c_5794info:ar-repo/semantics/documentoDeConferenciaapplication/pdfhttp://sedici.unlp.edu.ar/handle/10915/23832enginfo:eu-repo/semantics/altIdentifier/isbn/0-387-34635-Xinfo:eu-repo/semantics/openAccesshttp://creativecommons.org/licenses/by-nc-sa/2.5/ar/Creative Commons Attribution-NonCommercial-ShareAlike 2.5 Argentina (CC BY-NC-SA 2.5)reponame:SEDICI (UNLP)instname:Universidad Nacional de La Platainstacron:UNLP2025-09-29T10:55:36Zoai:sedici.unlp.edu.ar:10915/23832Institucionalhttp://sedici.unlp.edu.ar/Universidad públicaNo correspondehttp://sedici.unlp.edu.ar/oai/snrdalira@sedici.unlp.edu.arArgentinaNo correspondeNo correspondeNo correspondeopendoar:13292025-09-29 10:55:36.61SEDICI (UNLP) - Universidad Nacional de La Platafalse
dc.title.none.fl_str_mv DHT-based functionalities using hypercubes
title DHT-based functionalities using hypercubes
spellingShingle DHT-based functionalities using hypercubes
Alvarez Hamelin, José I.
Ciencias Informáticas
Network Protocols
self-organizing networks
indirect routing
DHT
hypercubes
title_short DHT-based functionalities using hypercubes
title_full DHT-based functionalities using hypercubes
title_fullStr DHT-based functionalities using hypercubes
title_full_unstemmed DHT-based functionalities using hypercubes
title_sort DHT-based functionalities using hypercubes
dc.creator.none.fl_str_mv Alvarez Hamelin, José I.
Amorim, Marcelo D. de
author Alvarez Hamelin, José I.
author_facet Alvarez Hamelin, José I.
Amorim, Marcelo D. de
author_role author
author2 Amorim, Marcelo D. de
author2_role author
dc.subject.none.fl_str_mv Ciencias Informáticas
Network Protocols
self-organizing networks
indirect routing
DHT
hypercubes
topic Ciencias Informáticas
Network Protocols
self-organizing networks
indirect routing
DHT
hypercubes
dc.description.none.fl_txt_mv Decoupling the permanent identifi er of a node from the node's topology-dependent address is a promising approach toward completely scalable self-organizing networks. Existing solutions use a logical tree-like structure that, although allowing for simple address assignment and management, lead to low route selection flexibility. This clearly results in low routing performance and poor resilience to failures. In this paper, we propose to increase the number of candidate paths by using incomplete hypercubes. We will see that this solution can cover a wide range of applications by adapting to the dynamics of the network
1st IFIP International Conference on Ad-Hoc NetWorking
Red de Universidades con Carreras en Informática (RedUNCI)
description Decoupling the permanent identifi er of a node from the node's topology-dependent address is a promising approach toward completely scalable self-organizing networks. Existing solutions use a logical tree-like structure that, although allowing for simple address assignment and management, lead to low route selection flexibility. This clearly results in low routing performance and poor resilience to failures. In this paper, we propose to increase the number of candidate paths by using incomplete hypercubes. We will see that this solution can cover a wide range of applications by adapting to the dynamics of the network
publishDate 2006
dc.date.none.fl_str_mv 2006-08
dc.type.none.fl_str_mv info:eu-repo/semantics/conferenceObject
info:eu-repo/semantics/publishedVersion
Objeto de conferencia
http://purl.org/coar/resource_type/c_5794
info:ar-repo/semantics/documentoDeConferencia
format conferenceObject
status_str publishedVersion
dc.identifier.none.fl_str_mv http://sedici.unlp.edu.ar/handle/10915/23832
url http://sedici.unlp.edu.ar/handle/10915/23832
dc.language.none.fl_str_mv eng
language eng
dc.relation.none.fl_str_mv info:eu-repo/semantics/altIdentifier/isbn/0-387-34635-X
dc.rights.none.fl_str_mv info:eu-repo/semantics/openAccess
http://creativecommons.org/licenses/by-nc-sa/2.5/ar/
Creative Commons Attribution-NonCommercial-ShareAlike 2.5 Argentina (CC BY-NC-SA 2.5)
eu_rights_str_mv openAccess
rights_invalid_str_mv http://creativecommons.org/licenses/by-nc-sa/2.5/ar/
Creative Commons Attribution-NonCommercial-ShareAlike 2.5 Argentina (CC BY-NC-SA 2.5)
dc.format.none.fl_str_mv application/pdf
dc.source.none.fl_str_mv reponame:SEDICI (UNLP)
instname:Universidad Nacional de La Plata
instacron:UNLP
reponame_str SEDICI (UNLP)
collection SEDICI (UNLP)
instname_str Universidad Nacional de La Plata
instacron_str UNLP
institution UNLP
repository.name.fl_str_mv SEDICI (UNLP) - Universidad Nacional de La Plata
repository.mail.fl_str_mv alira@sedici.unlp.edu.ar
_version_ 1844615815699103744
score 13.070432

Publicaciones similares