A MDP approach to fault-tolerant routing
DOI10.3166/EJC.18.334-347zbMATH Open1291.93293OpenAlexW2013651171WikidataQ58489617 ScholiaQ58489617MaRDI QIDQ389801FDOQ389801
Authors: Antonio Pietrabissa, Marco Castrucci, Andi Palo
Publication date: 21 January 2014
Published in: European Journal of Control (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3166/ejc.18.334-347
Recommendations
- Performance evaluation of fault-tolerant routing algorithms: an optimization problem
- Routing problems and Markovian decision processes
- Optimal dynamic routing in Markov queueing networks
- Fault-Tolerant Routing: k-Inconnected Many-to-One Routing in Wireless Networks
- Optimal call admission and call dropping control in links with variable capacity
Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Communication networks in operations research (90B18) Stochastic systems in control theory (general) (93E03)
Cites Work
- Title not available (Why is that?)
- A note on two problems in connexion with graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Dynamic programming and suboptimal control: a survey from ADP to MPC
- Title not available (Why is that?)
- Routing in circuit-switched networks: optimization, shadow prices and decentralization
- Optimal call admission and call dropping control in links with variable capacity
Cited In (2)
This page was built for publication: A MDP approach to fault-tolerant routing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q389801)