Volume 74, Number 3, May 2006
|Page(s)||560 - 566|
|Section||Interdisciplinary physics and related areas of science and technology|
|Published online||29 March 2006|
Congestion in different topologies of traffic networks
State Key Laboratory of Rail Traffic Control and Safety, Beijing Jiaotong University Beijing, 100044, PRC
2 School of Traffic and Transportation, Beijing Jiaotong University Beijing, 100044, PRC
3 School of Economics and Management, Beijing University of Aeronautics and Astronautics - Beijing, 100083, PRC
Corresponding author: email@example.com
Accepted: 1 March 2006
In the present paper, we consider three different types of networks (random, small-world, and scale-free) with dynamic weights and focus on how the characteristic parameters (degree distribution exponent, rewiring probability, and clustering coefficient) affect the degree of congestion and the efficiency. Experiment simulation shows that the scale-free and small-world networks are more prone to suffering from congestion than random ones at low traffic flows, but the scale-free network is more sensitive than the small-world one. Compared with other two topologies, the scale-free network, while its congestion factor rises slowly, can support much more volume of traffic as the traffic flow increases. Results also indicate that for the same value of congestion factor, there may be a different efficiency, which shows that only congestion or efficiency alone cannot evaluate the performance of networks effectively.
PACS: 89.75.Hc – Networks and genealogical trees / 89.20.Hh – World Wide Web, Internet
© EDP Sciences, 2006
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.