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

TL;DR

This paper introduces a model for traffic flow in scale-free networks with limited capacity, optimizing node capacity allocation to maximize network throughput under different routing strategies.

Contribution

It proposes a capacity allocation model based on node degree and identifies an optimal parameter for maximizing network capacity in scale-free networks.

Findings

Existence of an optimal capacity allocation parameter $$ for maximum network capacity.

Optimal $$ depends on routing strategy and network structure.

The model explains how capacity distribution influences traffic flow efficiency.

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}^{\phi}$, where $k_{i}$ is the degree of node $i$ and $\phi$ 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 $\phi$ leading to the maximal network capacity under both routing strategies. We provide some explanations for the emergence of optimal $\phi$.