Proportional Fair (PF) share policy has been adopted as a downlink scheduling scheme in CDMA2000 1xEV-DO standard. Although it offers optimal performance in aggregate throughput conditioned on equal time share among users, it cannot provide a bandwidth guarantee and a strict delay bound, which is essential requirements of real-time (RT) applications. In this study, we propose a new scheduling p...

Fair scheduling algorithms have been proposed to tackle the problem of bursty and location-dependent errors in wireless packet networks. Most of those algorithms ensure the fairness property and guarantee the QoS of all sessions in a large-scale cellular network such as GSM or GPRS. In this paper, we propose the Weighted-Sacrificing Fair Queueing (WSFQ) scheduling algorithm for small-area and d...

This paper describes an algorithm that achieves delay and throughput decoupling in distributed fair scheduling in multihop ad-hoc wireless networks. The solution allows to support both low-bandwidth, low-delay and high-bandwidth, high delay applications in a single framework, without wasting much bandwidth to realize the low-delay requirement. We demonstrate the effectiveness of our algorithm i...

A lot of work has been done addressing issues of fair scheduling in wireline packet networks. Most techniques developed have not effectively address the unique constraints post by a wireless packet network. This report reviews [1], a paper which proposes a model for wireless packet network fair scheduling and provides a protocol that attempts to implement such a model.

Many research teams are developing technologies to turn the Internet into a QoS-capable network, which is one of the biggest challenges that this communication system currently faces. Naturally, at the core of such a challenge are IP routers and the technology they use. It is a well known fact that the common packet scheduling discipline that is used in routers (first come first served) makes t...

We consider scheduling policies for maxmin fair allocation of bandwidth in wireless adhoc networks. We formalize the maxmin fair objective under wireless scheduling constraints. We propose a fair scheduling which assigns dynamic weights to the flows such that the weights depend on the congestion in the neighborhood and schedule the flows which constitute a maximum weighted matching. It is possi...

The performance of various GFR (Guaranteed Frame Rate) implementations has been recently studied due to the interest to provide bandwidth guarantees with a simpler implementation than ABR in ATM networks. In this paper we describe and evaluate a scheduling algorithm to provide the GFR service guarantees. The evaluation is performed by simulation using TCP connections. The proposed scheduling is...