Frame-level asymptotic analysis of real-time scheduling policy for wireless networks

K. K. Lee

doi:10.1049/el:20071559

Frame-level asymptotic analysis of real-time scheduling policy for wireless networks

K. K. Lee

Hong Kong Metropolitan University

Research output: Contribution to journal › Article › peer-review

Abstract

A wireless scheduling policy for real-time applications is proposed and analysed. In the short term, the policy is fairer than the near-optimal feasible earliest due date algorithm. Using the delay-model approach, a frame-level asymptotic analysis is presented. A simple and accurate approximate expression is also obtained.

Original language	English
Pages (from-to)	1033-1034
Number of pages	2
Journal	Electronics Letters
Volume	43
Issue number	19
DOIs	https://doi.org/10.1049/el:20071559
Publication status	Published - 2007

Access to Document

10.1049/el:20071559

Cite this

@article{0bdcafc8ddaf42e28c6b9576744b0782,

title = "Frame-level asymptotic analysis of real-time scheduling policy for wireless networks",

abstract = "A wireless scheduling policy for real-time applications is proposed and analysed. In the short term, the policy is fairer than the near-optimal feasible earliest due date algorithm. Using the delay-model approach, a frame-level asymptotic analysis is presented. A simple and accurate approximate expression is also obtained.",

author = "Lee, \{K. K.\}",

year = "2007",

doi = "10.1049/el:20071559",

language = "English",

volume = "43",

pages = "1033--1034",

number = "19",

}

TY - JOUR

T1 - Frame-level asymptotic analysis of real-time scheduling policy for wireless networks

AU - Lee, K. K.

PY - 2007

Y1 - 2007

N2 - A wireless scheduling policy for real-time applications is proposed and analysed. In the short term, the policy is fairer than the near-optimal feasible earliest due date algorithm. Using the delay-model approach, a frame-level asymptotic analysis is presented. A simple and accurate approximate expression is also obtained.

AB - A wireless scheduling policy for real-time applications is proposed and analysed. In the short term, the policy is fairer than the near-optimal feasible earliest due date algorithm. Using the delay-model approach, a frame-level asymptotic analysis is presented. A simple and accurate approximate expression is also obtained.

UR - https://www.scopus.com/pages/publications/34548625505

U2 - 10.1049/el:20071559

DO - 10.1049/el:20071559

M3 - Article

AN - SCOPUS:34548625505

SN - 0013-5194

VL - 43

SP - 1033

EP - 1034

JO - Electronics Letters

JF - Electronics Letters

IS - 19

ER -

Frame-level asymptotic analysis of real-time scheduling policy for wireless networks

Abstract

Access to Document

Other files and links

Fingerprint

Cite this