Downlink packet scheduling with minimum throughput guarantee in TDD-OFDMA cellular network

Young Min Ki, Eun Sun Kim, Sung Il Woo, Dong Ku Kim

Research output: Contribution to journalConference article

2 Citations (Scopus)

Abstract

This paper proposes a channel scheduler in downlink of IEEE 802.16e TDD-OFDMA cellular network which provides users the minimum throughput for best effort traffic. The proposed scheduler is further developed in the consideration of the case that network might become unfeasible, where extra weight functions are introduced into the proportional fair (PF) scheduler so that the proposed extra weight function provides more resources to users who are easier to achieve the target throughput than those who cannot. It does not guarantee target through-put for all users but eventually increases the number of users being served with the guaranteed minimum throughput. It is investigated for the proposed schedulers and other conventional ones how large the throughput is and how many users are guaranteed the target throughput. Simulation results show that the proposed algorithms have 10 to 20 % more users being served with the minimum guaranteed throughput. The trade-off between the throughput guarantee level and sector throughput is shown in the proposed schedulers.

Original languageEnglish
Pages (from-to)623-633
Number of pages11
JournalLecture Notes in Computer Science
Volume3462
Publication statusPublished - 2005 Sep 26
Event4th International IFIP-TC6 Networking Conference: Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communications Systems, NETWORKING 2005 - Waterloo, Ont., Canada
Duration: 2005 May 22005 May 6

Fingerprint

Packet Scheduling
Orthogonal Frequency Division multiple Access (OFDMA)
Cellular Networks
Throughput
Scheduling
Scheduler
Weight Function
Target
IEEE 802.16e
Sector
Trade-offs
Directly proportional
Traffic
Resources

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

@article{e5e53372cb924452b8b5fd122f76db91,
title = "Downlink packet scheduling with minimum throughput guarantee in TDD-OFDMA cellular network",
abstract = "This paper proposes a channel scheduler in downlink of IEEE 802.16e TDD-OFDMA cellular network which provides users the minimum throughput for best effort traffic. The proposed scheduler is further developed in the consideration of the case that network might become unfeasible, where extra weight functions are introduced into the proportional fair (PF) scheduler so that the proposed extra weight function provides more resources to users who are easier to achieve the target throughput than those who cannot. It does not guarantee target through-put for all users but eventually increases the number of users being served with the guaranteed minimum throughput. It is investigated for the proposed schedulers and other conventional ones how large the throughput is and how many users are guaranteed the target throughput. Simulation results show that the proposed algorithms have 10 to 20 {\%} more users being served with the minimum guaranteed throughput. The trade-off between the throughput guarantee level and sector throughput is shown in the proposed schedulers.",
author = "Ki, {Young Min} and Kim, {Eun Sun} and Woo, {Sung Il} and Kim, {Dong Ku}",
year = "2005",
month = "9",
day = "26",
language = "English",
volume = "3462",
pages = "623--633",
journal = "Lecture Notes in Computer Science",
issn = "0302-9743",
publisher = "Springer Verlag",

}

Downlink packet scheduling with minimum throughput guarantee in TDD-OFDMA cellular network. / Ki, Young Min; Kim, Eun Sun; Woo, Sung Il; Kim, Dong Ku.

In: Lecture Notes in Computer Science, Vol. 3462, 26.09.2005, p. 623-633.

Research output: Contribution to journalConference article

TY - JOUR

T1 - Downlink packet scheduling with minimum throughput guarantee in TDD-OFDMA cellular network

AU - Ki, Young Min

AU - Kim, Eun Sun

AU - Woo, Sung Il

AU - Kim, Dong Ku

PY - 2005/9/26

Y1 - 2005/9/26

N2 - This paper proposes a channel scheduler in downlink of IEEE 802.16e TDD-OFDMA cellular network which provides users the minimum throughput for best effort traffic. The proposed scheduler is further developed in the consideration of the case that network might become unfeasible, where extra weight functions are introduced into the proportional fair (PF) scheduler so that the proposed extra weight function provides more resources to users who are easier to achieve the target throughput than those who cannot. It does not guarantee target through-put for all users but eventually increases the number of users being served with the guaranteed minimum throughput. It is investigated for the proposed schedulers and other conventional ones how large the throughput is and how many users are guaranteed the target throughput. Simulation results show that the proposed algorithms have 10 to 20 % more users being served with the minimum guaranteed throughput. The trade-off between the throughput guarantee level and sector throughput is shown in the proposed schedulers.

AB - This paper proposes a channel scheduler in downlink of IEEE 802.16e TDD-OFDMA cellular network which provides users the minimum throughput for best effort traffic. The proposed scheduler is further developed in the consideration of the case that network might become unfeasible, where extra weight functions are introduced into the proportional fair (PF) scheduler so that the proposed extra weight function provides more resources to users who are easier to achieve the target throughput than those who cannot. It does not guarantee target through-put for all users but eventually increases the number of users being served with the guaranteed minimum throughput. It is investigated for the proposed schedulers and other conventional ones how large the throughput is and how many users are guaranteed the target throughput. Simulation results show that the proposed algorithms have 10 to 20 % more users being served with the minimum guaranteed throughput. The trade-off between the throughput guarantee level and sector throughput is shown in the proposed schedulers.

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

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

M3 - Conference article

VL - 3462

SP - 623

EP - 633

JO - Lecture Notes in Computer Science

JF - Lecture Notes in Computer Science

SN - 0302-9743

ER -