An Optimal, Strategy-Proof Scheme for Multi-Path Traffic Assignment in Non-Cooperative Networks

被引：3

作者：

Wu, Fan ^{[1
]}

Zhong, Sheng ^{[1
]}

Liu, Jiqiang ^{[2
]}

机构：

[1] SUNY Buffalo, Dept Comp Sci & Engn, Buffalo, NY 14260 USA

[2] Beijing Jiao Tong Univ, Sch Comp & Informat Technol, Beijing 100044, Peoples R China

来源：

IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS | 2010年 / 9卷 / 03期

关键词：

Routing; traffic assignment; mechanism design;

D O I：

10.1109/TWC.2010.03.080760

中图分类号：

TM [电工技术]; TN [电子技术、通信技术];

学科分类号：

0808 ; 0809 ;

摘要：

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.

引用

页码：1012 / 1021

页数：10