We propose a new routing strategy for controlling packet routing on complex networks. The
delivery capability of each node is adopted as a piece of local information to be integrated …

We suggest an optimal form of traffic awareness already introduced as a routing protocol
which combines structural and local dynamic properties of the network to determine the …

Traffic capacity is critical for various networks and strongly depends on the distribution of
link's bandwidth resources. In this paper, we propose a betweenness-based bandwidth …

The traffic dynamics of multi-layer networks has become a hot research topic since many
networks are comprised of two or more layers of subnetworks. Due to its low traffic capacity …

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 …

This paper models the effects of bandwidth on the traffic capacity of scale-free networks. We
investigate the decrease of the system traffic capacity and the variation of the optimal local …

In the present paper, we consider three different types of networks (random, small-world,
and scale-free) with dynamic weights and focus on how the characteristic parameters …

We study the traffic dynamics in complex networks where each link is assigned a limited and
identical bandwidth. Although the first-in–first-out (FIFO) queuing rule is widely applied in the …

We propose a packet routing strategy with a tunable parameter α based on the local
structural information of a scale-free network. As free traffic flow on the communication …

We propose a limited packet-delivering capacity model for traffic dynamics in scale-free
networks. In this model, the total node's packet-delivering capacity is fixed, and the …