Optimal Assignment of Delivery Capacity for Network with Constraint

For scale-free networks, traffic flow moving freely on a complex network is important to its normal and efficient functioning. In order to enhance the network efficiency, for a capacity-limited network, in this paper, we propose a new distribution algorithm by introducing an adjustable parameter ß to control and distribute the delivery capacity of single node dynamically. The simulations reveal that there is an optimal parameter to make the delivery efficiency best. Finally, based on the relationship between degree and load distribution (we define load at each node as the accumulated total number of packets passing through that node when every pair of nodes send and receive a packet along the shortest paths), further analysis about the effectiveness is presented.