Reducing the oscillations between overlay routing and traffic engineering by repeated game theory

Due to the conflicts existing in the route objectives of overlay routing and traffic engineering, the interaction between the two selfish players may converge to an inefficient Nash equilibrium point, even if the better choice may exist. We formulate the interaction as an infinitely repeated two-player game, where overlay routing aims to minimize the average latency of overlay users and traffic engineering aims to minimize the maximum link utilization of overall network. The whole interaction process could be divided into two stages - learning stage and practice stage. The former collects the historical information and finds the best point with a simple learning algorithm, then the latter uses this point as equilibrium point and converges to it. The simulation results show that both overlay routing and traffic engineering can converge to the win-win results, and the overall network can avoid the performance volatility from endless oscillations.

[1]  Mostafa H. Ammar,et al.  Characterizing and Mitigating Inter-domain Policy Violations in Overlay Routes , 2006, Proceedings of the 2006 IEEE International Conference on Network Protocols.

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

[3]  Yin Zhang,et al.  On selfish routing in internet-like environments , 2006, TNET.

[4]  Christophe Diot,et al.  Traffic matrix estimation: existing techniques and new directions , 2002, SIGCOMM 2002.

[5]  Mostafa H. Ammar,et al.  On the Interaction Between Dynamic Routing in Native and Overlay Layers , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[6]  Christian Scheideler,et al.  Can ISPS and P2P users cooperate for improved performance? , 2007, CCRV.

[7]  Arvind Krishnamurthy,et al.  P 4 P : Explicit Communications for Cooperative Control Between P 2 P and Network Providers , 2007 .

[8]  Mung Chiang,et al.  Cooperative content distribution and traffic engineering in an ISP network , 2009, SIGMETRICS '09.

[9]  Mikkel Thorup,et al.  Internet traffic engineering by optimizing OSPF weights , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

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

[11]  Mostafa H. Ammar,et al.  Preemptive Strategies to Improve Routing Performance of Native and Overlay Layers , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.

[12]  Gene Moo Lee,et al.  Improving the Interaction between Overlay Routing and Traffic Engineering , 2008, Networking.

[13]  Don Towsley,et al.  On the Interaction Between Overlay Routing and Traffic Engineering , 2004 .