Euclidean versus hyperbolic congestion in idealized versus experimental networks

Internet Mathematics

Volumn 7, Issue 1, 2011, Pages 1-27

  Jonckheere, Edmond ^a   Lou, Mingji ^a   Bonahon, Francis ^a   Baryshnikov, Yuliy ^b  

^a University of Southern California   (United States)

^b LUCENT TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 80155171270     PISSN: 15427951     EISSN: None     Source Type: Journal    
DOI: 10.1080/15427951.2010.554320     Document Type: Article

References (25)

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