Routing into two parallel links: Game-theoretic distributed algorithms

We study a class of noncooperative networks where N users send traffic to a destination node over two links with given capacities in such a way that a Nash equilibrium is achieved. Under a linear cost structure for the individual users, we obtain several dynamic policy adjustment schemes for the online computation of the Nash equilibrium and study their local convergence properties. These policy adjustment schemes require minimum information on the part of each user regarding the cost-utility functions of the others.