Log In Sign Up

Routing in Strongly Hyperbolic Unit Disk Graphs

by   Thomas Bläsius, et al.

Greedy routing has been studied successfully on Euclidean unit disk graphs, which we interpret as a special case of hyperbolic unit disk graphs. While sparse Euclidean unit disk graphs exhibit grid-like structure, we introduce strongly hyperbolic unit disk graphs as the natural counterpart containing graphs that have hierarchical network structures. We develop and analyze a routing scheme that utilizes these hierarchies. On arbitrary graphs this scheme guarantees a worst case stretch of max{3, 1+2b/a} for a > 0 and b > 1. Moreover, it stores 𝒪(k(log^2n + logk)) bits at each vertex and takes 𝒪(k) time for a routing decision, where k = π e (1 + a)/(2(b - 1)) (b^2 diam(G) - 1) R + log_b(diam(G)) + 1, on strongly hyperbolic unit disk graphs with threshold radius R > 0. In particular, for hyperbolic random graphs, which have previously been used to model hierarchical networks like the internet, k = 𝒪(log^2n) holds asymptotically almost surely. Thus, we obtain a worst-case stretch of 3, 𝒪(log^4 n) bits of storage per vertex, and 𝒪(log^2 n) time per routing decision on such networks. This beats existing worst-case lower bounds. Our proof of concept implementation indicates that the obtained results translate well to real-world networks.


page 1

page 2

page 3

page 4


Recognizing Unit Disk Graphs in Hyperbolic Geometry is ∃ℝ-Complete

A graph G is a (Euclidean) unit disk graph if it is the intersection gra...

Expected Complexity of Routing in Θ 6 and Half-Θ 6 Graphs

We study online routing algorithms on the Θ6-graph and the half-Θ6-graph...

Routing in Unit Disk Graphs without Dynamic Headers

Let V⊂ℝ^2 be a set of n sites in the plane. The unit disk graph DG(V) of...

Eccentricity terrain of δ-hyperbolic graphs

A graph G=(V,E) is δ-hyperbolic if for any four vertices u,v,w,x, the tw...

Efficiently Approximating Vertex Cover on Scale-Free Networks with Underlying Hyperbolic Geometry

Finding a minimum vertex cover in a network is a fundamental NP-complete...

The idemetric property: when most distances are (almost) the same

We introduce the idemetric property, which formalises the idea that most...

Solving Vertex Cover in Polynomial Time on Hyperbolic Random Graphs

The VertexCover problem is proven to be computationally hard in differen...