A game-theoretic analysis of inter-session network coding

IEEE International Conference on Communications

Volumn , Issue , 2009, Pages

  Mohsenian Rad, A Hamed ^a   Huang, Jianwei ^b   Wong, Vincent W S ^a   Jaggi, Sidharth ^b   Schober, Robert ^a  

^a UNIVERSITY OF BRITISH COLUMBIA   (Canada)

^b CHINESE UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

[No Author keywords available]

Indexed keywords

BOTTLENECK LINK; COOPERATIVE NETWORKS; DISCRIMINATORY PRICING; NASH EQUILIBRIA; NETWORK CODING; PACKET FORWARDING; PACKET FORWARDING NETWORK; PRICING SCHEME; SHARP CONTRAST; STRATEGIC BEHAVIOR; THEORETIC ANALYSIS; UTILITY FUNCTIONS; WIRED NETWORKS; WORST-CASE EFFICIENCY;

EID: 70449508639     PISSN: 05361486     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICC.2009.5198609     Document Type: Conference Paper

References (17)

1. R. Ahlswede, N. Cai, S. Li, and R. Yeung, "Network information flow," IEEE Trans. on Information Theory, vol. 46, pp. 1204-1216, Apr. 2000.
2. D. Traskov, N. Ratnakar, D. S. Lun, R. Koetter, and M. Medard, "Network coding for multiple unicasts: An approach based on linear optimization," in Proc. of IEEE ISIT, Seattle, WA, July 2006.
3. S. Katti, H. Rahul, W. Hu, D. Katabi, M. Medard, and J. Crowcroft, "XORs in the air: Practical wireless network coding," IEEE/ACM Trans. on Networking, vol. 16, pp. 497-510, Mar. 2008.
4. C. C. Wang and N. B. Shroff, "Beyond the butterfly: Graph-theoretic characterization of the feasibility of network coding with two simple unicast sessions," in Proc. of IEEE ISIT, Nice, France, June 2007.
5. F. P. Kelly, A. Maulloo, and D. Tan, "Rate control for communication networks: Shadow prices, proportional fairness and stability," Journal of Operations Research Society, vol. 49, pp. 237-252, Mar. 1998.
6. R. Johari and J. N. Tsitsiklis, "Efficiency loss in a network resource allocation game," Math. of Oper. Res., vol. 29, pp. 407-435, Aug. 2004.
7. -, "A scalable network resource allocation mechanism with bounded efficiency loss," IEEE J. on Selected Areas in Commun., vol. 24, no. 5, pp. 992-999, May 2006.
8. S. Sanghavi and B. Hajek, "Optimal allocation of a divisible good to strategic buyers," in Proc. of IEEE CDC, Atlantis, Bahamas, Dec. 2004.
9. D. Acemoglu and A. Ozdaglar, "Competition in parallel-serial networks," IEEE J. on Sel. Areas in Commun., pp. 1180-1192, June 2007.
10. S. Bhadra, S. Shakkottai, and P. Gupta, "Min-cost selfish multicast with network coding," IEEE Trans. on Information Theory, vol. 52, pp. 5077-5087, Nov. 2006.
11. Z. Li, "Cross-monotonic multicast," in Proc. of IEEE INFOCOM, Phoenix, AZ, Apr. 2008.
12. X. Liang, "Matrix games in the multicast networks: maximum information flows with network switching," IEEE Trans. on Information Theory, vol. 52, pp. 2433-2466, June 2006.
13. X. Zhang and B. Li, "Dice: a game theoretic framework for wireless multipath network coding," in Proc. of ACM MobiHoc, Hong Kong, China, May 2008.
14. J. Price and T. Javidi, "Network coding games with unicast flows," IEEE J. on Selected Areas in Commun., vol. 26, Sept. 2008.
15. J. Mo and J. Walrand, "Fair end-to-end window-based congestion control," IEEE/ACM Trans. on Net., vol. 8, pp. 556-567, Oct. 2000.
16. A. Mas-Colell, M. D. Whinston, and J. R. Green, Microeconomic Theory. Oxford University Press, 1995.
17. J. B. Rosen, "Existence and uniqueness of equilibrium points for concave n-person games," Econometrica, vol. 33, pp. 347-351, 1965.