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

Greedy routing algorithms based on virtual coordi-nates 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 en-sured 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 em-bedding 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.