Implementation and Evaluation of Age-Aware Downlink Scheduling Policies

2021 ◽  
Author(s):  
Tahir Kerem Oguz ◽  
Elif Uysal ◽  
Tolga Girici
Keyword(s):  
Scheduling Policies ◽  
Downlink Scheduling

Deep Reinforcement Learning for Delay-Sensitive LTE Downlink Scheduling

2020 ◽  
Author(s):  
Nikhilesh Sharma ◽  
Sen Zhang ◽  
Someshwar Rao Somayajula Venkata ◽  
Filippo Malandra ◽  
Nicholas Mastronarde ◽  
...  
Keyword(s):  
Reinforcement Learning ◽  
Downlink Scheduling ◽  
Delay Sensitive

scholarly journals Optimal scheduling policies in time sharing service systems

1995 ◽  
Vol 22 (10-12) ◽  
pp. 247-259 ◽  
Author(s):  
M. Ohnishi ◽  
H. Maeda ◽  
T. Ibaraki
Keyword(s):  
Service Systems ◽  
Optimal Scheduling ◽  
Time Sharing ◽  
Scheduling Policies

scholarly journals Optimality of index policies for stochastic scheduling with switching penalties

1992 ◽  
Vol 29 (04) ◽  
pp. 957-966 ◽  
Author(s):  
Mark P. Van Oyen ◽  
Dimitrios G. Pandelis ◽  
Demosthenis Teneketzis
Keyword(s):  
Optimal Policy ◽  
Time Delays ◽  
Stochastic Scheduling ◽  
Optimal Scheduling ◽  
Scheduling Policies ◽  
Parallel Queues ◽  
Lump Sum ◽  
Index Policies ◽  
Service Policy ◽  
The Impact

We investigate the impact of switching penalties on the nature of optimal scheduling policies for systems of parallel queues without arrivals. We study two types of switching penalties incurred when switching between queues: lump sum costs and time delays. Under the assumption that the service periods of jobs in a given queue possess the same distribution, we derive an index rule that defines an optimal policy. For switching penalties that depend on the particular nodes involved in a switch, we show that although an index rule is not optimal in general, there is an exhaustive service policy that is optimal.

Sign in / Sign up

Export Citation Format

Share Document