Congestion and decongestion in a communication network

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

We study network traffic dynamics in a two dimensional communication network with regular nodes and hubs. If the network experiences heavy message traffic, congestion occurs due to finite capacity of the nodes. We discuss strategies to manipulate hub capacity and hub connections to relieve hub congestion. We find that the betweenness centrality (BC) criterion is useful for identifying hubs which are most likely to cause congestion, and that the addition of assortative connections to hubs of high BC relieves congestion most efficiently.
submitted to Phys Rev Lett, 3 figures

Keywords

Statistical Mechanics

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/95069

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/cond-mat/0404353
 http://arxiv.org/abs/cond-mat/0404353
 PHYSICAL REVIEW E 71, 055103(R) (2005)
 doi:10.1103/PhysRevE.71.055103

Collections

arXiv