Congestion and decongestion in a communication network

Preprint

15 April 2004

preprint
Published by arXiv in arXiv

https://doi.org/10.48550/arXiv.cond-mat/0404353

Abstract

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.

Keywords

DIMENSIONAL COMMUNICATION
COMMUNICATION NETWORK
CONNECTIONS TO HUBS
TRAFFIC DYNAMICS
STUDY NETWORK
DECONGESTION
CONGESTION

All Related Versions

Version 1, 2004-04-15, ArXiv
Published version: Physical Review E, 71 (5), 055103.

This publication has 0 references indexed in Scilit: