The consistency of the Pareto and Nash optimality principles as applied to the problem of routing in a ring network. (English. Russian original) Zbl 0949.90091
Comput. Math. Math. Phys. 38, No. 4, 568-573 (1998); translation from Zh. Vychisl. Mat. Mat. Fiz. 38, No. 4, 590-595 (1998).
The author represents the packet data network as a nonoriented connected graph. The network users are located at some nodes of the graph, and the edges represent the communication lines. Messages are transmitted between the network users in packets over graph routes. All packets are assumed to have equal lengths. The relation between the Pareto and Nash optimality principles used to state optimal routing problems is analyzed.
Reviewer: Alexey Tret’yakov (Siedlce)
MSC:
| 90C35 | Programming involving graphs or networks |
| 90B10 | Deterministic network models in operations research |
| 90C27 | Combinatorial optimization |
| 90C29 | Multi-objective and goal programming |
