Towards DRL-based Routing and Spectrum Assignment in Optical Networks: Lessons to be Learned from Markov Decision Processes

2021 ◽  
Author(s):  
Ronald Romero Reyes ◽  
Thomas Bauschert
Keyword(s):  
Optical Networks ◽  
Markov Decision Processes ◽  
Decision Processes ◽  
Spectrum Assignment ◽  
Markov Decision ◽  
Routing And Spectrum Assignment

Extreme-point solutions in Markov decision processes

1983 ◽  
Vol 20 (04) ◽  
pp. 835-842
Author(s):  
David Assaf
Keyword(s):  
Convex Function ◽  
Extreme Point ◽  
Markov Decision Processes ◽  
Convex Functions ◽  
Sufficient Conditions ◽  
Decision Processes ◽  
Markov Decision ◽  
Full Solution

The paper presents sufficient conditions for certain functions to be convex. Functions of this type often appear in Markov decision processes, where their maximum is the solution of the problem. Since a convex function takes its maximum at an extreme point, the conditions may greatly simplify a problem. In some cases a full solution may be obtained after the reduction is made. Some illustrative examples are discussed.

Sign in / Sign up

Export Citation Format

Share Document