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 indivi dual users, we obtain several dynamic policy adjustment schemes for the onl ine computation of the Nash equilibrium and Study their local convergence p roperties. These policy adjustment schemes require minimum information on t he part of each user regarding the cost-utility functions of the others. (C ) 2001 Academic Press.