Abstract

The application of asynchronous transfer mode (ATM) to a wireless local area network (WLAN) environment is a new undertaking and poses many problems not found in either wireline ATM or data-only WLAN networks. The WLAN is designed as a centralized network, where a complex base station polls simpler remote stations. A polling algorithm called distributed fair queueing (DFQ) is developed from the self-clocked fair queueing (SCFQ) service discipline. The DFQ protocol allows SCFQ performance in a wireless LAN environment where queue information is not automatically available to the poller. Bounds for delay for certain services are derived explicitly, and other services are shown to be derivable from fair queueing theory. A reasonable service mix is simulated to show delay performance versus system load.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.