Optimal structure of complex networks for minimizing traffic congestion

Liang Zhao, Thiago Henrique Cupertino, Kwangho Park, Ying-Cheng Lai, Xiaogang Jin

Research output: Contribution to journalArticle

22 Citations (Scopus)

Abstract

To design complex networks to minimize traffic congestion, it is necessary to understand how traffic flow depends on network structure. We study data packet flow on complex networks, where the packet delivery capacity of each node is not fixed. The optimal configuration of capacities to minimize traffic congestion is derived and the critical packet generating rate is determined, below which the network is at a free flow state but above which congestion occurs. Our analysis reveals a direct relation between network topology and traffic flow. Optimal network structure, free of traffic congestion, should have two features: uniform distribution of load over all nodes and small network diameter. This finding is confirmed by numerical simulations. Our analysis also makes it possible to theoretically compare the congestion conditions for different types of complex networks. In particular, we find that network with low critical generating rate is more susceptible to congestion. The comparison has been made on the following complex-network topologies: random, scale-free, and regular. (c) 2007 American Institute of Physics.

Original languageEnglish
Article number043103
Number of pages5
JournalChaos
Volume17
Issue number4
Early online date17 Oct 2007
DOIs
Publication statusPublished - Dec 2007

Keywords

  • communication
  • connectivity
  • tolerance
  • dynamics
  • model

Cite this

Zhao, L., Cupertino, T. H., Park, K., Lai, Y-C., & Jin, X. (2007). Optimal structure of complex networks for minimizing traffic congestion. Chaos, 17(4), [043103]. https://doi.org/10.1063/1.2790367

Optimal structure of complex networks for minimizing traffic congestion. / Zhao, Liang; Cupertino, Thiago Henrique; Park, Kwangho; Lai, Ying-Cheng; Jin, Xiaogang.

In: Chaos, Vol. 17, No. 4, 043103, 12.2007.

Research output: Contribution to journalArticle

Zhao, L, Cupertino, TH, Park, K, Lai, Y-C & Jin, X 2007, 'Optimal structure of complex networks for minimizing traffic congestion', Chaos, vol. 17, no. 4, 043103. https://doi.org/10.1063/1.2790367
Zhao L, Cupertino TH, Park K, Lai Y-C, Jin X. Optimal structure of complex networks for minimizing traffic congestion. Chaos. 2007 Dec;17(4). 043103. https://doi.org/10.1063/1.2790367
Zhao, Liang ; Cupertino, Thiago Henrique ; Park, Kwangho ; Lai, Ying-Cheng ; Jin, Xiaogang. / Optimal structure of complex networks for minimizing traffic congestion. In: Chaos. 2007 ; Vol. 17, No. 4.
@article{355738a4a2714b7f9b79e9ae306c5b00,
title = "Optimal structure of complex networks for minimizing traffic congestion",
abstract = "To design complex networks to minimize traffic congestion, it is necessary to understand how traffic flow depends on network structure. We study data packet flow on complex networks, where the packet delivery capacity of each node is not fixed. The optimal configuration of capacities to minimize traffic congestion is derived and the critical packet generating rate is determined, below which the network is at a free flow state but above which congestion occurs. Our analysis reveals a direct relation between network topology and traffic flow. Optimal network structure, free of traffic congestion, should have two features: uniform distribution of load over all nodes and small network diameter. This finding is confirmed by numerical simulations. Our analysis also makes it possible to theoretically compare the congestion conditions for different types of complex networks. In particular, we find that network with low critical generating rate is more susceptible to congestion. The comparison has been made on the following complex-network topologies: random, scale-free, and regular. (c) 2007 American Institute of Physics.",
keywords = "communication, connectivity, tolerance, dynamics, model",
author = "Liang Zhao and Cupertino, {Thiago Henrique} and Kwangho Park and Ying-Cheng Lai and Xiaogang Jin",
year = "2007",
month = "12",
doi = "10.1063/1.2790367",
language = "English",
volume = "17",
journal = "Chaos",
issn = "1054-1500",
publisher = "American Institute of Physics",
number = "4",

}

TY - JOUR

T1 - Optimal structure of complex networks for minimizing traffic congestion

AU - Zhao, Liang

AU - Cupertino, Thiago Henrique

AU - Park, Kwangho

AU - Lai, Ying-Cheng

AU - Jin, Xiaogang

PY - 2007/12

Y1 - 2007/12

N2 - To design complex networks to minimize traffic congestion, it is necessary to understand how traffic flow depends on network structure. We study data packet flow on complex networks, where the packet delivery capacity of each node is not fixed. The optimal configuration of capacities to minimize traffic congestion is derived and the critical packet generating rate is determined, below which the network is at a free flow state but above which congestion occurs. Our analysis reveals a direct relation between network topology and traffic flow. Optimal network structure, free of traffic congestion, should have two features: uniform distribution of load over all nodes and small network diameter. This finding is confirmed by numerical simulations. Our analysis also makes it possible to theoretically compare the congestion conditions for different types of complex networks. In particular, we find that network with low critical generating rate is more susceptible to congestion. The comparison has been made on the following complex-network topologies: random, scale-free, and regular. (c) 2007 American Institute of Physics.

AB - To design complex networks to minimize traffic congestion, it is necessary to understand how traffic flow depends on network structure. We study data packet flow on complex networks, where the packet delivery capacity of each node is not fixed. The optimal configuration of capacities to minimize traffic congestion is derived and the critical packet generating rate is determined, below which the network is at a free flow state but above which congestion occurs. Our analysis reveals a direct relation between network topology and traffic flow. Optimal network structure, free of traffic congestion, should have two features: uniform distribution of load over all nodes and small network diameter. This finding is confirmed by numerical simulations. Our analysis also makes it possible to theoretically compare the congestion conditions for different types of complex networks. In particular, we find that network with low critical generating rate is more susceptible to congestion. The comparison has been made on the following complex-network topologies: random, scale-free, and regular. (c) 2007 American Institute of Physics.

KW - communication

KW - connectivity

KW - tolerance

KW - dynamics

KW - model

U2 - 10.1063/1.2790367

DO - 10.1063/1.2790367

M3 - Article

VL - 17

JO - Chaos

JF - Chaos

SN - 1054-1500

IS - 4

M1 - 043103

ER -