Efficient and robust routing on scale-free networks

► We propose a routing strategy based on a novel cost function. ► The cost function incorporates degrees of nodes in paths. ► The strategy distributes the traffic load almost uniformly in networks. ► The strategy greatly improves the network capacity. ► The strategy has strong robustness against cascading failures.