An optimal, strategy-proof scheme for multi-path traffic assignment in non-cooperative networks
An optimal, strategy-proof scheme for multi-path traffic assignment in non-cooperative networks
复制标题
DOI：
10.1109/twc.2010.03.080760
复制
发表时间：
2010-03
影响因子：
10.4
通讯作者：
Fan Wu;S. Zhong;Jiqiang Liu
中科院分区：
文献类型：
--
作者：
Fan Wu;S. Zhong;Jiqiang Liu
多路径路由作为网络中一种重要的路由策略一直被研究。许多多路径路由协议在多条路径之间调度流量以分配流量负载。然而，现有的具有流量分配的多路径路由协议要求网络中的所有节点都遵循该协议，当网络由自私节点组成时，这可能并不总是有效的假设。在本文中，我们提出了一个最佳的，策略证明计划的多路径流量分配（OSMA）在非合作网络。当使用OSMA时，诚实的行为是每个自私节点的最佳利益，而不管任何其他节点的行为。此外，我们的计划是保证计算最低成本的交通分配与存在这些自私的节点。我们的评估验证了我们的计划是最佳的和策略证明，并表明该计划具有很低的通信和计算开销。
Multi-path routing has long been studied as an important routing strategy in networks. Many multi-path routing protocols schedule traffic among multiple paths in order to distribute traffic load. However, existing multi-path 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 an optimal, strategy-proof scheme for multi-path traffic assignment (OSMA) in non-cooperative networks. When OSMA is used, behaving honestly is to the best interest of each selfish node regardless of any other nodes¿ behavior. Furthermore, our scheme is guaranteed to compute the lowest cost traffic assignment with the existence of these selfish nodes. Our evaluations verify that our scheme is optimal and strategy-proof, and demonstrate that the scheme has very low communication and computation overhead.