On the collaborations of multiple selfish overlays using multi-path resources

Overlay networks provide the possibility of taking advantage of multiple available paths to realize the bandwidth aggregating through multipath transfer. We present a game-theoretic study of the selfish strategic collaboration of multiple overlays when they are allowed to use multipath transfer, which is referred as the multipath selection game. Then we consider the equilibrium in this multipath selection game model where selfish players distribute their overlay traffic. Maximization of the utility functions for each overlay is the criterion of optimality. We adopt the objective of throughput maximization to capture the most typical overlay behaviors, and use the usual TCP as the basis of our analysis. We show analytically the existence and uniqueness of Nash equilibria in these games. Furthermore, we find that the loss of efficiency of Nash equilibria can be arbitrarily large if overlays do not have resource limitations.

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

[2]  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.

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

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

[5]  Donald F. Towsley,et al.  Stability and Efficiency of Unstructured File Sharing Networks , 2008, IEEE Journal on Selected Areas in Communications.

[6]  Bob Briscoe,et al.  Flow rate fairness: dismantling a religion , 2007, CCRV.

[7]  Klara Nahrstedt,et al.  Optimal resource allocation in overlay multicast , 2003, 11th IEEE International Conference on Network Protocols, 2003. Proceedings..

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

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

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

[11]  J. Nash.  Equilibrium Points in N-Person Games. , 1950, Proceedings of the National Academy of Sciences of the United States of America.

[12]  Christos H. Papadimitriou,et al.  Worst-case equilibria , 1999 .

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

[14]  Janardhan R. Iyengar,et al.  Concurrent Multipath Transfer Using SCTP Multihoming Over Independent End-to-End Paths , 2006, IEEE/ACM Transactions on Networking.

[15]  Zongpeng Li,et al.  Dynamic Bandwidth Auctions in Multioverlay P2P Streaming with Network Coding , 2008, IEEE Transactions on Parallel and Distributed Systems.

[16]  William R. McShane,et al.  A review of pedestrian safety models for urban areas in Low and Middle Income Countries , 2016 .

[17]  Ramesh Johari,et al.  Traffic Engineering vs. Content Distribution: A Game Theoretic Perspective , 2009, IEEE INFOCOM 2009.

[18]  Eitan Altman,et al.  A survey on networking games in telecommunications , 2006, Comput. Oper. Res..

[19]  R. Srikant,et al.  Multi-Path TCP: A Joint Congestion Control and Routing Scheme to Exploit Path Diversity in the Internet , 2006, IEEE/ACM Transactions on Networking.

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

[21]  Ning Wang,et al.  On the Interactions between Non-Cooperative P2P Overlay and Traffic Engineering Behaviors , 2010, 2010 IEEE Global Telecommunications Conference GLOBECOM 2010.

[22]  B. Barden.  Recommendations on queue management and congestion avoidance in the Internet , 1998 .

[23]  Rahul Garg,et al.  A game-theoretic approach towards congestion control in communication networks , 2002, CCRV.

[24]  R. Srikant,et al.  Overlay TCP for MultiPath Routing and Congestion Control ∗ , 2004 .

[25]  Sally Floyd,et al.  The NewReno Modification to TCP's Fast Recovery Algorithm , 2004, RFC.

[26]  Chen-Nee Chuah,et al.  Race Conditions in Coexisting Overlay Networks , 2008, IEEE/ACM Transactions on Networking.

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

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

[29]  John C. S. Lui,et al.  On the interaction of multiple overlay routing , 2005, Perform. Evaluation.

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

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