Improving the Performance of Selfish Overlay Routing by Increasing the Throughput and Decreasing the Loss Rate Using Nash Equilibrium

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.