Euclidean versus Hyperbolic Congestion in Idealized versus Experimental Networks

Abstract This paper proposes a mathematical justification of the phenomenon of extreme congestion at a very limited number of nodes in very large networks. It is argued that this phenomenon occurs as a combination of the negative curvature property of the network together with minimum-length routing. More specifically, it is shown that in a large n-dimensional hyperbolic ball B of radius R viewed as a roughly similar model of a Gromov hyperbolic network, the proportion of traffic paths transiting through a small ball near the center is Θ(1), whereas in a Euclidean ball, the same proportion scales as Θ(1/R n−1). This discrepancy persists for the traffic load, which at the center of the hyperbolic ball scales as volume2(B), whereas the same traffic load scales as volume1+1/n (B) in the Euclidean ball. This provides a theoretical justification of the experimental exponent discrepancy observed by Narayan and Saniee between traffic loads in Gromov-hyperbolic networks from the Rocketfuel database and synthetic Euclidean lattice networks. It is further conjectured that for networks that do not enjoy the obvious symmetry of hyperbolic and Euclidean balls, the point of maximum traffic is near the center of mass of the network.

[1]  M. Bridson,et al.  Metric Spaces of Non-Positive Curvature , 1999 .

[2]  Ratul Mahajan,et al.  Measuring ISP topologies with Rocketfuel , 2004, IEEE/ACM Transactions on Networking.

[3]  Marco Zuniga,et al.  Curvature of Indoor Sensor Network: Clustering Coefficient , 2008, EURASIP J. Wirel. Commun. Netw..

[4]  Amin Vahdat,et al.  On curvature and temperature of complex networks , 2009, Physical review. E, Statistical, nonlinear, and soft matter physics.

[5]  Nong Ye,et al.  Onset of traffic congestion in complex networks. , 2005, Physical review. E, Statistical, nonlinear, and soft matter physics.

[6]  M. Berger.  Riemannian Geometry During the Second Half of the Twentieth Century , 2000 .

[7]  I. Holopainen.  Riemannian Geometry , 1927, Nature.

[8]  Jie Gao,et al.  Greedy routing with guaranteed delivery using Ricci flows , 2009, 2009 International Conference on Information Processing in Sensor Networks.

[9]  S. Helgason.  Differential Geometry and Symmetric Spaces , 1964 .

[10]  E. Jonckheere,et al.  Hyperbolic geometry of networks , 2003 .

[11]  Iraj Saniee,et al.  Large-scale curvature of networks. , 2009, Physical review. E, Statistical, nonlinear, and soft matter physics.

[12]  Alan Weinstein,et al.  RIEMANNIAN GEOMETRY DURING THE SECOND HALF OF THE TWENTIETH CENTURY (University Lecture Series 17) , 2001 .

[13]  E. Jonckheere,et al.  Upper bound on scaled Gromov-hyperbolic δ , 2007 .

[14]  Yusuke Higuchi.  Combinatorial curvature for planar graphs , 2001 .

[15]  Xingxing Yu,et al.  Positively curved cubic plane graphs are finite , 2004, J. Graph Theory.

[16]  Edmond A. Jonckheere,et al.  Scaled Gromov hyperbolic graphs , 2008, J. Graph Theory.

[17]  Jürgen Jost,et al.  Nonpositive Curvature: Geometric And Analytic Aspects , 1997 .

[18]  Bojan Mohar,et al.  An analogue of the Descartes-Euler formula for infinite graphs and Higuchi’s conjecture , 2007 .

[19]  E. Jonckheere,et al.  Geometry of network security , 2004, Proceedings of the 2004 American Control Conference.

[20]  Oded Schramm,et al.  Embeddings of Gromov Hyperbolic Spaces , 2000 .

[21]  Kyōto Daigaku. Sūgakuka.  Lectures in mathematics , 1968 .

[22]  J. Jost.  Riemannian geometry and geometric analysis , 1995 .