Effective delivering capacity in traffic dynamics based on scale-free network
Shan He, Sheng Li, Hongru Ma
Abstract
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 there are a large number of idle nodes under both free and weak congested state of the network. It is worth noting that there is a critical value of effective betweenness to classify nodes in the congested state, below which the node has a constant queue size but above which the queue size increases with time. We also show that the consumption ratio of delivering capacities can be boosted to nearly 100% by adopting a proper distribution of the capacities, which at the same time enhances the network efficiency to the maximum for the current routing strategy.
Create a lesson
Related papers
Chemical potentials from structure factors: II. Charged multi-component mixtures
Xiaoyu Wang, Roya Savoj, Musahid Ahmed et al.
Asymmetry-controlled resonant transport in a Brownian flashing ratchet
Sudipta Mandal, Dipanjan Chakraborty, Debasish Chaudhuri
Branching stochastic mechanics. I. Clustering and connected correlations within a branching-process representation of the Schrödinger equation
Eric Dumonteil, Benoît Bischoff, Alain Letourneau et al.
Representation Transitions Reveal Predictive Structure in Complex Systems: A Trajectory-Level Reconstruction in a Critical System
Jiaqi Pan
Phase Diagram and Critical Behaviour of the Two-Dimensional Potts Model with Long-Range Quenched Disorder
Rodolfo Rocha, Leticia F. Cugliandolo, Marco Picco
Ornstein-Uhlenbeck Process Driven by Multiple Dichotomous Noises
Silvio Kalaj, Dongho Lee, Enzo Marinari et al.