Euclidean versus Hyperbolic Congestion in Idealized versus Experimental Networks

References

• Ariaei , [Ariaei et al. 08] F. , Lou , M. , Jonckheere , E. , Krishnamachari , B. and Zuniga , M. 2008 . “Curvature of Indoor Sensor Network: Clustering Coefficient.” . EURASIP Journal on Wireless Communications and Networking , 2008 : 20
   Google Scholar
• Berger , [Berger 00] Marcel . 2000 . Riemannian Geometry during the Second Half of the Twentieth Century, University Lecture Series 17 , Providence : American Mathematical Society .
   Google Scholar
• Bonk , [Bonk and Schramm 00] M. and Schramm , O. 2000 . “Embeddings of Gromov Hyperbolic Spaces.” . Geom. Funct. Analysis , 10 : 266 – 306 .
   Web of Science ®Google Scholar
• Martin , [Bridson and Haefliger 99] R . 1999 . “ Bridson and André Haefliger ” . In Metric Spaces of Non-positive Curvature, A Series of Comprehensive Surveys in Mathematics 319 , New York : Springer .
   Google Scholar
• [Cisco 05] Cisco Systems . 2005 . “How Does Load Balancing Work?” . Document ID: 5212.
   Google Scholar
• DeVos , [DeVos and Mohar 07] M. and Mohar , B. 2007 . “An Analogue of the Descartes–Euler Formula for Infinite Graph and Higuchi's Conjecture.” . Transactions of the American Mathematical Society , 359 : 3275 – 3286 .
   Web of Science ®Google Scholar
• do Carmo , [do Carmo 92] M. P. 1992 . Riemannian Geometry , Boston : Birkhäuser .
   Google Scholar
• Helgason , [Helgason 00] S. 2000 . Differential Geometry and Symmetric Spaces , Providence : Chelsea .
   Google Scholar
• Higuchi , [Higuchi 01] Y. 2001 . “Combinatorial Curvature for Planar Graphs.” . J. of Graph Theory , 38 : 220 – 229 .
   Google Scholar
• Jonckheere , [Jonckheere and Lohsoonthorn 02] E. A. and Lohsoonthorn , P. July 2002 . “A Hyperbolic Geometry Approach to Multi-path Routing.” . In Proceedings of the 10th Mediterranean Conference on Control and Automation (MED 2002) , Portugal : Lisbon .
   Google Scholar
• Jonckheere , [Jonckheere and Lohsoonthorn 04] E. A. and Lohsoonthorn , P. June 2004 . “Geometry of Network Security.” . Boston, MA : Proceedings of the American Control Conference (ACC 2004) .
   Google Scholar
• Jonckheere , [Jonckheere et al. 08] E. , Lohsoonthorn , P. and Bonahon , F. 2008 . “Scaled Gromov Hyperbolic Graphs.” . Journal of Graph Theory , 57 : 157 – 180 .
   Web of Science ®Google Scholar
• Jonckheere , [Jonckheere et al. 10] E. , Ariaei , F. and Lohsoonthorn , P. 2010 . “Upper Bound on Scaled Hyperbolic Gromov Δ: 4-Point Condition.” . In Internet Mathematics
   Google Scholar
• Jost , [Jost 97] J. 1997 . Nonpositive Curvature: Geometric and Analytic Aspects, Lectures in Mathematics , Boston : Birkhäuser .
   Google Scholar
• Jost , [Jost 98] J. 1998 . Riemannian Geometry and Geometric Analysis, second edition , New York : Springer .
   Google Scholar
• Kobayashi , [Kobayashi and Nomizu 96] S. and Nomizu , K. 1996 . Foundation of Differential Geometry, volume 2 , New York : Wiley .
   Google Scholar
• Krioukov , [Krioukov et al. 09] D. , Papadopoulos , F. , Vahdat , A. and Boguna , M. 2009 . “Curvature and Temperature of Complex Networks.” . Physical Review E , 80 : 035101(R)
   Google Scholar
• Lohsoonthorn , [Lohsoonthorn 03] P. 2003 . “Hyperbolic Geometry of Networks.” . In PhD thesis , Department of Electrical Engineering–Systems, University of Southern California . (Available online at http://eudoxus.usc.edu/IW/MATTFINALTHESIS_MAIN.pdf.)
   Google Scholar
• Lou , [Lou 08] M. 2008 . “Traffic Pattern Analysis in Negatively Curved Networks.” . In PhD thesis , University of Southern California . (Available online at http://eudoxus.usc.edu/IW/Mingji-PhD-Thesis.pdf.)
   Google Scholar
• Narayan , [Narayan and Saniee 09] O. and Saniee , I. 2009 . “The Large Scale Curvature of Networks.” . arXiv:0907.1478v1.
   Google Scholar
• Réti , [Réti et al. 05] T. , Bitay , E. and Kosztolányi , Z. 2005 . On the Polyhedral Graphs with Positive Curvature. . Acta Polytechnica Hungarica , 2 ( 2 ) : 19 – 37 .
   Google Scholar
• Sarkar , [Sarkar et al. 09] R. , Yin , X. , Gao , J. , Luo , F. and Gu , X. D. April 2009 . “Greedy Routing with Guaranteed Delivery Using Ricci Flows.” . In Proceedings of the 8th International Symposium on Information Processing in Sensor Networks (IPSN)
   Google Scholar
• Spring , [Spring et al. 04] N. , Mahajan , R. , Wetherall , D. and Anderson , T. 2004 . “Measuring ISP Topologies with Rocketfuel.” . IEEE Transactions on Networking , 12 ( 1 ) : 2 – 16 .
   Web of Science ®Google Scholar
• Liang , [Sun and Yu 04] Sun and Xingxing , Yu . 2004 . “Positively Curved Cubic Plane Graphs Are Finite.” . Journal of Graph Theory , 47 ( 4 ) : 241 – 274 .
   Google Scholar
• Zhao , [Zhao et al. 05] L. , Lai , Y.-C. , Park , K. and Ye , N. 2005 . “Onset of Traffic Congestion in Complex Networks.” . Physical Review E , 71 : 026125–1 – 026125–8 .
   Google Scholar