Title :
Large deviations of max-weight scheduling policies on convex rate regions
Author :
Subramanian, Vijay G.
Author_Institution :
Hamilton Inst., Nat. Univ. of Ireland, Maynooth
fDate :
Jan. 27 2008-Feb. 1 2008
Abstract :
We consider a single server discrete-time system with K users where the server picks operating points from a compact, convex and co-ordinate convex set in R+ K. For this system we analyse the performance of a stablising policy that at any given time picks operating points from the allowed rate region that maximise a weighted sum of rate, where the weights depend upon the workloads of the users. Assuming a large deviations principle (LDP) for the arrival processes in the Skorohod space of functions that are right-continuous with left-hand limits we establish an LDP for the workload process using a generalised version of the contraction principle to derive the corresponding rate function. With the LDP result available we then analyse the tail probabilities of the workloads under different buffering scenarios.
Keywords :
convex programming; probability; queueing theory; scheduling; Skorohod space; arrival processes; buffering scenarios; convex rate regions; large deviations principle; max-weight scheduling policies; server discrete-time queueing system; stablising policy; tail probabilities; Broadcasting; Capacity planning; Decoding; Delay; Information analysis; Performance analysis; Scheduling; Switches; Tail; Wireless networks;
Conference_Titel :
Information Theory and Applications Workshop, 2008
Conference_Location :
San Diego, CA
Print_ISBN :
978-1-4244-2670-6
DOI :
10.1109/ITA.2008.4601080