Effective delivering capacity in traffic dynamics based on scale-free network

Simple item page
dc.creatorHe, Shan
dc.creatorLi, Sheng
dc.creatorMa, Hongru
dc.date2006-10-10
dc.date.accessioned2026-07-07T07:27:26Z
dc.date.available2026-07-07T07:27:26Z
dc.descriptionWe 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.
dc.description11 pages, 3 figures
dc.identifierhttps://arxiv.org/abs/cond-mat/0610251
dc.identifierhttp://arxiv.org/abs/cond-mat/0610251
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/117374
dc.subjectStatistical Mechanics
dc.titleEffective delivering capacity in traffic dynamics based on scale-free network
dc.typetext

Files

Collections

arXiv