On the Network Sharing of Mixed Network Coding and Routing Data Flows in Congestion Networks

In this paper, we study the congestion game for a network where mutliple network coding (NC) and routing users sharing a single common congestion link to transmit their information. The data flows using NC and routing will compete network resources, and we need to determine the optimal allocation of network resources between NC and routing data flows to maximize the network payoff. To facilitate the design, we formulate this process using a cost-sharing game model. A novel average-cost-sharing (ACS) pricing mechanism is developed to maximize the overall network payoff. We analyze the performance of ACS in terms of price of anarchy (PoA). We formulate an analytical expression to compute PoA under the ACS mechanism. In contrast to the previous affine marginal cost (AMC) mechanism, where the overall network payoff decreases when NC is applied, the proposed ACS mechanism can considerably improve the overall network payoff by optimizing the number and the spectral resource allocation of NC and routing data flows sharing the network link.

[1]  John N. Tsitsiklis,et al.  A scalable network resource allocation mechanism with bounded efficiency loss , 2006, IEEE Journal on Selected Areas in Communications.

[2]  Zhu Han.  Resource allocation for wireless networks , 2008 .

[3]  Rudolf Ahlswede,et al.  Network information flow , 2000, IEEE Trans. Inf. Theory.

[4]  Tim Roughgarden,et al.  The price of anarchy in games of incomplete information , 2012, EC '12.

[5]  Yair Tauman,et al.  The Shapley value: The Aumann-Shapley prices: a survey , 1988 .

[6]  Hossam S. Hassanein,et al.  Congestion Pricing in Wireless Cellular Networks , 2011, IEEE Communications Surveys & Tutorials.

[7]  Zhu Han,et al.  Resource Allocation for Wireless Networks: Basics, Techniques, and Applications , 2008 .

[8]  Shalabh Bhatnagar,et al.  Optimal multi-layered congestion based pricing schemes for enhanced QoS , 2012, Comput. Networks.

[9]  Brighten Godfrey,et al.  How well can congestion pricing neutralize denial of service attacks? , 2012, SIGMETRICS '12.

[10]  Dov Samet,et al.  The Determination of Marginal-Cost Prices Under a Set of Axioms , 1982 .

[11]  R. Srikant,et al.  End-to-end congestion control schemes: utility functions, random losses and ECN marks , 2003, TNET.

[12]  Jason R. Marden,et al.  The Price of Selfishness in Network Coding , 2009, IEEE Transactions on Information Theory.

[13]  Vincent W. S. Wong,et al.  Repeated Intersession Network Coding Games: Efficiency and Min-Max Bargaining Solution , 2014, IEEE/ACM Transactions on Networking.

[14]  Baochun Li,et al.  Dice: a game theoretic framework for wireless multipath network coding , 2008, MobiHoc '08.

[15]  Xue-Bin Liang,et al.  Matrix games in the multicast networks: maximum information flows with network switching , 2006, IEEE Transactions on Information Theory.

[16]  Marwan Krunz,et al.  Price-Based Joint Beamforming and Spectrum Management in Multi-Antenna Cognitive Radio Networks , 2012, IEEE Journal on Selected Areas in Communications.

[17]  Jiawei Zhang,et al.  Design of price mechanisms for network resource allocation via price of anarchy , 2010 .

[18]  Vincent W. S. Wong,et al.  A Game-Theoretic Analysis of Inter-Session Network Coding , 2009, 2009 IEEE International Conference on Communications.

[19]  Mingyan Liu,et al.  Price of Anarchy for Congestion Games in Cognitive Radio Networks , 2012, IEEE Transactions on Wireless Communications.

[20]  Vincent W. S. Wong,et al.  Inter-Session Network Coding with Strategic Users: A Game-Theoretic Analysis of the Butterfly Network , 2013, IEEE Transactions on Communications.

[21]  Zongpeng Li,et al.  Cross-Monotonic Multicast , 2008, IEEE INFOCOM 2008 - The 27th Conference on Computer Communications.

[22]  A. Robert Calderbank,et al.  Pricing under Constraints in Access Networks: Revenue Maximization and Congestion Management , 2010, 2010 Proceedings IEEE INFOCOM.

[23]  Michael Devetsikiotis,et al.  An overview of pricing concepts for broadband IP networks , 2000, IEEE Communications Surveys & Tutorials.