RESUMO
Based on a two-dimensional small-world network model, we propose an efficient routing strategy that enhances the network capacity while keeping the average packet travel time low. We deterministically increase the weight of the links attached to the "congestible nodes" and compute the effective distance of a path by summing up the weight of the links belong to that path. The routing cost of a node is a linear combination of the minimum effective distance from the node to the target and its queue length. The weight assignment reduces the maximum load of the network, while the incorporation of dynamic information further balances the traffic on the network. Simulation results show that the network capacity is much improved compared with the reference strategies, while the average packet travel time is relatively small.
