Name
Abstract | ||
|---|---|---|
The community structure of the network will affect information transmission and the pronounced community structure will significantly reduce the network traffic capacity. In this paper, we propose a community weakening control strategy (CWCS) to enhance the network capacity by logically closing or cutting some links with high link importance to communities. We implement the strategy in both a global shortest-path routing policy and local routing policy, and compare it with the High-Degree-First strategy that removes the links among hub nodes. The simulation results show that the traffic capacity can be greatly enhanced and the average transport time is effectively reduced under the shortest path routing strategy. The traffic capacity can also be greatly enhanced under the local routing strategy when the tunable parameter α lies in a range from 0 to 2. WCS not only provides a method for enhancing network capacity, but also may be applied for suppressing the spread of malicious information in the network. |
Year | DOI | Venue |
|---|---|---|
2018 | 10.1016/j.future.2017.08.014 | Future Generation Computer Systems |
Keywords | Field | DocType |
Community structure,Link importance to community,Traffic capacity | Traffic capacity,Community structure,Shortest path problem,Computer science,Information transmission,Scale-free network,Distributed computing | Journal |
Volume | ISSN | Citations |
87 | 0167-739X | 18 |
PageRank | References | Authors |
0.60 | 4 | 6 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jun Cai | 1 | 373 | 39.29 |
| Yu Wang | 2 | 167 | 15.47 |
| Yan Liu | 3 | 241 | 73.08 |
| Jianzhen Luo | 4 | 21 | 1.70 |
| Wenguo Wei | 5 | 21 | 1.02 |
| Xiaoping Xu | 6 | 29 | 3.29 |