Pathwise optimality of the exponential scheduling rule for wireless channels
2004 ◽
Vol 36
(04)
◽
pp. 1021-1045
◽
Keyword(s):
We consider the problem of scheduling the transmissions of multiple data users (flows) sharing the same wireless channel (server). The unique feature of this problem is the fact that the capacity (service rate) of the channel varies randomly with time and asynchronously for different users. We study a scheduling policy called the exponential scheduling rule, which was introduced in an earlier paper. Given a system withNusers, and any set of positive numbers {an},n= 1, 2,…,N, we show that in a heavy-traffic limit, under a nonrestrictive ‘complete resource pooling’ condition, this algorithm has the property that, for each timet, it (asymptotically) minimizes maxnanq̃n(t), whereq̃n(t) is the queue length of usernin the heavy-traffic regime.
2004 ◽
Vol 36
(4)
◽
pp. 1021-1045
◽
Keyword(s):
1999 ◽
Vol 10
(5)
◽
pp. 497-509
◽
1992 ◽
Vol 24
(01)
◽
pp. 172-201
◽
Keyword(s):
A diffusion model for two parallel queues with processor sharing: transient behavior and asymptotics
1999 ◽
Vol 12
(4)
◽
pp. 311-338
◽
2000 ◽
Vol 37
(01)
◽
pp. 212-223
◽
Keyword(s):
2021 ◽
Vol 48
(3)
◽
pp. 109-110
Keyword(s):
Keyword(s):
2000 ◽
Vol 37
(1)
◽
pp. 212-223
◽
Keyword(s):