Probability routing strategy for scale-free networks |
| |
| Authors: | Xiaojun Zhang Zishu He Zheng He Lez Rayman-Bacchus |
| |
| Institution: | 1. School of Mathematical Sciences, University of Electronic Science and Technology of China, Chengdu, 611731, PR China;2. School of Electronic Engineering, University of Electronic Science and Technology of China, Chengdu, 611731, PR China;3. School of Management and Economics, University of Electronic Science and Technology of China, Chengdu, 611731, PR China;4. London Metropolitan University, London, N7 8HN, UK |
| |
| Abstract: | This study proposes a probability routing strategy for improving traffic capability on scale-free networks. Compared with the shortest path routing strategy depending on central nodes largely and the efficient routing strategy avoiding hub routers as much as possible, the probability routing strategy makes use of hub routers more efficiently, transferring approximate average amount of packs of the whole network. Simulation results indicate that the probability routing strategy has the highest network capacity among the three routing strategies. This strategy provides network capacity that can be more than 30 times higher than that of the shortest path routing strategy and over 50% higher than that of the efficient routing strategy. In addition, the average routing path length of our proposed strategy is over 10% shorter than that of the efficient routing strategy and only about 10% longer than that of the shortest path routing strategy. |
| |
| Keywords: | Probability routing strategy Scale-free networks Network capacity Average routing path length |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
