Hybrid routing on scale-free networks
Adaptive routing
Equal-cost multi-path routing
DOI:
10.1016/j.physa.2013.04.032
Publication Date:
2013-04-24T05:32:25Z
AUTHORS (2)
ABSTRACT
Abstract We propose a novel routing algorithm to optimize traffic performance on complex networks. It combines static structural properties and dynamic traffic conditions together and therefore can balance the traffic between hubs and peripheral nodes more effectively. Simulation results show that the network capacity can be enhanced considerably, and the average traveling time is also shortened sharply, compared with the other two recently-proposed routing algorithms. The effect of the timescale over which the routing information is updated is also investigated. Moreover, a counter-intuitive and beneficial phenomenon about the average traveling time emerges when the packet generation rate is relatively high.
SUPPLEMENTAL MATERIAL
Coming soon ....
REFERENCES (34)
CITATIONS (54)
EXTERNAL LINKS
PlumX Metrics
RECOMMENDATIONS
FAIR ASSESSMENT
Coming soon ....
JUPYTER LAB
Coming soon ....