By Topic

Traffic congestion analysis in complex networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

5 Author(s)
Yongxiang Xia ; Dept. of Electron. & Inf. Eng., Hong Kong Polytech. Univ. ; Tse, C.K. ; Lau, F.C.M. ; Wai Man Tam
more authors

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

Published in:

Circuits and Systems, 2006. ISCAS 2006. Proceedings. 2006 IEEE International Symposium on

Date of Conference:

21-24 May 2006