Traffic congestion analysis in complex networks

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

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 proceeding › Conference article published in proceeding or book › Academic research › peer-review

9 Citations (Scopus)

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.

Original language	English
Title of host publication	ISCAS 2006
Subtitle of host publication	2006 IEEE International Symposium on Circuits and Systems, Proceedings
Pages	2625-2628
Number of pages	4
Publication status	Published - 1 Dec 2006
Event	ISCAS 2006: 2006 IEEE International Symposium on Circuits and Systems - Kos, Greece Duration: 21 May 2006 → 24 May 2006

Conference

Conference	ISCAS 2006: 2006 IEEE International Symposium on Circuits and Systems
Country/Territory	Greece
City	Kos
Period	21/05/06 → 24/05/06

ASJC Scopus subject areas

Electronic, Optical and Magnetic Materials
Electrical and Electronic Engineering

UN SDGs

This output contributes to the following UN Sustainable Development Goals (SDGs)

More information

http://hdl.handle.net/10397/749

Cite this

@inproceedings{45e7a3e3f8a34145a8272a61d786a53e,

title = "Traffic congestion analysis in complex networks",

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.",

author = "Yongxiang Xia and Tse, {Chi Kong} and Lau, {Chung Ming} and Tam, {Wai Man} and Xiuming Shant",

year = "2006",

month = dec,

day = "1",

language = "English",

isbn = "0780393902",

pages = "2625--2628",

booktitle = "ISCAS 2006",

note = "ISCAS 2006: 2006 IEEE International Symposium on Circuits and Systems ; Conference date: 21-05-2006 Through 24-05-2006",

}

TY - GEN

T1 - Traffic congestion analysis in complex networks

AU - Xia, Yongxiang

AU - Tse, Chi Kong

AU - Lau, Chung Ming

AU - Tam, Wai Man

AU - Shant, Xiuming

PY - 2006/12/1

Y1 - 2006/12/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=34547376503&partnerID=8YFLogxK

M3 - Conference article published in proceeding or book

SN - 0780393902

SN - 9780780393905

SP - 2625

EP - 2628

BT - ISCAS 2006

T2 - ISCAS 2006: 2006 IEEE International Symposium on Circuits and Systems

Y2 - 21 May 2006 through 24 May 2006

ER -

Traffic congestion analysis in complex networks

Abstract

Conference

ASJC Scopus subject areas

UN SDGs

More information

Other files and links

Fingerprint

Cite this