A self-adjusting quality of service control scheme

Sheng-Tzong Cheng, Ing Ray Chen

Research output: Contribution to journalArticle

1 Citation (Scopus)

Abstract

We propose and analyze a self-adjusting Quality of Service (QoS) control scheme with the goal of optimizing the system reward as a result of servicing different priority clients with varying workload, QoS and reward/penalty requirements. Our scheme is based on resource partitioning and designated "degrade QoS areas" such that system resources are partitioned into priority areas each of which is reserved specifically to serve only clients in a corresponding class with no QoS degradation, plus one "degraded QoS area" into which all clients can be admitted with QoS adjustment being applied only to the lowest priority clients. We show that the best partition is dictated by the workload and the reward/penalty characteristics of clients in difference priority classes. The analysis results can be used by a QoS manager to optimize the system total reward dynamically in response to changing workloads at run time. We demonstrate the validity of our scheme by means of simulation and comparing the proposed QoS self-adjusting scheme with those that do not use resource partitioning or designated degraded QoS areas.

Original languageEnglish
Pages (from-to)337-344
Number of pages8
JournalInformation Processing Letters
Volume83
Issue number6
DOIs
Publication statusPublished - 2002 Sep 30

Fingerprint

Quality of Service
Quality of service
Reward
Workload
Resources
Penalty
Partitioning
Lowest
Adjustment
Degradation
Managers
Optimise
Partition
Requirements
Demonstrate
Simulation

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Signal Processing
  • Information Systems
  • Computer Science Applications

Cite this

@article{db3c7db6d313484bafc033257abf918d,
title = "A self-adjusting quality of service control scheme",
abstract = "We propose and analyze a self-adjusting Quality of Service (QoS) control scheme with the goal of optimizing the system reward as a result of servicing different priority clients with varying workload, QoS and reward/penalty requirements. Our scheme is based on resource partitioning and designated {"}degrade QoS areas{"} such that system resources are partitioned into priority areas each of which is reserved specifically to serve only clients in a corresponding class with no QoS degradation, plus one {"}degraded QoS area{"} into which all clients can be admitted with QoS adjustment being applied only to the lowest priority clients. We show that the best partition is dictated by the workload and the reward/penalty characteristics of clients in difference priority classes. The analysis results can be used by a QoS manager to optimize the system total reward dynamically in response to changing workloads at run time. We demonstrate the validity of our scheme by means of simulation and comparing the proposed QoS self-adjusting scheme with those that do not use resource partitioning or designated degraded QoS areas.",
author = "Sheng-Tzong Cheng and Chen, {Ing Ray}",
year = "2002",
month = "9",
day = "30",
doi = "10.1016/S0020-0190(02)00212-0",
language = "English",
volume = "83",
pages = "337--344",
journal = "Information Processing Letters",
issn = "0020-0190",
publisher = "Elsevier",
number = "6",

}

A self-adjusting quality of service control scheme. / Cheng, Sheng-Tzong; Chen, Ing Ray.

In: Information Processing Letters, Vol. 83, No. 6, 30.09.2002, p. 337-344.

Research output: Contribution to journalArticle

TY - JOUR

T1 - A self-adjusting quality of service control scheme

AU - Cheng, Sheng-Tzong

AU - Chen, Ing Ray

PY - 2002/9/30

Y1 - 2002/9/30

N2 - We propose and analyze a self-adjusting Quality of Service (QoS) control scheme with the goal of optimizing the system reward as a result of servicing different priority clients with varying workload, QoS and reward/penalty requirements. Our scheme is based on resource partitioning and designated "degrade QoS areas" such that system resources are partitioned into priority areas each of which is reserved specifically to serve only clients in a corresponding class with no QoS degradation, plus one "degraded QoS area" into which all clients can be admitted with QoS adjustment being applied only to the lowest priority clients. We show that the best partition is dictated by the workload and the reward/penalty characteristics of clients in difference priority classes. The analysis results can be used by a QoS manager to optimize the system total reward dynamically in response to changing workloads at run time. We demonstrate the validity of our scheme by means of simulation and comparing the proposed QoS self-adjusting scheme with those that do not use resource partitioning or designated degraded QoS areas.

AB - We propose and analyze a self-adjusting Quality of Service (QoS) control scheme with the goal of optimizing the system reward as a result of servicing different priority clients with varying workload, QoS and reward/penalty requirements. Our scheme is based on resource partitioning and designated "degrade QoS areas" such that system resources are partitioned into priority areas each of which is reserved specifically to serve only clients in a corresponding class with no QoS degradation, plus one "degraded QoS area" into which all clients can be admitted with QoS adjustment being applied only to the lowest priority clients. We show that the best partition is dictated by the workload and the reward/penalty characteristics of clients in difference priority classes. The analysis results can be used by a QoS manager to optimize the system total reward dynamically in response to changing workloads at run time. We demonstrate the validity of our scheme by means of simulation and comparing the proposed QoS self-adjusting scheme with those that do not use resource partitioning or designated degraded QoS areas.

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

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

U2 - 10.1016/S0020-0190(02)00212-0

DO - 10.1016/S0020-0190(02)00212-0

M3 - Article

AN - SCOPUS:0037200867

VL - 83

SP - 337

EP - 344

JO - Information Processing Letters

JF - Information Processing Letters

SN - 0020-0190

IS - 6

ER -