Scheduling of real/non-real time services in an AMC/TDM system

EXP/PF algorithm

Jong Hun Rhee, Dong Ku Kim

Research output: Contribution to journalArticle

7 Citations (Scopus)

Abstract

An efficient channel scheduler called the EXP/PF algorithm is proposed to provide real-time as well as non-real time data services demanded by mobile users in an adaptive modulation and coding in time division multiplexing (AMC/TDM) system. It is a composite scheduler of two scheduling schemes. One is the EXP rule applied to real time demanding services to guarantee some delay constraints. The other is based on the PF rule with resource controlling factor applied to non-real time demanding services for maximizing system throughput. Simulation results show that it provides a non-real time user with up to 57.5 % larger throughput than conventional one can.

Original languageEnglish
Pages (from-to)506-513
Number of pages8
JournalLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume2524
Publication statusPublished - 2003 Dec 1

Fingerprint

Adaptive Modulation and Coding
Adaptive modulation
Time division multiplexing
Multiplexing
Division
Scheduling
Throughput
Scheduler
Composite materials
Composite
Real-time
Resources
Simulation

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

@article{ab37f62e0152450495dc5f67eae1f59c,
title = "Scheduling of real/non-real time services in an AMC/TDM system: EXP/PF algorithm",
abstract = "An efficient channel scheduler called the EXP/PF algorithm is proposed to provide real-time as well as non-real time data services demanded by mobile users in an adaptive modulation and coding in time division multiplexing (AMC/TDM) system. It is a composite scheduler of two scheduling schemes. One is the EXP rule applied to real time demanding services to guarantee some delay constraints. The other is based on the PF rule with resource controlling factor applied to non-real time demanding services for maximizing system throughput. Simulation results show that it provides a non-real time user with up to 57.5 {\%} larger throughput than conventional one can.",
author = "Rhee, {Jong Hun} and Kim, {Dong Ku}",
year = "2003",
month = "12",
day = "1",
language = "English",
volume = "2524",
pages = "506--513",
journal = "Lecture Notes in Computer Science",
issn = "0302-9743",
publisher = "Springer Verlag",

}

TY - JOUR

T1 - Scheduling of real/non-real time services in an AMC/TDM system

T2 - EXP/PF algorithm

AU - Rhee, Jong Hun

AU - Kim, Dong Ku

PY - 2003/12/1

Y1 - 2003/12/1

N2 - An efficient channel scheduler called the EXP/PF algorithm is proposed to provide real-time as well as non-real time data services demanded by mobile users in an adaptive modulation and coding in time division multiplexing (AMC/TDM) system. It is a composite scheduler of two scheduling schemes. One is the EXP rule applied to real time demanding services to guarantee some delay constraints. The other is based on the PF rule with resource controlling factor applied to non-real time demanding services for maximizing system throughput. Simulation results show that it provides a non-real time user with up to 57.5 % larger throughput than conventional one can.

AB - An efficient channel scheduler called the EXP/PF algorithm is proposed to provide real-time as well as non-real time data services demanded by mobile users in an adaptive modulation and coding in time division multiplexing (AMC/TDM) system. It is a composite scheduler of two scheduling schemes. One is the EXP rule applied to real time demanding services to guarantee some delay constraints. The other is based on the PF rule with resource controlling factor applied to non-real time demanding services for maximizing system throughput. Simulation results show that it provides a non-real time user with up to 57.5 % larger throughput than conventional one can.

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

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

M3 - Article

VL - 2524

SP - 506

EP - 513

JO - Lecture Notes in Computer Science

JF - Lecture Notes in Computer Science

SN - 0302-9743

ER -