Abstract
Optimal paths connecting randomly selected network nodes and fixed routers are studied analytically in the presence of a nonlinear overlap cost that penalizes congestion. Routing becomes more difficult as the number of selected nodes increases and exhibits ergodicity breaking in the case of multiple routers. The ground state of such systems reveals nonmonotonic complex behaviors in average path length and algorithmic convergence, depending on the network topology, and densities of communicating nodes and routers. A distributed linearly scalable routing algorithm is also devised. © 2012 American Physical Society.
| Original language | English |
|---|---|
| Article number | 208701 |
| Number of pages | 5 |
| Journal | Physical Review Letters |
| Volume | 108 |
| Issue number | 20 |
| DOIs | |
| Publication status | Published - 14 May 2012 |