By Topic

Asymptotic traffic flow in a hyperbolic network

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Baryshnikov, Y. ; Univ. of Illinois at Urbana-Champaign, Urbana, IL, USA ; Tucci, G.H.

In this work we study the asymptotic traffic flow in Gromov 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) = β-d(u, v), where d(u, v) is the distance between the nodes. Then there exists a constant βc, that depends on the geometry of the network, such that if 1 <; β <; βc the traffic is global and there is a small set of highly congested nodes called the core. However, if β >; βc then the traffic is essentially local and the core is empty which implies very small congestion.

Published in:

Communications Control and Signal Processing (ISCCSP), 2012 5th International Symposium on

Date of Conference:

2-4 May 2012