Greedy routing performance analysis of network embedded in Hyperbolic and Euclidean Space

In a network, routing is the fundamental task. The routing has large overhead, due to which it is bottleneck to the performance and scalability of the network. The networks implementing Geographic Routing protocols are highly scalable as these allow stateless routing. The inconsistency between the two topologies, the actual network topology and modelled network topology degrades the performance of the network. The performance of the network increases if the networks are embedded in Hyperbolic Space rather than Euclidean Space. In this paper, we evaluate the performance of greedy routing in networks embedded in Hyperbolic Space and Euclidean Space. The evaluation is done on success percentage and hop stretch metrics.