Co-DRR: an integrated uplink and downlink scheduler for bandwidth management over wireless LANs

Bandwidth management over wired bottleneck links has been an effective way to utilize network resources. For the rapidly emerging IEEE 802.11 wireless LAN (WLAN), the limited WLAN bandwidth becomes a new bottleneck and requires bandwidth management. Most possible existing solutions only exclusively focus on optimizing multimedia traffic, pure downlink or pure uplink fairness, or are incompatible with IEEE 802.11. This study proposes a cooperative deficit round robin (co-DRR), an IEEE 802.11-compatible host based fair scheduling algorithm based on the deficit round robin (DRR) and distributed-DRR (DDRR) schemes, to cooperate the uplink and downlink quantum calculations to simultaneously control uplink and downlink bandwidth. Co-DRR uses the standard PCF mode to utilize the contention-free period to compensate for the unfairness in the contention period. Numerical results demonstrate that: co-DRR can scale up to 100 mobile hosts even under high bit error rate (0.0001) while simultaneous achieving uplink/downlink long-term fairness (CoV<0.01) among competing mobile hosts.

[1]  David Newman,et al.  Benchmarking Terminology for Firewall Performance , 1999, RFC.

[2]  Ion Stoica,et al.  Packet fair queueing algorithms for wireless networks with location-dependent errors , 1998, Proceedings. IEEE INFOCOM '98, the Conference on Computer Communications. Seventeenth Annual Joint Conference of the IEEE Computer and Communications Societies. Gateway to the 21st Century (Cat. No.98.

[3]  R. Srikant,et al.  Fair scheduling in wireless packet networks , 1999, TNET.

[4]  Lachlan L. H. Andrew,et al.  Impact of polling strategy on capacity of 802.11 based wireless multimedia LANs , 1999, IEEE International Conference on Networks. ICON '99 Proceedings (Cat. No.PR00243).

[5]  Satish K. Tripathi,et al.  Enhancing throughput over wireless LANs using channel state dependent packet scheduling , 1996, Proceedings of IEEE INFOCOM '96. Conference on Computer Communications.

[6]  E. Gilbert.  Capacity of a burst-noise channel , 1960 .

[7]  Van Jacobson,et al.  Link-sharing and resource management models for packet networks , 1995, TNET.

[8]  Peter Steenkiste,et al.  Effort-limited fair (ELF) scheduling for wireless networks , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[9]  George Varghese,et al.  Efficient fair queueing using deficit round robin , 1995, SIGCOMM '95.

[10]  Christina Fragouli,et al.  Controlled multimedia wireless link sharing via enhanced class-based queuing with channel-state-dependent packet scheduling , 1998, Proceedings. IEEE INFOCOM '98, the Conference on Computer Communications. Seventeenth Annual Joint Conference of the IEEE Computer and Communications Societies. Gateway to the 21st Century (Cat. No.98.

[11]  B. Bing.  Measured performance of the IEEE 802.11 wireless LAN , 1999, Proceedings 24th Conference on Local Computer Networks. LCN'99.

[12]  Harrick M. Vin,et al.  Start-time fair queueing: a scheduling algorithm for integrated services packet switching networks , 1997, TNET.

[13]  Songwu Lu,et al.  A Unified Architecture for the Design and Evaluation of Wireless Fair Queueing Algorithms , 2002, Wirel. Networks.

[14]  Claude Castelluccia,et al.  Introducing service differentiation into IEEE 802.11 , 2000, Proceedings ISCC 2000. Fifth IEEE Symposium on Computers and Communications.