\n The problem of efficient transport on a complex network is studied in this paper. We find that there exists an optimal way to allocate resources for information processing on each node to achieve the best transport capacity of the network, or the largest input information rate which does not cause jamming in network traffic, provided that the network structure and routing strategy are given. More interestingly, this achievable network capacity limit is closely related to the topological structure of the network, and is actually inversely proportional to the average distance of the network, measured according to the same routing rule.\n
Xiaofeng GongKun LiChih‐Huang Lai
Weikai LiuZhi‐Hong GuanRuiquan Liao
Fan WuYuming MaoXiaoyan HuangSupeng Leng
Weikai LiuZhi‐Hong GuanRuiquan Liao