Optimal resource allocation on heterogeneous complex transport networks

In recent years, for the investigation of traffic-flow dynamics on complex networks, many existing works have focused on improving the networks resilience of congestion to enhance the transport capacity of the networks. The study in this direction can be roughly classified into two categories. One involves adjusting the topology structure of the underlying network and the other designing better routing strategies. However, the crucial role taken by the distribution of resources is largely ignored. In this paper, the problem of optimal resource allocation on heterogeneous complex transport networks is studied. An explicit analytical solution is provided, which is based on M/M/1 queueing theory and optimization principle, provided that the network structure and routing strategy are given. Finally, an order parameter simulation example by comparing results with those obtained via simple resource allocation in large Barabasi-Albert (BA) scale-free network is provided to illustrate the effectiveness of the theoretical results.