A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Cost-Effective Traffic Assignment for Multipath Routing in Selfish Networks
2007
IEEE GLOBECOM 2007-2007 IEEE Global Telecommunications Conference
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,
doi:10.1109/glocom.2007.91
dblp:conf/globecom/WuZL07
fatcat:pxkrt7rvxzhfzcn5pr6b6u47za