Efficient routing strategies in scale-free networks with limited bandwidth

Abstract

We study the traffic dynamics in complex networks where each link is assigned a limited and identical bandwidth. Although the first-in-first-out (FIFO) queuing rule is widely applied in the routing protocol of information packets, here we argue that if we drop this rule, the overall throughput of the network can be remarkably enhanced. We proposed some efficient routing strategies that do not strictly obey the FIFO rule. Comparing with the routine shortest path strategy, the throughput for both Barabási-Albert (BA) networks and the real Internet, the throughput can be improved more than five times. We calculate the theoretical limitation of the throughput. In BA networks, our proposed strategy can achieve 88% of the theoretical optimum, yet for the real Internet, it is about 12%, implying that we have a huge space to further improve the routing strategy for the real Internet. Finally we discuss possibly promising ways to design more efficient routing strategies for the Internet.

5 pages, 4 figures

References in corpus (15)

• Efficient routing on complex networks
• Dynamics of jamming transitions in complex networks
• Optimal routing on complex networks
• Integrating static and dynamic information for routing traffic
• On the universality of the scaling of fluctuations in traffic on complex networks
• Scaling breakdown in flow fluctuations on complex networks
• Transport optimization on complex networks
• An adaptive routing strategy for packet delivery in complex networks
• Resource allocation pattern in infrastructure networks
• An efficient approach of controlling traffic congestion in scale-free networks
• Congestion diffusion and decongestion strategy in networked traffic
• The effect of bandwidth in scale-free network traffic
• Fluctuation-driven capacity distribution in complex networks
• Preferential Behaviour and Scaling in Diffusive Dynamics on Networks
• Scaling behavior of an artificial traffic model on scale-free networks

Cited by in corpus (10)

• Vital nodes identification in complex networks
• Data Based Identification and Prediction of Nonlinear and Complex Dynamical Systems
• Accurate ranking of influential spreaders in networks based on dynamically asymmetric link-impact
• Traffic flow in a Manhattan-like urban system
• Traffic-driven epidemic spreading in correlated networks
• Transportation dynamics on coupled networks with limited bandwidth
• Optimal forwarding ratio on dynamical networks with heterogeneous mobility
• Efficient priority queueing routing strategy on mobile networks
• Study of dynamic and static routing for improvement of the transportation efficiency on small complex networks
• Improving the accuracy of the k-shell method by removing redundant links-from a perspective of spreading dynamics