No abstract

Mobility and security are very important services for both current and future network infrastructures. However, the integration of mobility in traditional virtual private networks is difficult due to the costs of reestablishing broken secure tunnels and restarting broken application connections. In order to address this issue, we propose a new communication system called Mobile User Secured Session. Based upon a peer-to-peer overlay network, it provides security services to the application layer connections of mobile users. The secure and resilient sessions allow user connections to survive network failures as opposed to regular transport layer secured connections. We have implemented a prototype and have assessed its proper functioning by running experimentations upon a simple virtual dynamic network.

Distributed hash tables (DHT) need to route requests in a scalable way. Although several solutions do exist, they often require nodes to connect to each others in a given way. Greedy routing schemes based on virtual coordinates taken from the hyperbolic plane have attracted some interest in recent years. Such schemes can be used for building distributed hash tables while letting the nodes connect to the others as they wish. In this paper, we define a new scalable and reliable DHT system based on the use of hyperbolic geometry. We provide a scalability analysis and we assess its efficiency by performing simulations. Results show that our DHT system brings more flexibility to the nodes while still being scalable and reliable in presence of churn.Index Terms-Distributed hash table, greedy routing, hyperbolic plane.

HAL is a multi-disciplinary open access archive for the deposit and dissemination of scientific research documents, whether they are published or not. The documents may come from teaching and research institutions in France or abroad, or from public or private research centers. L'archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des établissements d'enseignement et de recherche français ou étrangers, des laboratoires publics ou privés. ABSTRACT. A distributed hash table needs to route requests in a scalable way. Although several solutions do exist, they often require nodes to connect to each others by following a specific topology and to maintain routing tables. We propose a greedy routing algorithm based on virtual coordinates taken from the hyperbolic plane for building a distributed hash table while letting nodes connect to any others as they wish and without maintaining any routing table. In this paper, we use this algorithm to define a new scalable and reliable distributed hash table system. We provide a scalability analysis and we evaluate its performance and efficiency by carrying out simulations including other existing solutions. Results show that our system brings more flexibility to the nodes while still being scalable and reliable in presence of churn.MOTS-CLÉS : plan hyperbolique, routage glouton, table de hachage distribuée.