Properties of the solutions to the problem of dynamic routing in Networks

zbMATH Open0945.91001MaRDI QIDQ1569313FDOQ1569313

Authors: N. S. Vasil'ev 

Publication date: 2 July 2000

Published in: Computational Mathematics and Mathematical Physics (Search for Journal in Brave)

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

zbMATH Keywords

graphnetworkalgorithmoptimal solutiongamerouting message

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Optimality conditions for minimax problems (49K35) Communication networks in operations research (90B18) (n)-person games, (n>2) (91A06)

Cited In (9)

• Control of Some Graph Invariants in Dynamic Routing
• Title not available (Why is that?)
• Graphs and Path Equilibria
• Equilibrium routing strategies in data transmission networks
• An axiomatic approach to routing
• A game-theoretic algorithm for non-linear single-path routing problems
• Optimal route selection decision-making based on intelligent network
• Title not available (Why is that?)
• The consistency of the Pareto and Nash optimality principles as applied to the problem of routing in a ring network

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)