Congestion and decongestion in a communication network

Simple item page
dc.creatorSingh, Brajendra K.
dc.creatorGupte, Neelima
dc.date2004-04-15
dc.date.accessioned2026-07-07T06:19:32Z
dc.date.available2026-07-07T06:19:32Z
dc.descriptionWe 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.
dc.descriptionsubmitted to Phys Rev Lett, 3 figures
dc.identifierhttps://arxiv.org/abs/cond-mat/0404353
dc.identifierhttp://arxiv.org/abs/cond-mat/0404353
dc.identifierPHYSICAL REVIEW E 71, 055103(R) (2005)
dc.identifierdoi:10.1103/PhysRevE.71.055103
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/95069
dc.subjectStatistical Mechanics
dc.titleCongestion and decongestion in a communication network
dc.typetext

Files

Collections

arXiv