Traffic dynamics in scale-free networks with limited packet-delivering capacity

Abstract

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 allocation of packet-delivering capacity on node $i$ is proportional to $k_i^{\varphi }$, where $k_i$ is the degree of node $i$ and $\varphi$ is a adjustable parameter. We have applied this model on the shortest path routing strategy as well as the local routing strategy, and found that there exists an optimal value of parameter $\varphi$ leading to the maximal network capacity under both routing strategies. We provide some explanations for the emergence of optimal $\varphi$.

References in corpus (7)

• Efficient routing on complex networks
• Integrating static and dynamic information for routing traffic
• An adaptive routing strategy for packet delivery in complex networks
• An efficient approach of controlling traffic congestion in scale-free networks
• Congestion and decongestion in a communication network
• Congestion diffusion and decongestion strategy in networked traffic
• The effect of bandwidth in scale-free network traffic

Cited by in corpus (4)

• Transportation dynamics on networks of mobile agents
• Information transport in multiplex networks
• Information transmission on hybrid networks
• Bufferless transmission in complex networks