On equilibrium routing in data-transmission networks (Q1281221)

A model of the data transmission network represented by a simple connected nonoriented graph is considered. The problem of chosing an optimal route for the data transmission is formulated. A route is considered to be optimal if it corresponds to a Nash equilibrium point. The question of existence of an equilibrium routing corresponding to an optimal solution is discussed. A new approach to the problem, i.e. ``an aggregation'' of the data transmission routes, allowed the authors to prove the theorem of existence of an equilibrium route in the case of an aggregated circle network. The theorem is illustrated by some examples.