Abrupt transition to complete congestion on complex networks and control

Wen-Xu Wang, Zhi-Xi Wu, Rui Jiang, Guanrong Chen, Ying-Cheng Lai

Research output: Contribution to journalArticle

36 Citations (Scopus)

Abstract

Previous works on traffic-flow dynamics on complex networks have mostly focused on continuous phase transition from a free-flow state to a locally congested state as a parameter, such as the packet-generating rate, is increased through a critical value. Above the transition point congestion occurs on a small subset of nodes. Utilizing a conventional traffic-flow model based on the packet birth-death process and more importantly, taking into account the fact that in realistic networks nodes have only finite buffers, we find an abrupt transition from free flow to complete congestion. Slightly below the transition point, the network can support the maximum amount of traffic for some optimal value of the routing parameter. We develop a mean-field theory to explain the surprising transition phenomenon and provide numerical support. Furthermore, we propose a control strategy based on the idea of random packet dropping to prevent/break complete congestion. Our finding provides insights into realistic communication networks where complete congestion can occur directly from a free-flow state without any apparent precursor, and our control strategy can be effective to restore traffic flow once complete congestion has occurred.

Original languageEnglish
Article number033106
Number of pages7
JournalChaos
Volume19
Issue number3
Early online date24 Jul 2009
DOIs
Publication statusPublished - Sep 2009

Keywords

  • complex networks
  • random processes
  • telecommunication networks
  • traffic
  • routing strategy
  • dynamics

Cite this

Wang, W-X., Wu, Z-X., Jiang, R., Chen, G., & Lai, Y-C. (2009). Abrupt transition to complete congestion on complex networks and control. Chaos, 19(3), [033106]. https://doi.org/10.1063/1.3184539

Abrupt transition to complete congestion on complex networks and control. / Wang, Wen-Xu; Wu, Zhi-Xi; Jiang, Rui; Chen, Guanrong; Lai, Ying-Cheng.

In: Chaos, Vol. 19, No. 3, 033106, 09.2009.

Research output: Contribution to journalArticle

Wang, W-X, Wu, Z-X, Jiang, R, Chen, G & Lai, Y-C 2009, 'Abrupt transition to complete congestion on complex networks and control', Chaos, vol. 19, no. 3, 033106. https://doi.org/10.1063/1.3184539
Wang, Wen-Xu ; Wu, Zhi-Xi ; Jiang, Rui ; Chen, Guanrong ; Lai, Ying-Cheng. / Abrupt transition to complete congestion on complex networks and control. In: Chaos. 2009 ; Vol. 19, No. 3.
@article{cfb4f9084edf4f26bed0a8c28047ed14,
title = "Abrupt transition to complete congestion on complex networks and control",
abstract = "Previous works on traffic-flow dynamics on complex networks have mostly focused on continuous phase transition from a free-flow state to a locally congested state as a parameter, such as the packet-generating rate, is increased through a critical value. Above the transition point congestion occurs on a small subset of nodes. Utilizing a conventional traffic-flow model based on the packet birth-death process and more importantly, taking into account the fact that in realistic networks nodes have only finite buffers, we find an abrupt transition from free flow to complete congestion. Slightly below the transition point, the network can support the maximum amount of traffic for some optimal value of the routing parameter. We develop a mean-field theory to explain the surprising transition phenomenon and provide numerical support. Furthermore, we propose a control strategy based on the idea of random packet dropping to prevent/break complete congestion. Our finding provides insights into realistic communication networks where complete congestion can occur directly from a free-flow state without any apparent precursor, and our control strategy can be effective to restore traffic flow once complete congestion has occurred.",
keywords = "complex networks, random processes, telecommunication networks, traffic, routing strategy, dynamics",
author = "Wen-Xu Wang and Zhi-Xi Wu and Rui Jiang and Guanrong Chen and Ying-Cheng Lai",
year = "2009",
month = "9",
doi = "10.1063/1.3184539",
language = "English",
volume = "19",
journal = "Chaos",
issn = "1054-1500",
publisher = "American Institute of Physics",
number = "3",

}

TY - JOUR

T1 - Abrupt transition to complete congestion on complex networks and control

AU - Wang, Wen-Xu

AU - Wu, Zhi-Xi

AU - Jiang, Rui

AU - Chen, Guanrong

AU - Lai, Ying-Cheng

PY - 2009/9

Y1 - 2009/9

N2 - Previous works on traffic-flow dynamics on complex networks have mostly focused on continuous phase transition from a free-flow state to a locally congested state as a parameter, such as the packet-generating rate, is increased through a critical value. Above the transition point congestion occurs on a small subset of nodes. Utilizing a conventional traffic-flow model based on the packet birth-death process and more importantly, taking into account the fact that in realistic networks nodes have only finite buffers, we find an abrupt transition from free flow to complete congestion. Slightly below the transition point, the network can support the maximum amount of traffic for some optimal value of the routing parameter. We develop a mean-field theory to explain the surprising transition phenomenon and provide numerical support. Furthermore, we propose a control strategy based on the idea of random packet dropping to prevent/break complete congestion. Our finding provides insights into realistic communication networks where complete congestion can occur directly from a free-flow state without any apparent precursor, and our control strategy can be effective to restore traffic flow once complete congestion has occurred.

AB - Previous works on traffic-flow dynamics on complex networks have mostly focused on continuous phase transition from a free-flow state to a locally congested state as a parameter, such as the packet-generating rate, is increased through a critical value. Above the transition point congestion occurs on a small subset of nodes. Utilizing a conventional traffic-flow model based on the packet birth-death process and more importantly, taking into account the fact that in realistic networks nodes have only finite buffers, we find an abrupt transition from free flow to complete congestion. Slightly below the transition point, the network can support the maximum amount of traffic for some optimal value of the routing parameter. We develop a mean-field theory to explain the surprising transition phenomenon and provide numerical support. Furthermore, we propose a control strategy based on the idea of random packet dropping to prevent/break complete congestion. Our finding provides insights into realistic communication networks where complete congestion can occur directly from a free-flow state without any apparent precursor, and our control strategy can be effective to restore traffic flow once complete congestion has occurred.

KW - complex networks

KW - random processes

KW - telecommunication networks

KW - traffic

KW - routing strategy

KW - dynamics

U2 - 10.1063/1.3184539

DO - 10.1063/1.3184539

M3 - Article

VL - 19

JO - Chaos

JF - Chaos

SN - 1054-1500

IS - 3

M1 - 033106

ER -