Properties of the solutions to the problem of dynamic routing in Networks (Q1569313)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Publication:1569313 |
scientific article; zbMATH DE number 1467852
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Properties of the solutions to the problem of dynamic routing in Networks |
scientific article; zbMATH DE number 1467852 |
Statements
Properties of the solutions to the problem of dynamic routing in Networks (English)
0 references
2 July 2000
0 references
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.
0 references
network
0 references
game
0 references
optimal solution
0 references
graph
0 references
routing message
0 references
algorithm
0 references
0.8301522731781006
0 references
0.8291975259780884
0 references
0.8184860944747925
0 references
0.8162055611610413
0 references
0.8150709271430969
0 references
