Cost-Effective Traffic Assignment for Multipath Routing in Selfish Networks

Multipath routing has long been studied as an important routing strategy in networks. Many multipath routing protocols schedule traffic among multiple paths in order to distribute traffic load. However, existing multipath routing protocols with traffic assignment require that all nodes in the network follow the protocol, which may not always be a valid assumption when the network consists of selfish nodes. In this paper, we propose a traffic assignment scheme to deal with the selfish behavior, which is proved to be strategy-proof. Under our scheme, behaving cooperatively is to the best interest of every node. Extensive evaluations are carried out to show that our scheme has good performance.