[suyjuris]

> the routing complexity increases exponentially, which is the classic problem of routing issues on large graphs that literally every networked system has

I assume you are using “exponentially” in its informal meaning of “somewhat quickly” ? At least I am not aware of any routing issues that scale exponentially with the size of the graph.

To the contrary, if you can pick the graph structure then routing is not very difficult at all.