Efficient routing on complex networks
| dc.creator | Yan, Gang | |
| dc.creator | Zhou, Tao | |
| dc.creator | Hu, Bo | |
| dc.creator | Fu, Zhong-Qian | |
| dc.creator | Wang, Bing-Hong | |
| dc.date | 2005-05-15 | |
| dc.date | 2005-08-18 | |
| dc.date.accessioned | 2026-07-07T06:29:14Z | |
| dc.date.available | 2026-07-07T06:29:14Z | |
| dc.description | In this letter, we propose a new routing strategy to improve the transportation efficiency on complex networks. Instead of using the routing strategy for shortest path, we give a generalized routing algorithm to find the so-called {\it efficient path}, which considers the possible congestion in the nodes along actual paths. Since the nodes with largest degree are very susceptible to traffic congestion, an effective way to improve traffic and control congestion, as our new strategy, can be as redistributing traffic load in central nodes to other non-central nodes. Simulation results indicate that the network capability in processing traffic is improved more than 10 times by optimizing the efficient path, which is in good agreement with the analysis. | |
| dc.description | 4 pages, 4 figures | |
| dc.identifier | https://arxiv.org/abs/cond-mat/0505366 | |
| dc.identifier | http://arxiv.org/abs/cond-mat/0505366 | |
| dc.identifier | Phys. Rev. E 73, 046108 (2006) | |
| dc.identifier | doi:10.1103/PhysRevE.73.046108 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/97961 | |
| dc.subject | Disordered Systems and Neural Networks | |
| dc.title | Efficient routing on complex networks | |
| dc.type | text |