Routing in Max-Min Fair Networks: A Game Theoretic Approach
In this paper, the authors study the problem of routing in networks with max-min fair congestion control at the link level. The goal of each user is to maximize its own bandwidth by selecting its path. The problem is formulated as a non-cooperative game. They first prove the existence of Nash Equilibria. This is important, because at a Nash Equilibrium (NE), no user has the incentive to change its routing strategy. In addition, they investigate how the selfish behavior of the users may affect the performance of the network as a whole.