Local Empathy provides Global Minimization of Congestion in Communication Networks

Abstract

We present a novel mechanism to avoid congestion in complex networks based on local knowledge of traffic conditions and the ability of routers to self-coordinate their dynamical behavior. In particular, routers make use of local information about traffic conditions to either reject or accept information packets from their neighbors. We show that when nodes are only aware of their own congestion state they self-organize into a hierarchical configuration that delays remarkably the onset of congestion although, leading to a sharp first-order like congestion transition. We also consider the case when nodes are aware of the congestion state of their neighbors. In this case, we show that empathy between nodes is strongly beneficial to the overall performance of the system and it is possible to achieve larger values for the critical load together with a smooth, second-order like, transition. Finally, we show how local empathy minimize the impact of congestion as much as global minimization. Therefore, here we present an outstanding example of how local dynamical rules can optimize the system's functioning up to the levels reached using global knowledge.

8 pages, 6 figures

References in corpus (25)

• Critical phenomena in complex networks
• Efficient Immunization Strategies for Computer Networks and Populations
• Efficient routing on complex networks
• Navigability of Complex Networks
• Dynamics of jamming transitions in complex networks
• The entropy of randomized network ensembles
• Optimal routing on complex networks
• Entropy Rate of Diffusion Processes on Complex Networks
• Efficient local strategies for vaccination and network attack
• Congestion phenomena on complex networks
• Communication Bottlenecks in Scale-Free Networks
• Transport on Complex Networks: Flow, Jamming and Optimization
• On the universality of the scaling of fluctuations in traffic on complex networks
• Scaling breakdown in flow fluctuations on complex networks
• Immunization of Real Complex Communication Networks
• Traffic optimization in transport networks based on local routing
• Extended navigability of small world networks: exact results and new insights
• Annealed and Mean-Field formulations of Disease Dynamics on Static and Adaptive Networks
• Congestion-gradient driven transport on complex networks
• Distance-d covering problems in scale-free networks with degree correlations
• Collectively optimal routing for congested traffic limited by link capacity
• A minimal model for congestion phenomena on complex networks
• Navigating ultrasmall worlds in ultrashort time
• Jamming transition in traffic flow under the priority queuing protocol
• Global and Local Information in Traffic Congestion

Cited by in corpus (2)

• The effect of network structure on phase transitions in queuing networks
• Random walk with priorities in communication-like networks