A virtual DRC-based packet scheduling algorithm for cdma2000 1xEV-DO System

Ill Seon Jang, Seung Eun Hong, Chung Gu Kang

Research output: Contribution to journalArticle

Abstract

In most of broadband wireless data access systems including the cdma2000 1xEV-DO system, a maximum possible data rate prescribed by the channel condition of a terminal is reflected into the priority metric in the course of packet scheduling. Particular examples of packet scheduling algorithms include the proportional fairness and modified largest weighted delay first (M-LWDF) packet scheduling schemes. We note that all of these existing algorithms suffer from a so-called rate-length mismatch problem, which may seriously degrade the system performance. In this paper, we devise a new priority metric based on a concept of virtual DRC (Data Rate Control) to solve this particular problem. It has been shown that our virtual DRC-based packet scheduling algorithm always works better than or at least equivalently to the conventional one.

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

Fingerprint

3G mobile communication systems
Packet Scheduling
Rate Control
Scheduling algorithms
Scheduling Algorithm
Scheduling
Proportional Fairness
Information Systems
Metric
Broadband
System Performance

ASJC Scopus subject areas

  • Computer Science(all)
  • Biochemistry, Genetics and Molecular Biology(all)
  • Theoretical Computer Science

Cite this

@article{affb3f4216534555b2347f5f7dc4de7f,
title = "A virtual DRC-based packet scheduling algorithm for cdma2000 1xEV-DO System",
abstract = "In most of broadband wireless data access systems including the cdma2000 1xEV-DO system, a maximum possible data rate prescribed by the channel condition of a terminal is reflected into the priority metric in the course of packet scheduling. Particular examples of packet scheduling algorithms include the proportional fairness and modified largest weighted delay first (M-LWDF) packet scheduling schemes. We note that all of these existing algorithms suffer from a so-called rate-length mismatch problem, which may seriously degrade the system performance. In this paper, we devise a new priority metric based on a concept of virtual DRC (Data Rate Control) to solve this particular problem. It has been shown that our virtual DRC-based packet scheduling algorithm always works better than or at least equivalently to the conventional one.",
author = "Jang, {Ill Seon} and Hong, {Seung Eun} and Kang, {Chung Gu}",
year = "2003",
month = "12",
day = "1",
language = "English",
volume = "2524",
pages = "51--62",
journal = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
issn = "0302-9743",
publisher = "Springer Verlag",

}

TY - JOUR

T1 - A virtual DRC-based packet scheduling algorithm for cdma2000 1xEV-DO System

AU - Jang, Ill Seon

AU - Hong, Seung Eun

AU - Kang, Chung Gu

PY - 2003/12/1

Y1 - 2003/12/1

N2 - In most of broadband wireless data access systems including the cdma2000 1xEV-DO system, a maximum possible data rate prescribed by the channel condition of a terminal is reflected into the priority metric in the course of packet scheduling. Particular examples of packet scheduling algorithms include the proportional fairness and modified largest weighted delay first (M-LWDF) packet scheduling schemes. We note that all of these existing algorithms suffer from a so-called rate-length mismatch problem, which may seriously degrade the system performance. In this paper, we devise a new priority metric based on a concept of virtual DRC (Data Rate Control) to solve this particular problem. It has been shown that our virtual DRC-based packet scheduling algorithm always works better than or at least equivalently to the conventional one.

AB - In most of broadband wireless data access systems including the cdma2000 1xEV-DO system, a maximum possible data rate prescribed by the channel condition of a terminal is reflected into the priority metric in the course of packet scheduling. Particular examples of packet scheduling algorithms include the proportional fairness and modified largest weighted delay first (M-LWDF) packet scheduling schemes. We note that all of these existing algorithms suffer from a so-called rate-length mismatch problem, which may seriously degrade the system performance. In this paper, we devise a new priority metric based on a concept of virtual DRC (Data Rate Control) to solve this particular problem. It has been shown that our virtual DRC-based packet scheduling algorithm always works better than or at least equivalently to the conventional one.

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

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

M3 - Article

AN - SCOPUS:35248880720

VL - 2524

SP - 51

EP - 62

JO - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

JF - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SN - 0302-9743

ER -