Open Access Open Access  Restricted Access Subscription or Fee Access

A Review on the Impact of Nash Equilibrium in the Performance of Overlay Networks

S. Nandhini, S. Prayla Shyry, S. Emalda Roslin, N. M. Nandhitha, V. Ramachandran


Nash Equilibrium is the well known game theory approach that is used extensively for solving the instability problems. Overlay networks are the proper choice for reducing the packet drops due to link failures. However there is an unsolved instability in these networks due to lack of proper communication between the nodes in the network. Once this instability problem in overlay networks is solved, it can overcome all the disadvantages as predicted theoretically and offers itself as a false proof choice for networking. This paper provides an intensive survey on the application of Nash Equilibrium to stabilize overlay nodes with different routing techniques.


-Nash Equilibrium, Overlay Network, Latency, Network Cost.

Full Text:



Jocylene Elias, Fabio Martignon , Konstantin Avrachenkov and Giovanni Neglia, “Socially Aware Network Design Games”, IEEE INFOCOM, 2010.

Byung Gon Chun, Rodrigo Fonreca, Ion Stocia and John Kubiatowicz, “Characterizing Selfishly Constructed Overlay Routing Networks” IEEE INFOCOM, pp. 1329-1339, 2004.

Nikolaos Laoutaris, Georgios Smaragdakis, Azer Bestavrous and John W. Byers, “Implications of Selfish Neighbor Selection in Overlay Networks”,IEEE INFOCOM, pp. 490-498, 2007.

Bruno Gusmao Rocha, Virgilio Almeida and Dorgival Guedes “Increasing QOS in Selfish Overlay Networks”, IEEE INFOCOM , pp. 24-31,2006.

Yong Liu, Honggang Zhang, Weibo Gang and Don Towsley, “On the Interaction Between Overlay Routing and Underlay Routing”, IEEE INFOCOM, , pp. 2543-2553, 2005.

Wenjie Jiang, Dah Ming Chiu and John C.S. Lui, “On the Interaction of Multiple Overlay Routing”, Tech., Report, 2005.

Nicolas Christin and John Chuang, “A Cost Based Analysis of Overlay Routing Geometrics”, IEEE INFOCOM, 2005.

Bruno Gusmao Rocha, Virgilio Almeida and Dorgival Guedes, “Strategies to Improve Reliability in Routing Overlay Networks with Selfish Nodes”, Tech., Report, 2008.

Tao Wu and David Starobinski, “On the Price of Anarchy in Unbounded Delay Networks”, ACM GAMENETS, 2006.

Hisao Kameda, Eitan Altmann, Corinne Touati and Arnaud Legrand, “Nash Equilibrium Based Fairness”, IEEE GameNets, pp. 533-539 2009.

Dimitris Fotakis, Spyros Kontagiannis, Elias Koutsoupias, Marios Mavronicocas and Paul Spirakis, “The Structure and Complexity of Nash Equilibria for a Selfish Routing Game”, Tech., Report IST, pp. 33505-3326, 2009.

Lili Qiu, Yang Richard Yang, Yin Zhang and Scott Shenker, “On Selfish Routing in Internet Like Environments”, ACM SIGCOMM, pp. 151-162, 2003.

Xin Ai, Vikram Srinivasan and Chen Kong Tham, “Optimality and Complexity of Pure Nash Equilibria in the Coverage Game”, IEEE Journal, pp. 1170-1182, 2008.

Lijun Chen, Steven H.Low and John C.Doye, “Contension Control: A Game Theoratic Approach”, 46th IEEE Conference, 2007.

Pavan Nuggehalli, Jenifer Price and Tara Javidi, “Pricing and QOS in Wireless Random Access Networks”, IEEE GLOBECOM, 2008.

S.Prayla shyry and V.Ramachandran, “Minimizing Link Utilization in Selfish Overlay Routing”, IJCCT, pp. 314-318 2010.

Nicolae Cleju, Nikolaos Thomas and Pascal Frossard, “Network Coding Node Placement for Delay Minimization in Streaming Overlays”, IEEE ICC, 2010.

Dominic Diplantino and Ramesh Johari, “Traffic Engineering Vs. Content Ditribution: A Game Theoretic Perspective”, IEEE INFOCOM, pp. 540-548, 2009.

Sabyasachi Roy, Himabindu Pucha, Zheng Zhang, Y. Charlie Hu and Lili Qiu, “Overlay Node Placement: Analysis, Algorithms and Impact on Applications”, IEEE ICDCS, pp. 43- 53, 2007.

Haiyong Xie, Lili Qiu, Yang Richard Yang and Yin Zhang, “On Self Adaptive Routing in Dynamic Environments”, IEEE ICNP, 2004.

Youngmi Jin and George Kesidis, “Nash Equilibria of a Generic Networking Game with Applications to Circuit-Switched Networks”, IEEE INFOCOM, 2003.

Eitan Altman, Tamer Basar and R.Srikant, “Nash Equilibria for Combined Flow Control and Routing in Networks: Asymptotic Behavior for a Large Number of Users”, IEEE Transactions on Automatic Control, pp. 917-930, 2002.

Chandramani Singh, “Marginal Cost Pricing for Atomic Network Congestion Games”, Tech report, 2008.

Andreas Emil Feldmann, Heiko Roglin and Berthold Vocking, “Computing Approximate Nash Equilibria in Network Congestion Games”, IEEE FOCS, pp. 532-541, 2011.

Panagiota N. Panagopoulou and paul G. Spirakis, “Efficient Convergence to Pure Nash Equilibria in Weighted Network Games” Tech report, pp. 203-215, 2005.


  • There are currently no refbacks.

Creative Commons License
This work is licensed under a Creative Commons Attribution 3.0 License.