Applying generalized Cμ-rule scheduling for resource allocation in OFDMA systems

Agustian Taufiq Asyhari, Htun Htun Win, Hoang Anh Tuan, Meixia Tao, Ying Chang Liang

Research output: Chapter in Book/Report/Conference proceedingConference proceeding

1 Citation (Scopus)

Abstract

We study the performance of generalized cμ-rule implementation in OFDMA systems, namely bit-based subcarrier allocation and packet-based subchannel allocation. While cμ-rule is asymptotically optimum in continuous-time server allocation, it needs to be adjusted when applied to discrete-time server allocation in OFDMA systems. Bit-based allocation considers the allocation through bit-based connectivity. Resource wastage is prevented by greedy reassignment in low traffic regime. Packet-based allocation adopts cμ-rule and allocates the servers through multiple-packet rates. The allocation is ordered from the server with lowest connectivity to the server with highest connectivity. Simulation results show that bit-based allocation outperforms packet-based allocation in queue length minimization for small number of users. With increasing number of users, the performance difference becomes smaller and at the certain limit, the packet-based allocation performs better. Furthermore, the packet-based allocation might be better in practical realization due to the lower complexity.

Original languageEnglish
Title of host publication2006 IEEE Singapore International Conference on Communication Systems, ICCS 2006
Number of pages5
ISBN (Electronic)1424404118
DOIs
Publication statusPublished - 1 Dec 2006
Externally publishedYes
Event10th IEEE Singapore International Conference on Communications Systems, ICCS 2006 - Singapore, Singapore
Duration: 30 Oct 20061 Nov 2006

Conference

Conference10th IEEE Singapore International Conference on Communications Systems, ICCS 2006
CountrySingapore
CitySingapore
Period30/10/061/11/06

Fingerprint

Resource allocation
scheduling
Servers
Scheduling
resources
performance
traffic
regime
simulation

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Communication
  • Electrical and Electronic Engineering

Cite this

Asyhari, A. T., Win, H. H., Tuan, H. A., Tao, M., & Liang, Y. C. (2006). Applying generalized Cμ-rule scheduling for resource allocation in OFDMA systems. In 2006 IEEE Singapore International Conference on Communication Systems, ICCS 2006 [4085705] https://doi.org/10.1109/ICCS.2006.301410

Applying generalized Cμ-rule scheduling for resource allocation in OFDMA systems. / Asyhari, Agustian Taufiq; Win, Htun Htun; Tuan, Hoang Anh; Tao, Meixia; Liang, Ying Chang.

2006 IEEE Singapore International Conference on Communication Systems, ICCS 2006. 2006. 4085705.

Research output: Chapter in Book/Report/Conference proceedingConference proceeding

Asyhari, AT, Win, HH, Tuan, HA, Tao, M & Liang, YC 2006, Applying generalized Cμ-rule scheduling for resource allocation in OFDMA systems. in 2006 IEEE Singapore International Conference on Communication Systems, ICCS 2006., 4085705, 10th IEEE Singapore International Conference on Communications Systems, ICCS 2006, Singapore, Singapore, 30/10/06. https://doi.org/10.1109/ICCS.2006.301410
Asyhari AT, Win HH, Tuan HA, Tao M, Liang YC. Applying generalized Cμ-rule scheduling for resource allocation in OFDMA systems. In 2006 IEEE Singapore International Conference on Communication Systems, ICCS 2006. 2006. 4085705 https://doi.org/10.1109/ICCS.2006.301410
Asyhari, Agustian Taufiq ; Win, Htun Htun ; Tuan, Hoang Anh ; Tao, Meixia ; Liang, Ying Chang. / Applying generalized Cμ-rule scheduling for resource allocation in OFDMA systems. 2006 IEEE Singapore International Conference on Communication Systems, ICCS 2006. 2006.
@inproceedings{943ee9df64304c4c8f71a465352d8968,
title = "Applying generalized Cμ-rule scheduling for resource allocation in OFDMA systems",
abstract = "We study the performance of generalized cμ-rule implementation in OFDMA systems, namely bit-based subcarrier allocation and packet-based subchannel allocation. While cμ-rule is asymptotically optimum in continuous-time server allocation, it needs to be adjusted when applied to discrete-time server allocation in OFDMA systems. Bit-based allocation considers the allocation through bit-based connectivity. Resource wastage is prevented by greedy reassignment in low traffic regime. Packet-based allocation adopts cμ-rule and allocates the servers through multiple-packet rates. The allocation is ordered from the server with lowest connectivity to the server with highest connectivity. Simulation results show that bit-based allocation outperforms packet-based allocation in queue length minimization for small number of users. With increasing number of users, the performance difference becomes smaller and at the certain limit, the packet-based allocation performs better. Furthermore, the packet-based allocation might be better in practical realization due to the lower complexity.",
author = "Asyhari, {Agustian Taufiq} and Win, {Htun Htun} and Tuan, {Hoang Anh} and Meixia Tao and Liang, {Ying Chang}",
year = "2006",
month = "12",
day = "1",
doi = "10.1109/ICCS.2006.301410",
language = "English",
isbn = "9781424404117",
booktitle = "2006 IEEE Singapore International Conference on Communication Systems, ICCS 2006",

}

TY - GEN

T1 - Applying generalized Cμ-rule scheduling for resource allocation in OFDMA systems

AU - Asyhari, Agustian Taufiq

AU - Win, Htun Htun

AU - Tuan, Hoang Anh

AU - Tao, Meixia

AU - Liang, Ying Chang

PY - 2006/12/1

Y1 - 2006/12/1

N2 - We study the performance of generalized cμ-rule implementation in OFDMA systems, namely bit-based subcarrier allocation and packet-based subchannel allocation. While cμ-rule is asymptotically optimum in continuous-time server allocation, it needs to be adjusted when applied to discrete-time server allocation in OFDMA systems. Bit-based allocation considers the allocation through bit-based connectivity. Resource wastage is prevented by greedy reassignment in low traffic regime. Packet-based allocation adopts cμ-rule and allocates the servers through multiple-packet rates. The allocation is ordered from the server with lowest connectivity to the server with highest connectivity. Simulation results show that bit-based allocation outperforms packet-based allocation in queue length minimization for small number of users. With increasing number of users, the performance difference becomes smaller and at the certain limit, the packet-based allocation performs better. Furthermore, the packet-based allocation might be better in practical realization due to the lower complexity.

AB - We study the performance of generalized cμ-rule implementation in OFDMA systems, namely bit-based subcarrier allocation and packet-based subchannel allocation. While cμ-rule is asymptotically optimum in continuous-time server allocation, it needs to be adjusted when applied to discrete-time server allocation in OFDMA systems. Bit-based allocation considers the allocation through bit-based connectivity. Resource wastage is prevented by greedy reassignment in low traffic regime. Packet-based allocation adopts cμ-rule and allocates the servers through multiple-packet rates. The allocation is ordered from the server with lowest connectivity to the server with highest connectivity. Simulation results show that bit-based allocation outperforms packet-based allocation in queue length minimization for small number of users. With increasing number of users, the performance difference becomes smaller and at the certain limit, the packet-based allocation performs better. Furthermore, the packet-based allocation might be better in practical realization due to the lower complexity.

UR - http://www.scopus.com/inward/record.url?scp=46949085760&partnerID=8YFLogxK

U2 - 10.1109/ICCS.2006.301410

DO - 10.1109/ICCS.2006.301410

M3 - Conference proceeding

SN - 9781424404117

SN - 142440410X

BT - 2006 IEEE Singapore International Conference on Communication Systems, ICCS 2006

ER -