2004/04/15 by Brajendra K. Singh, Neelima Gupte · 1 citation
Computer Science · Physics and Astronomy · #Complex Network Analysis Techniques #Network Traffic and Congestion Control #Opinion Dynamics and Social Influence #cond-mat.stat-mech
paper · pdf · doi:10.1103/physreve.71.055103
published as PHYSICAL REVIEW E 71, 055103(R) (2005) · submitted to Phys Rev Lett, 3 figures
arxiv created 2004/04/15 · openalex publication_date 2005/05/31 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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 the finite capacity of the nodes. We discuss strategies to manipulate hub capacity and hub connections to relieve congestion and define a coefficient of betweenness centrality (CBC), a direct measure of network traffic, which is useful for identifying hubs that are most likely to cause congestion. The addition of assortative connections to hubs of high CBC relieves congestion very efficiently.