DocumentCode
2948321
Title
Many-sources large deviations for max-weight scheduling
Author
Kittipiyakul, Somsak ; Javidi, Tara ; Subramanian, Vijay G.
Author_Institution
ECE Dept., Univ. of California, San Diego, CA
fYear
2008
fDate
23-26 Sept. 2008
Firstpage
1495
Lastpage
1502
Abstract
In this paper, we establish a many-sources large deviations principle (LDP) for the stationary workload of a multi-queue single-server system with simplex capacity, operated under a stabilizing and non-idling maximum-weight scheduling policy. Assuming a many-sources sample path LDP for the arrival processes, we establish an LDP for the workload process by employing Garcia´s extended contraction principle that is applicable to quasi-continuous mappings. The LDP result can be used to calculate asymptotic buffer overflow probabilities accounting for the multiplexing gain, when the arrival process is an average of i.i.d. processes. We express the rate function for the stationary workloads in term of the rate functions of the finite-horizon workloads when the arrival processes have i.i.d. increments.
Keywords
multiplexing; queueing theory; scheduling; asymptotic buffer overflow probabilities; finite-horizon workloads; many-sources large deviations principle; max-weight scheduling; multiplexing gain; multiqueue single-server system; quasi-continuous mappings; simplex capacity; Algorithm design and analysis; Buffer overflow; Capacity planning; Engineering profession; Performance analysis; Probability; Scheduling algorithm; Stochastic processes; Topology; Wireless communication;
fLanguage
English
Publisher
ieee
Conference_Titel
Communication, Control, and Computing, 2008 46th Annual Allerton Conference on
Conference_Location
Urbana-Champaign, IL
Print_ISBN
978-1-4244-2925-7
Electronic_ISBN
978-1-4244-2926-4
Type
conf
DOI
10.1109/ALLERTON.2008.4797739
Filename
4797739
Link To Document