The consistency of the Pareto and Nash optimality principles as applied to the problem of routing in a ring network (Q1571132)
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: The consistency of the Pareto and Nash optimality principles as applied to the problem of routing in a ring network |
scientific article; zbMATH DE number 1472880
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The consistency of the Pareto and Nash optimality principles as applied to the problem of routing in a ring network |
scientific article; zbMATH DE number 1472880 |
Statements
The consistency of the Pareto and Nash optimality principles as applied to the problem of routing in a ring network (English)
0 references
5 December 2000
0 references
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.
0 references
optimality principles
0 references
routing problems
0 references
graph
0 references
equilibrium
0 references
network
0 references
