Effective strategy of adding nodes and links for maximizing the traffic capacity of scale-free network
Research output: Journal Publications and Reviews › RGC 21 - Publication in refereed journal › peer-review
Author(s)
Related Research Unit(s)
Detail(s)
Original language | English |
---|---|
Article number | 33123 |
Journal / Publication | Chaos |
Volume | 20 |
Issue number | 3 |
Publication status | Published - 13 Jul 2010 |
Link(s)
Abstract
In this paper, we propose an efficient strategy to enhance traffic capacity via the process of nodes and links increment. We show that by adding shortcut links to the existing networks, packets are avoided flowing through hub nodes. We investigate the performances of our proposed strategy under the shortest path routing strategy and the local routing strategy. Our obtained results show that using the proposed strategy, the traffic capacity can be effectively enhanced under the shortest path routing strategy. Under the local routing strategy, the obtained results show that the proposed strategy is efficient only when packets are more likely to be forwarded to low-degree nodes in their routing paths. Compared with other strategies, the obtained results indicate that our proposed strategy of adding nodes and links is the most effective in enhancing the traffic capacity, i.e., the traffic capacity can be maximally enhanced with the least number of additional nodes and links. © 2010 American Institute of Physics.
Citation Format(s)
Effective strategy of adding nodes and links for maximizing the traffic capacity of scale-free network. / Huang, Wei; Chow, Tommy W.S.
In: Chaos, Vol. 20, No. 3, 33123, 13.07.2010.
In: Chaos, Vol. 20, No. 3, 33123, 13.07.2010.
Research output: Journal Publications and Reviews › RGC 21 - Publication in refereed journal › peer-review