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

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

2010-10-16

arxiv.org/abs/1010.3305v2

Mathematics

Group Theory

11 pages, 3 figures

Scientific paper

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 $u$ and $v$ is given by $R(u,v)=\beta^{-d(u,v)}$ where $d(u,v)$ is the distance between the nodes. Then there exists a constant $\beta_c$ that depends on the geometry of the network such that if $1<\beta<\beta_c$ the traffic is global and there is a small set of highly congested nodes called the core. However, if $\beta>\beta_c$ then the traffic is essentially local and the core is empty which implies very small congestion.

Affiliated with

Also associated with

No associations

Rating

Asymptotic Traffic Flow in a Hyperbolic Network: Non-uniform Traffic does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Asymptotic Traffic Flow in a Hyperbolic Network: Non-uniform Traffic, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Asymptotic Traffic Flow in a Hyperbolic Network: Non-uniform Traffic will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-181625