Dynamic Greedy Routing in Overlay Networks Using Virtual Coordinates from the Hyperbolic Plane - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Transactions on emerging telecommunications technologies Année : 2015

Dynamic Greedy Routing in Overlay Networks Using Virtual Coordinates from the Hyperbolic Plane

Résumé

Greedy routing algorithms based on virtual coordinates have attracted considerable interest in recent years. Those based on coordinates taken from the hyperbolic plane have interesting theoretical scalability properties. However, their scalability and reliability are yet to be ensured when applied to large scale dynamic networks. In this paper, we propose a scalable and reliable solution for creating and managing dynamic overlay networks where nodes have hyperbolic coordinates. In this context, our solution provides a greedy routing algorithm based on the hyperbolic distance. To cope with network dynamics, we have defined two methods for avoiding temporary local minima and one method for maintaining the greedy embedding over time. Through analysis, we evaluate the complexity costs of our solution. Through simulations, we assess the scalability of our solution on static networks and its reliability on dynamic networks. Results show that using our solution based on hyperbolic geometry provides scalability and reliability to both addressing and routing tasks in dynamic overlay networks.
Fichier principal
Vignette du fichier
magoni-tett2015.pdf (452.56 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-01281862 , version 1 (02-03-2016)

Identifiants

Citer

Damien Magoni, Cyril Cassagnes. Dynamic Greedy Routing in Overlay Networks Using Virtual Coordinates from the Hyperbolic Plane. Transactions on emerging telecommunications technologies, 2015, ⟨10.1002/ett.2987⟩. ⟨hal-01281862⟩

Collections

CNRS
66 Consultations
156 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More