A dynamic allocation mechanism of delivering capacity in coupled networks

Traffic process is ubiquitous in many critical infrastructures. In this paper, we introduce a mechanism to dynamically allocate the delivering capacity into the data-packet traffic model on the coupled Internet autonomous-system-level network of South Korea and Japan, and focus on its effect on the transport efficiency. In this mechanism, the total delivering capacity is constant and the lowest-load node will give one unit delivering capacity to the highest-load node at each time step. It is found that the delivering capacity of busy nodes and non-busy nodes can be well balanced and the effective betweenness of busy nodes with interconnections is significantly reduced. Consequently, the transport efficiency such as average traveling time and packet arrival rate is remarkably improved. Our work may shed some light on the traffic dynamics in coupled networks.