Abstract
The traditional heavy-tailed interpretation of congestion is challenged in this paper. A counter example shows that a network with uniform degree can have significant traffic congestion when the degree is larger than 6. A profound understanding of what causes congestion is reestablished, based on the network curvature theorem. A load balancing algorithm based on curvature control is presented with network applications.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 134-149 |
| Number of pages | 16 |
| Journal | International Journal of Computers, Communications and Control |
| Volume | 6 |
| Issue number | 1 |
| DOIs | |
| State | Published - 2011 |
| Externally published | Yes |
Keywords
- Curvature
- Gromov hyperbolic graphs
- Inertia
- Load balancing
- Network congestion
- Poincaré disk
- Yamabe flow
ASJC Scopus subject areas
- Computer Science Applications
- Computer Networks and Communications
- Computational Theory and Mathematics