Open AccessAn efficient management strategy for enhancing traffic capacity in scale-free networks
Author(s) -
Jun Cai,
Yu Shu
Publication year - 2013
Publication title -
wuli xuebao
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.199
H-Index - 47
ISSN - 1000-3290
DOI - 10.7498/aps.62.058901
Subject(s) - computer science , routing (electronic design automation) , computer network , shortest path problem , adjacency matrix , transmission (telecommunications) , adjacency list , path (computing) , distributed computing , topology (electrical circuits) , telecommunications , mathematics , algorithm , theoretical computer science , graph , combinatorics
Previous research has shown that the community structure of the network well significantly affect information transmission, and the obvious community structure will significantly reduce the network transmission performance. To address the problem, first we define the link importance to communities, which is based on the spectrum of network adjacency matrix. Then we propose a topological management strategy called community weaken control strategy (CWCS) to enhance traffic capacity, which weakens the community structures by logically closing or cutting some links with great link importance. We implement the scheme in both a global shortest-path routing strategy and local routing strategy, and compare it with the previous scheme HDF 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. Under the local routing strategy, the traffic capacity can also be greatly enhanced when the tunable parameter lies in a range from 0 and 2.