In this paper, we study the information traffic flow in communication networks with scale-free topology. We consider the situation arising when packets are delivered to non-homogeneously selected destinations. It is found that the network capacity Rc increases with the increase of 〈k〉...

In this paper, the packet traffic flow on weighted scale-free networks is investigated based on the local routing strategy using link weights: Pl→i=wliα∑jwljα. The capacity of links is controlled by max(βwlj,1), and the capacity of nodes is controlled by node strength: max(γsi,1). It is...