In this paper, we investigate the scheduling problem to achieve the proportional fairness among the flows in wireless multihop networks with time-varying channel capacity. Using the signal to interference noise ratio and the outage probability, we present an estimate of time-varying capacity. Then, we achieve the proportional fairness in terms of maximizing the network utility functionwith cons...

We present Group Ratio Round-Robin (GR), the first proportional share scheduler that combines accurate proportional fairness scheduling behavior with O(1) scheduling overhead on both uniprocessor and multiprocessor systems. GR uses a simple grouping strategy to organize clients into groups of similar processor allocations which can be more easily scheduled. Using this strategy, GR combines the ...

Channel aware schedulers of modern wireless networks such as the popular Proportional Fairness Scheduler (PFS) improve throughput performance by exploiting channel uctuations while maintaining fairness among the users. In order to simplify the analysis, PFS was introduced and vastly investigated in a model where frame losses do not occur, which is of course not the case in practical wireless ne...

A network of single server queues with routing is considered. These networks have a product form stationary distribution. A new limit result proves a sequence of such networks converges weakly to a stochastic flow level model. This stochastic model is insensitive. A large deviation principle for the stationary distribution of these queueing networks is found. Its rate function has a dual formul...

We describe a queueing model where service is allocated as a function of queue sizes. We consider allocations policies that are insensitive to service requirements and have a maximal stability region. We take a limit where the queueing model becomes congested. We study how service is allocated under this limit. We demonstrate that the only possible limit allocation is one that maximizes a propo...