Open AccessStructural Properties of Optimal Scheduling Policies for Wireless Data Transmission
Author(s) -
Nomesh B. Bolia,
Vidyadhar G. Kulkarni
Publication year - 2012
Publication title -
international journal of communications, network and system sciences/international journal of communications, network, and system sciences
Language(s) - English
Resource type - Journals
eISSN - 1913-3723
pISSN - 1913-3715
DOI - 10.4236/ijcns.2012.510069
Subject(s) - markov decision process , monotonic function , computer science , queue , scheduling (production processes) , base station , queueing theory , mathematical optimization , wireless , markov process , mathematical proof , markov chain , wireless network , transmission (telecommunications) , mathematics , computer network , statistics , telecommunications , mathematical analysis , geometry , machine learning
We analyze a cell with a fixed number of users in a time period network. The base station schedules to serve at most one user in a given time period based on information about the available data rates and other parameter(s) for all the users in the cell. We consider infinitely backlogged queues and model the system as a Markov Decision Process (MDP) and prove the monotonicity of the optimal policy with respect to the "starvation age" and the available data rate. For this, we consider both the discounted as well as the long-run average criterion. The proofs of the monotonicity properties serve as good illustrations of analyzing MDPs with respect to their optimal solutions