HKUST Institutional Repository >
Electronic and Computer Engineering >
ECE Conference Papers >
Please use this identifier to cite or link to this item:
|Title: ||Hierarchical scheduling with adaptive weights for W-ATM|
|Authors: ||Huang, Hui|
Tsang, Danny H. K.
Kuehn, Paul J.
|Keywords: ||Medium access control (MAC)|
Fair queueing algorithms
Cell transfer delay
|Issue Date: ||May-1999 |
|Citation: ||IEEE ATM Workshop '99 Proceedings, Kochi, Japan, 24-27 May, 1999, pp. 337-342|
|Abstract: ||Medium access control (MAC) protocol is one of the key components for providing quality of service (QoS) in wireless ATM (W-ATM) networks. In this paper, we propose a hierarchical scheduling scheme coupled with fair queueing algorithms with adaptive weights. This scheme is intended to be applicable to a TDMA/TDD based MAC protocol. Specifically, the performance of the fair-queueing algorithm using fixed weights and adaptive weights are investigated. Simulation results show that the proposed hierarchical fair-queueing scheduling with adaptive weights (HAW) can yield a lower cell transfer delay and higher channel utilization while maintaining fairness among multiple users.|
|Rights: ||© 1999 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE. This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.|
|Appears in Collections:||ECE Conference Papers|
Files in This Item:
All items in this Repository are protected by copyright, with all rights reserved.