Routing and dynamic resource assignment joint game: a non-cooperative model for QoS routing

DOI10.1080/0020717042000297216MaRDI QIDQ4652103zbMATH OpenOpenAlexFDO

Authors Paolo Conforto, Francesco Delli Priscoli

Publication date 24 February 2005

Published in International Journal of Control (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/0020717042000297216

Mathematics Subject Classification ID

Reliability, availability, maintenance, inspection in operations research (90B25) Applications of game theory (91A80) Noncooperative games (91A10)

Recommendations

• Existence and uniqueness of the Nash equilibrium in the non-cooperative QoS routing
• Capacity allocation under noncooperative routing
• A communication network routing problem: modeling and optimization using non-cooperative game theory
• Routing into two parallel links: Game-theoretic distributed algorithms
• scientific article; zbMATH DE number 2183059

Cites work

• Capacity allocation under noncooperative routing
• Convergence of synchronous and asynchronous greedy algorithms in a multiclass telecommunications environment
• Distributed algorithms for the computation of noncooperative equilibria

Cited in

(3)

• Network QoS games: stability vs optimality tradeoff
• A communication network routing problem: modeling and optimization using non-cooperative game theory
• Existence and uniqueness of the Nash equilibrium in the non-cooperative QoS routing

This page was built for publication: Routing and dynamic resource assignment joint game: a non-cooperative model for QoS routing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4652103)