Related papers: The effect of bandwidth in scale-free network traf…
We propose and study a model of traffic in communication networks. The underlying network has a structure that is tunable between a scale-free growing network with preferential attachments and a random growing network. To model realistic…
In this paper, we study traffic dynamics in scale-free networks in which packets are generated with non-homogeneously selected sources and destinations, and forwarded based on the local routing strategy. We consider two situations of packet…
We investigate the percentage of delivering capacities that are actually consumed in a typical traffic dynamics where the capacities are uniformly assigned over a scale-free network. Theoretical analysis, as well as simulations, reveal that…
In this letter, we propose a new routing strategy with a single free parameter $\alpha$ only based on local information of network topology. In order to maximize the packets handling capacity of underlying structure that can be measured by…
We model information traffic on scale-free networks by introducing the node queue length L proportional to the node degree and its delivering ability C proportional to L. The simulation gives the overall capacity of the traffic system,…
In road traffic networks, large traffic volumes may lead to extreme delays. These severe delays are caused by the fact that, whenever the maximum capacity of a road is approached, speeds drop rapidly. Therefore, the focus in this paper is…
We study the information traffic in Barab\'asi-Albert scale free networks wherein each node has finite queue length to store the packets. It is found that in the case of shortest path routing strategy the networks undergo a first order…
This paper is concerned with the characterization of the relationship between topology and traffic dynamics. We use a model of network generation that allows the transition from random to scale free networks. Specifically, we consider three…
Recently, motivated by the pioneer works in revealing the small-world effect and scale-free property of various real-life networks, many scientists devote themselves to studying complex networks. In this paper, we give a brief review on the…
For realistic scale-free networks, we investigate the traffic properties of stochastic routing inspired by a zero-range process known in statistical physics. By parameters $\alpha$ and $\delta$, this model controls degree-dependent hopping…
Many transport processes on networks depend crucially on the underlying network geometry, although the exact relationship between the structure of the network and the properties of transport processes remain elusive. In this paper we…
This work addresses the problem of evaluating optimal link capacities of a packet-flow network for the objective of congestion minimization. We present a simple model of packet flow in networks and present a numerical approach to evaluate…
We consider the effects of network topology on the optimality of packet routing quantified by $\gamma_c$, the rate of packet insertion beyond which congestion and queue growth occurs. The key result of this paper is to show that for any…
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…
We introduce a model of information packet transport on networks in which the packets are posted by a given rate and move in parallel according to a local search algorithm. By performing a number of simulations we investigate the major…
The communication networks in real world often couple with each other to save costs, which results in any network does not have a stand-alone function and efficiency. To investigate this, in this paper we propose a transportation model on…
We apply statistical physics to study the task of resource allocation in random sparse networks with limited bandwidths for the transportation of resources along the links. Useful algorithms are obtained from recursive relations.…
We study the tolerance to congestion failures in communication networks with scale-free topology. The traffic load carried by each damaged element in the network must be partly or totally redistributed among the remaining elements.…
The paper is concerned with the interplay between network structure and traffic dynamics in a communications network, from the viewpoint of end-to-end performance of packet transfer. We use a model of network generation that allows the…
This letter propose a new model for characterizing traffic dynamics in scale-free networks. With a replotted road map of cities with roads mapped to vertices and intersections to edges, and introducing the road capacity L and its handling…