Priority and fair scheduling in a wireless LAN
Authors:
- A. DugarADA. Dugar
- N. VaidyaNVN. Vaidya
- P. BahlPBP. Bahl
- 13 November 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 2, 993-997
Abstract
In recent years, fair scheduling and quality of service (QoS) in wireless LANs have received significant attention from the networking research community. This paper presents a distributed algorithm for priority and fair scheduling in a wireless LAN. The proposed protocol is derived from HIPERLAN which is a wireless LAN standard defined by ETSI. The proposed protocol supports multiple priorities, as well as a mechanism (using weights) for controlling the way bandwidth is shared by flows within a given priority level.Keywords
This publication has 7 references indexed in Scilit:
- Priority and fair scheduling in a wireless LAN2002
- A self-coordinating approach to distributed fair queueing in ad hoc wireless networks2002
- Real-time traffic over the IEEE 802.11 medium access control layerBell Labs Technical Journal, 2002
- Distributed fair scheduling in a wireless LAN2000
- Stability and performance analysis of HIPERLAN1998
- Start-time fair queueing: a scheduling algorithm for integrated services packet switching networksIEEE/ACM Transactions on Networking, 1997
- Priority Access Schemes Using CSMA-CDIEEE Transactions on Communications, 1985