Please use this identifier to cite or link to this item: https://doi.org/10.1023/A:1009596207401
Title: Distributed Fair Queueing (DFQ) architecture for wireless ATM local access networks
Authors: Kautz, R.
Keh, R. 
Chua, K.C. 
Leon-Garcia, A.
Issue Date: Oct-2000
Source: Kautz, R.,Keh, R.,Chua, K.C.,Leon-Garcia, A. (2000-10). Distributed Fair Queueing (DFQ) architecture for wireless ATM local access networks. International Journal of Wireless Information Networks 7 (4) : 221-229. ScholarBank@NUS Repository. https://doi.org/10.1023/A:1009596207401
Abstract: The application of Asynchronous Transfer Mode (ATM) to a Wireless Local Area Network (WLAN) environment is an undertaking that poses many problems not encountered in either wireline ATM or data-only WLAN. Wireline ATM networks do not have to transmit over multiple-access, unreliable transmission media while data-only WLANs do not have to satisfy heterogeneous Quality of Service (QoS) contracts for multimedia services. To address this issue, we propose in this paper a DFQ-based WLAN architecture, designed as a centrally controlled network where a complex base station polls simpler mobile terminals for channel access. DFQ is an implementation of Fair Queueing (FQ) algorithm to schedule the access to the transmission channel among the mobile terminals. The implementation of DFQ introduces new design challenges, mainly in the packet scheduler. A DFQ scheduler is designed to allow fast and efficient processing of scheduling data. The DFQ algorithm is introduced and simulated for delay-sensitive connections, and the hardware implementation of the packet scheduler is discussed.
Source Title: International Journal of Wireless Information Networks
URI: http://scholarbank.nus.edu.sg/handle/10635/62055
ISSN: 10689605
DOI: 10.1023/A:1009596207401
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.

Page view(s)

18
checked on Jan 19, 2018

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.