Title :
A new wireless packet scheduling algorithm based on the CDF of user transmission rates
Author :
Park, Daeyoung ; Seo, Hanbyul ; Kwon, Hojoong ; Lee, Byeong Gi
Author_Institution :
Sch. of Electr. Eng., Seoul Nat. Univ., South Korea
Abstract :
We present a new wireless scheduling algorithm based on the cumulative distribution function (cdf) of user transmission rates and also present a simple modification of it to limit the maximum starving time. This cdf-based scheduling (CS) algorithm selects the user for transmission based on the cdf of user rates in such a way that the user whose rate is high enough but least probable to become higher is selected. It turns out that the cdf-based scheduling algorithm is equivalent to a scheduling algorithm that regards the user rates as independent identically distributed (i.i.d.) and the average throughput of a user is independent of other users´ probability distribution. A distinctive feature of this proposed algorithm is that the exact user throughput can be evaluated if the user´s own distribution is known. The cdf-based scheduling with starving-time limitation (CS-STL) algorithm turns out not to affect the average inter-service time but to limit the maximum starving time at the cost of a negligible throughput loss.
Keywords :
diversity reception; losses; packet radio networks; probability; scheduling; average inter-service time; cdf-based scheduling algorithm; cumulative distribution function; independent identically distributed; maximum starving time; negligible throughput loss; probability distribution; starving-time limitation algorithm; user transmission rates; wireless packet scheduling algorithm; Costs; Delay; Distribution functions; Downlink; Feeds; Mobile computing; Probability distribution; Scheduling algorithm; System performance; Throughput;
Conference_Titel :
Global Telecommunications Conference, 2003. GLOBECOM '03. IEEE
Print_ISBN :
0-7803-7974-8
DOI :
10.1109/GLOCOM.2003.1258293