Token bank fair queuing: a new scheduling algorithm for wireless multimedia services

The token bank fair queuing algorithm (TBFQ) is a novel scheduling algorithm that is suitable for wireless multimedia services. The bandwidth allocation mechanism integrates the leaky bucket structure with priority handling to address the problem of providing quality‐of‐service (QoS) guarantees to h...

Full description

Saved in:
Bibliographic Details
Published in:International journal of communication systems 2004-08, Vol.17 (6), p.591-614
Main Authors: Wong, William K., Tang, Helen Y., Leung, Victor C. M.
Format: Article
Language:English
Subjects:
Algorithms
Banks
call admission control
Channels
fair queuing
heterogeneous network
interoperability
medium access control protocol
Multimedia
Networks
Provisioning
QoS
Queues
Scheduling
wireless scheduling
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The token bank fair queuing algorithm (TBFQ) is a novel scheduling algorithm that is suitable for wireless multimedia services. The bandwidth allocation mechanism integrates the leaky bucket structure with priority handling to address the problem of providing quality‐of‐service (QoS) guarantees to heterogeneous applications in the next generation packet‐switched wireless networks. Scheduling algorithms are often tightly integrated with the wireless medium access control (MAC) protocol. However, when heterogeneous wireless systems need to be integrated and interoperate with each other, it is desirable from the QoS provisioning standpoint to decouple scheduling algorithm from the MAC protocol. In this paper we propose a framework of seamless QoS provisioning and the application of TBFQ for uplink and downlink scheduling in wireless networks. We study its performance under a generic medium access framework that enables the algorithm to be generalized to provide QoS guarantees under various medium access schemes. We give a brief analysis of the algorithm and compare its performance with common scheduling algorithms through simulation. Our results demonstrate that TBFQ significantly increases wireless channel utilization while maintaining the same QoS, unlike many fair queuing algorithms, TBFQ does not require time‐stamping information of each packet arrival—an impractical feature in an already resource scarce environment. This makes TBFQ suitable for wireless multimedia communication. Copyright © 2004 John Wiley & Sons, Ltd.
ISSN:1074-5351
1099-1131
DOI:10.1002/dac.670