Traffic resource allocation for complex networks |
| |
| Authors: | Ling Xiang a Hu Mao-Bin b Long Jian-Cheng a Ding Jian-Xun a Shi Qin |
| |
| Affiliation: | a School of Transportation Engineering, Hefei University of Technology, Hefei 230009, China;b School of Engineering Science, University of Science and Technology of China, Hefei 230026, China |
| |
| Abstract: | In this paper, an optimal resource allocation strategy is proposed to enhance traffic dynamics in complex networks. The network resources are the total node packet-delivering capacity and the total link bandwidth. An analytical method is developed to estimate the overall network capacity by using the concept of efficient betweenness (ratio of algorithmic betweenness and local processing capacity). Three network structures (scale-free, small-world, and random networks) and two typical routing protocols (shortest path protocol and efficient routing protocol) are adopted to demonstrate the performance of the proposed strategy. Our results show that the network capacity is reversely proportional to the average path length for a particular routing protocol and the shortest path protocol can achieve the largest network capacity when the proposed resource allocation strategy is adopted. |
| |
| Keywords: | complex network shortest path protocol efficient routing protocol resource allocation strategy |
| 本文献已被 CNKI 维普 等数据库收录！ |
| 点击此处可从《中国物理 B》浏览原始摘要信息 |
|
点击此处可从《中国物理 B》下载免费的PDF全文 |
|
