Asymmetrical Multi-path Selection Game for Wireless Overlay Networks

In order to transfer the increasing big data we need to make use of multiple wireless paths. Overlay networks provide the possibility of taking advantage of multiple available routing paths to realize the bandwidth aggregating. We present a game-theoretic study of the selfish strategic collaboration of multiple heterogeneous overlays when they are allowed to use massively-multipath transfer. Overlays are modeled as players in this multipath selection game model, we discuss the asymmetric case where all overlays have the different round trip times (RTT) and different wastefulness level, and demonstrate the existence and uniqueness of Nash equilibrium (NE). Then we find overlays differing only in their RTTs still receive equal throughput shares and utilities at the NE. However, if overlays differ only in their wastefulness levels, a more wasteful overlay has a larger utility and a larger throughput (bandwidth) share than a less wasteful overlay.

[1]  Edward W. Knightly,et al.  Opportunistic traffic scheduling over multiple network paths , 2004, IEEE INFOCOM 2004.

[2]  Krishna R. Pattipati,et al.  Application-layer multipath data transfer via TCP: Schemes and performance tradeoffs , 2007, Perform. Evaluation.

[3]  Gabriel-Miro Muntean,et al.  Game Theory-Based Network Selection: Solutions and Challenges , 2012, IEEE Communications Surveys & Tutorials.

[4]  Jörg Widmer,et al.  TCP Friendly Rate Control (TFRC): Protocol Specification , 2003, RFC.

[5]  Ming Zhang,et al.  Proceedings of the General Track: 2004 USENIX Annual Technical Conference , 2022 .

[6]  Jingyu Wang,et al.  On the collaborations of multiple selfish overlays using multi-path resources , 2015, Peer-to-Peer Netw. Appl..

[7]  Xiaomin Zhu,et al.  A multi-path mechanism for reliable VoIP transmission over wireless networks , 2008, Comput. Networks.

[8]  T. Başar,et al.  Dynamic Noncooperative Game Theory, 2nd Edition , 1998 .

[9]  Thomas Dreibholz,et al.  On the fairness of transport protocols in a multi-path environment , 2012, 2012 IEEE International Conference on Communications (ICC).

[10]  Mark Handley,et al.  RFC 5348: TCP Friendly Rate Control (TFRC): Protocol Specification , 2008 .

[11]  T. Başar,et al.  Dynamic Noncooperative Game Theory , 1982 .

[12]  Alagan Anpalagan,et al.  A Survey of Distributed Relay Selection Schemes in Cooperative Wireless Ad hoc Networks , 2012, Wirel. Pers. Commun..

[13]  Roch Guérin,et al.  How to Select a Good Alternate Path in Large Peer-to-Peer Systems? , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[14]  Mohsen Guizani,et al.  Game Theory for Wireless Communications and Networking , 2010 .

[15]  Mark Handley,et al.  Architectural Guidelines for Multipath TCP Development , 2011, RFC.

[16]  Alagan Anpalagan,et al.  On the Throughput Capacity of Cooperative Multi-hop Wireless Ad hoc Networks with Multi-flow , 2014, Wirel. Pers. Commun..

[17]  Christos H. Papadimitriou,et al.  Worst-case Equilibria , 1999, STACS.

[18]  Donald F. Towsley,et al.  Modeling TCP throughput: a simple model and its empirical validation , 1998, SIGCOMM '98.

[19]  Srinivasan Seshan,et al.  Selfish behavior and stability of the internet: a game-theoretic analysis of TCP , 2002, SIGCOMM.

[20]  Xiaomin Zhu,et al.  Introducing multipath selection for concurrent multipath transfer in the future internet , 2011, Comput. Networks.

[21]  Wei Wu,et al.  Toward a multiplane framework of NGSON: a required guideline to achieve pervasive services and efficient resource utilization , 2012, IEEE Communications Magazine.

[22]  Janardhan R. Iyengar,et al.  Concurrent multipath transfer using SCTP multihoming over independent end-to-end paths , 2006, TNET.

[23]  Krishna P. Gummadi,et al.  Improving the Reliability of Internet Paths with One-hop Source Routing , 2004, OSDI.