Please use this identifier to cite or link to this item:
|Title:||Traffic congestion analysis in complex networks|
|Source:||ISCAS 2006 : 2006 IEEE International Symposium on Circuits and Systems : circuits and systems: at crossroads of life and technology : proceedings : May 21-24, 2006, Island of Kos, Greece, p. 2625-2628 How to cite?|
|Abstract:||The problem of traffic congestion in complex networks is studied. Two kinds of complex network structures, namely random graphs and scale-free networks, are considered. In terms of the structure of connection, random graphs are homogeneous networks whereas the scale-free networks are heterogeneous networks. For both types of networks, we introduce an additional scale-free feature in the load generation process such that a small number of nodes are more heavily loaded than others. A traffic model similar to the routing algorithm in computer networks is used in our simulation study. We show how the network structures and parameters influence the traffic congestion status.|
|Rights:||© 2006 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.|
This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holders.
|Appears in Collections:||Conference Paper|
Show full item record
Files in This Item:
|traffic-congestion_06.pdf||386.84 kB||Adobe PDF||View/Open|
Citations as of Dec 16, 2015
WEB OF SCIENCETM
Citations as of Feb 7, 2016
Checked on Feb 7, 2016
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.