Premium
Frame‐based adaptive uplink scheduling algorithm in orthogonal frequency division multiple access‐based Worldwide Interoperability for Microwave Access networks
Author(s) -
Hwang BorJiunn,
Hwang IShyan,
Huang ChihWei
Publication year - 2012
Publication title -
international journal of communication systems
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.344
H-Index - 49
eISSN - 1099-1131
pISSN - 1074-5351
DOI - 10.1002/dac.1313
Subject(s) - computer science , scheduling (production processes) , computer network , telecommunications link , network packet , bandwidth (computing) , jitter , frame (networking) , interoperability , real time computing , bandwidth allocation , algorithm , telecommunications , operations management , economics , operating system
SUMMARY Because the orthogonal frequency division multiple access physical resource available for scheduling in Worldwide Interoperability for Microwave Access networks is frame by frame, an uplink scheduler located at the base station must efficiently allocate available resources to the subscriber stations in response to constant or bursty data traffic on a per‐frame basis. Available resources for real‐time and nonreal‐time traffics, called frame‐based adaptive bandwidth allocation and minimum guarantee and weight‐based bandwidth allocation, respectively, are proposed in this paper. Moreover, both short‐term and long‐term bandwidth predictions for traffic are incorporated so that the long‐term bandwidth prediction can have sustainable throughput requirement, and the short‐term bandwidth prediction can meet the objectives of low delay and jitter. For the scenarios studied, it shows that system performance of the proposed algorithm is better than the hybrid (earliest deadline first + weighted fair queuing + FIFO) algorithm in terms of packet delay, jitter, throughput, and fairness. Copyright © 2011 John Wiley & Sons, Ltd.