Download now Free registration required
Given that routing protocols have still problems to converge in situations with dynamic metrics, with this study the authors pursue to find a new algorithm based in the Nash equilibrium which obtains a stable situation in a network game. They focus on congestion games and explore the features to create a link state and centralized routing algorithm based on Nash equilibrium. With the results they demonstrate that in 66,2% of all the simulations done they obtain the equilibrium with only 2 turns of the game.
- Format: PDF
- Size: 247 KB