English

Asymptotic Traffic Flow in a Hyperbolic Network: Non-uniform Traffic

Group Theory 2012-03-09 v2 Statistical Mechanics Networking and Internet Architecture Mathematical Physics Metric Geometry math.MP

Abstract

In this work we study the asymptotic traffic flow in Gromov's hyperbolic graphs when the traffic decays exponentially with the distance. We prove that under general conditions, there exists a phase transition between local and global traffic. More specifically, assume that the traffic rate between two nodes uu and vv is given by R(u,v)=βd(u,v)R(u,v)=\beta^{-d(u,v)} where d(u,v)d(u,v) is the distance between the nodes. Then there exists a constant βc\beta_c that depends on the geometry of the network such that if 1<β<βc1<\beta<\beta_c the traffic is global and there is a small set of highly congested nodes called the core. However, if β>βc\beta>\beta_c then the traffic is essentially local and the core is empty which implies very small congestion.

Keywords

Cite

@article{arxiv.1010.3305,
  title  = {Asymptotic Traffic Flow in a Hyperbolic Network: Non-uniform Traffic},
  author = {Yuliy Baryshnikov and Gabriel H. Tucci},
  journal= {arXiv preprint arXiv:1010.3305},
  year   = {2012}
}

Comments

11 pages, 3 figures

R2 v1 2026-06-21T16:29:21.930Z