Properties of the solutions to the problem of dynamic routing in Networks
From MaRDI portal
(Redirected from Publication:1569313)
The properties of optimal solutions to the game problem of routing messages in a datagram network are investigated. A class of graphs of data networks is described in which the optimal solution (the Nash equilibrium) implies that messages are transmitted over the shortest routes for all pairs of network users. The results obtained can serve as a basis for constructing stable routing algorithms.
Recommendations
- Properties of the solutions to the task of routing in the network with virtual circuits
- Equilibrium routing strategies in data transmission networks
- The consistency of the Pareto and Nash optimality principles as applied to the problem of routing in a ring network
- The existence of equilibrium routing in networks of data transmission
- On equilibrium routing in data-transmission networks
Cited in
(12)- On equilibrium routing in data-transmission networks
- The existence of equilibrium routing in networks of data transmission
- Equilibrium routing strategies in data transmission networks
- The consistency of the Pareto and Nash optimality principles as applied to the problem of routing in a ring network
- Properties of the solutions to the task of routing in the network with virtual circuits
- Optimal route selection decision-making based on intelligent network
- scientific article; zbMATH DE number 1696528 (Why is no real title available?)
- A game-theoretic algorithm for non-linear single-path routing problems
- Graphs and Path Equilibria
- Control of Some Graph Invariants in Dynamic Routing
- scientific article; zbMATH DE number 4059093 (Why is no real title available?)
- An axiomatic approach to routing
This page was built for publication: Properties of the solutions to the problem of dynamic routing in Networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1569313)
