A burst-aware scheduling scheme supporting quality of service in wimax networks

Ya Yun Cheng*, Yaw-Chung Chen

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

The WiMAX features longer transmission distance and more accomplished support of QoS than other wireless access technologies such as 802.11. Since the standard did not specify the QoS based packet-scheduling algorithms which run on the base stations, those algorithms are open for alternative implementations. In this paper, we propose a scheduling algorithm for burst traffic in the WiMAX base station with reference scenario being a typical PMP deployment. Since most existing studies use strict Priority Queue (PQ) for different classes of services, it leads to starvation of lower priority services when the higher priority traffic is heavy. Our proposed algorithm aims to achieve better fairness than the previous approach and improve the throughput of burst data, yet still meets the QoS demands including delay constraint and minimum bandwidth requirement.

Original languageEnglish
Title of host publicationProceedings - 35th Annual IEEE International Computer Software and Applications Conference Workshops, COMPSACW 2011
Pages218-223
Number of pages6
DOIs
StatePublished - 2011
Event35th Annual IEEE International Computer Software and Applications Conference Workshops, COMPSACW 2011 - Munich, Germany
Duration: 18 Jul 201121 Jul 2011

Publication series

NameProceedings - International Computer Software and Applications Conference
ISSN (Print)0730-3157

Conference

Conference35th Annual IEEE International Computer Software and Applications Conference Workshops, COMPSACW 2011
Country/TerritoryGermany
CityMunich
Period18/07/1121/07/11

Keywords

  • Fairness
  • IEEE 802.16
  • QoS
  • Wimax

Fingerprint

Dive into the research topics of 'A burst-aware scheduling scheme supporting quality of service in wimax networks'. Together they form a unique fingerprint.

Cite this