Network coding games with unicast flows

被引：24

作者：

Price, Jennifer ^{[1
]}

Javidi, Tara ^{[2
]}

机构：

[1] Univ Colorado, Dept Elect & Comp Engn, Colorado Springs, CO 80918 USA

[2] Univ Calif San Diego, Dept Elect & Comp Engn, La Jolla, CA 92093 USA

来源：

IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS | 2008年 / 26卷 / 07期

基金：

美国国家科学基金会;

关键词：

network coding; game theory; dominant strategies; network capacity;

D O I：

10.1109/JSAC.2008.080927

中图分类号：

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

学科分类号：

0808 ; 0809 ;

摘要：

To implement network coding, users need to coordinate and cooperate with respect to their strategies in terms of duplicating and transmitting side information across specific parts of the network. In unicast applications where users have no inherent interest in providing (or concealing) their information to (or from) any destinations except for their unique one, this assumption becomes critical in the face of users' autonomy. This paper addresses the issue of cooperation in unicast network coding via a game theoretic approach. Implementation of a given network coding scheme induces a network coding game among source-destination pairs (users). In a network with autonomous and rational unicast flows, the equilibrium properties (as well as efficiency) of a network coding scheme is shown to be related to the properties of the corresponding network coding game. In a simple generalization of butterfly networks with two users, we propose a network coding scheme whose capacity achieving operation coincides with users' dominant strategies.

引用

页码：1302 / 1316

页数：15