Scheduling disciplines for multimedia WLANs: embedded round robin and wireless dual queue


Conference paper


Ravindra S. Ranasinghe, L. Andrew, D. A. Hayes, D. Everitt
Proceedings of IEEE International Conference on Communications. Conference (ICC), 2001 Jun, pp. 1243--1248


View PDF Semantic Scholar DBLP DOI
Cite

Cite

APA   Click to copy
Ranasinghe, R. S., Andrew, L., Hayes, D. A., & Everitt, D. (2001). Scheduling disciplines for multimedia WLANs: embedded round robin and wireless dual queue. In Proceedings of IEEE International Conference on Communications. Conference (ICC) (pp. 1243–1248). https://doi.org/10.1109/ICC.2001.936890


Chicago/Turabian   Click to copy
Ranasinghe, Ravindra S., L. Andrew, D. A. Hayes, and D. Everitt. “Scheduling Disciplines for Multimedia WLANs: Embedded Round Robin and Wireless Dual Queue.” In Proceedings of IEEE International Conference on Communications. Conference (ICC), 1243–1248, 2001.


MLA   Click to copy
Ranasinghe, Ravindra S., et al. “Scheduling Disciplines for Multimedia WLANs: Embedded Round Robin and Wireless Dual Queue.” Proceedings of IEEE International Conference on Communications. Conference (ICC), 2001, pp. 1243–48, doi:10.1109/ICC.2001.936890.


BibTeX   Click to copy

@inproceedings{ravindra2001a,
  title = {Scheduling disciplines for multimedia WLANs: embedded round robin and wireless dual queue},
  year = {2001},
  month = jun,
  pages = {1243--1248},
  doi = {10.1109/ICC.2001.936890},
  author = {Ranasinghe, Ravindra S. and Andrew, L. and Hayes, D. A. and Everitt, D.},
  booktitle = {Proceedings of IEEE International Conference on Communications. Conference (ICC)},
  month_numeric = {6}
}

Abstract

Wireless local area networks have developed into a promising solution to support advanced data services in untethered environments. Selection of an efficient packet-scheduling scheme is important for managing the bandwidth while satisfying QoS requirements of active sessions having diverse traffic characteristics. The key difficulty is the distributed nature of the queues in the uplink, resulting in the scheduler having to trade off polling greedy stations against wasting resources by polling potentially idle stations. In order to address this, we propose a novel scheduling scheme, "embedded round robin", which dynamically classifies stations as "busy" and "clear". We then extend the previously proposed dual queue scheduling discipline to the case of wireless networks.


Share


Follow this website


You need to create an Owlstown account to follow this website.


Sign up

Already an Owlstown member?

Log in