Networking and Communication Engineering

S. Nandhini ¹, S. Prayla Shyry ², S. Emalda Roslin ³, N. M. Nandhitha ³, V. Ramachandran ⁴

Affiliations
1 Sathyabama University, Chennai-119, IN
2 Department of Computer Science Engineering, Sathyabama University, Chennai-119, IN
3 Department of Electronics and Telecommunication Engineering, Sathyabama University, Chennai-119, IN
4 Dept of IST, Anna University, Chennai, Guindy, IN

Abstract

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.

Keywords

Nash Equilibrium, Overlay Network, Latency, Network Cost.

Full Text

     

S. Prayla Shyry ¹, V. Ramachandran ²

Affiliations
1 Sathyabama University, IN
2 Anna University, IN

Abstract

The challenging problem in selfish overlay routing is its performance .As the name selfish overlay routing suggests the end hosts are allowed to route the packet among themselves and the only aim of the will be route the packet to the destination without bothering the global criteria. So the performance of the network gets worser. Research has been started to increase the performance in selfish overlay routing. In this paper nash equilibrium is reached in selfish overlay routing to increase the throughput and decrease the loss rate. Nash equilibrium is a solution concept of a game involving two or more players, in which each player is assumed to know the equilibrium strategies of the other players. There is no gain in changing his or her own strategy unilaterally. Simulation study shows that the Performance of the selfish overlay routing is improved with an optimized output. Throughput and loss rate are measured by different queuing models with respect to three routing types and it was proved that optimal routing gives the best performance.

Keywords

Loss Rate, Nash Equilibrium, Selfish Overlay Routing, Throughput.

Full Text