DHT-based Functionalities Using Hypercubes

Abstract : Decoupling the permanent identifier 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.
Type de document :
Communication dans un congrès
IFIP 19th World Computer Congress, Aug 2006, Santiago, Chile. Springer, IFIP 19th World Computer Congress, 212, pp.157-176, IFIP International Federation for Information Processing. 〈10.1007/978-0-387-34738-7_12〉
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-01351658
Contributeur : Lip6 Publications <>
Soumis le : jeudi 4 août 2016 - 14:29:40
Dernière modification le : jeudi 22 novembre 2018 - 14:30:13

Lien texte intégral

Identifiants

Collections

Citation

José Ignacio Alvarez-Hamelin, Aline Carneiro Viana, Marcelo Dias de Amorim. DHT-based Functionalities Using Hypercubes. IFIP 19th World Computer Congress, Aug 2006, Santiago, Chile. Springer, IFIP 19th World Computer Congress, 212, pp.157-176, IFIP International Federation for Information Processing. 〈10.1007/978-0-387-34738-7_12〉. 〈hal-01351658〉

Partager

Métriques

Consultations de la notice

68