Traffic congestion analysis in complex networks

Yongxiang Xia, Chi Kong Tse, Chung Ming Lau, Wai Man Tam, Xiuming Shant

Research output: Chapter in book / Conference proceedingConference article published in proceeding or bookAcademic researchpeer-review

9 Citations (Scopus)


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.
Original languageEnglish
Title of host publicationISCAS 2006
Subtitle of host publication2006 IEEE International Symposium on Circuits and Systems, Proceedings
Number of pages4
Publication statusPublished - 1 Dec 2006
EventISCAS 2006: 2006 IEEE International Symposium on Circuits and Systems - Kos, Greece
Duration: 21 May 200624 May 2006


ConferenceISCAS 2006: 2006 IEEE International Symposium on Circuits and Systems

ASJC Scopus subject areas

  • Electronic, Optical and Magnetic Materials
  • Electrical and Electronic Engineering


Dive into the research topics of 'Traffic congestion analysis in complex networks'. Together they form a unique fingerprint.

Cite this