Dynamic quota-based admission control with sub-rating in multimedia servers

Sheng Tzong Cheng, Chi Ming Chen, Ing Ray Chen

Research output: Contribution to journalArticle

29 Citations (Scopus)

Abstract

An admission control algorithm for a multimedia server is responsible for determining if a new request can be accepted without violating the Quality of Service (QoS) requirements of the existing requests in the system. A novel quota-based admission control algorithm with sub-rating for two priority classes of requests is proposed in this study. The server capacity is divided into three partitions based on the quota values: one for each class of requests and one common pool shared by two classes of requests. Reward and penalty are adopted in the proposed system model. High-priority requests are associated with higher values of reward as well as penalty than low-priority ones. Given the characteristics of the system workload, the proposed algorithm finds the best partitions, optimizing the system performance based on the objective function of the total reward minus the total penalty. The sub-rating mechanism will reduce the QoS requirements of several low- priority clients, by cutting out a small fraction of the assigned server capacity, to accept a new high-priority client and to achieve a higher net earning value. A stochastic Petri-Net model is used to find the optimal quota values and two approximation approaches are developed to find sub-optimal settings. The experiment results show that the proposed algorithm performs better than one without sub-rating mechanism, and that the sub-optimal solutions found by the proposed approximation approaches are very close to optimal ones. The approximation approaches enable the algorithm to dynamically adjust the quota values, based on the characteristics of the system workload, to achieve higher system performance.

Original languageEnglish
Pages (from-to)83-91
Number of pages9
JournalMultimedia Systems
Volume8
Issue number2
DOIs
Publication statusPublished - 2000 Jan 1

Fingerprint

Access control
Servers
Quality of service
Petri nets
Experiments

All Science Journal Classification (ASJC) codes

  • Software
  • Information Systems
  • Media Technology
  • Hardware and Architecture
  • Computer Networks and Communications

Cite this

Cheng, Sheng Tzong ; Chen, Chi Ming ; Chen, Ing Ray. / Dynamic quota-based admission control with sub-rating in multimedia servers. In: Multimedia Systems. 2000 ; Vol. 8, No. 2. pp. 83-91.
@article{3b573730bac946eba2577bd1a8112b54,
title = "Dynamic quota-based admission control with sub-rating in multimedia servers",
abstract = "An admission control algorithm for a multimedia server is responsible for determining if a new request can be accepted without violating the Quality of Service (QoS) requirements of the existing requests in the system. A novel quota-based admission control algorithm with sub-rating for two priority classes of requests is proposed in this study. The server capacity is divided into three partitions based on the quota values: one for each class of requests and one common pool shared by two classes of requests. Reward and penalty are adopted in the proposed system model. High-priority requests are associated with higher values of reward as well as penalty than low-priority ones. Given the characteristics of the system workload, the proposed algorithm finds the best partitions, optimizing the system performance based on the objective function of the total reward minus the total penalty. The sub-rating mechanism will reduce the QoS requirements of several low- priority clients, by cutting out a small fraction of the assigned server capacity, to accept a new high-priority client and to achieve a higher net earning value. A stochastic Petri-Net model is used to find the optimal quota values and two approximation approaches are developed to find sub-optimal settings. The experiment results show that the proposed algorithm performs better than one without sub-rating mechanism, and that the sub-optimal solutions found by the proposed approximation approaches are very close to optimal ones. The approximation approaches enable the algorithm to dynamically adjust the quota values, based on the characteristics of the system workload, to achieve higher system performance.",
author = "Cheng, {Sheng Tzong} and Chen, {Chi Ming} and Chen, {Ing Ray}",
year = "2000",
month = "1",
day = "1",
doi = "10.1007/s005300050152",
language = "English",
volume = "8",
pages = "83--91",
journal = "Multimedia Systems",
issn = "0942-4962",
publisher = "Springer Verlag",
number = "2",

}

Dynamic quota-based admission control with sub-rating in multimedia servers. / Cheng, Sheng Tzong; Chen, Chi Ming; Chen, Ing Ray.

In: Multimedia Systems, Vol. 8, No. 2, 01.01.2000, p. 83-91.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Dynamic quota-based admission control with sub-rating in multimedia servers

AU - Cheng, Sheng Tzong

AU - Chen, Chi Ming

AU - Chen, Ing Ray

PY - 2000/1/1

Y1 - 2000/1/1

N2 - An admission control algorithm for a multimedia server is responsible for determining if a new request can be accepted without violating the Quality of Service (QoS) requirements of the existing requests in the system. A novel quota-based admission control algorithm with sub-rating for two priority classes of requests is proposed in this study. The server capacity is divided into three partitions based on the quota values: one for each class of requests and one common pool shared by two classes of requests. Reward and penalty are adopted in the proposed system model. High-priority requests are associated with higher values of reward as well as penalty than low-priority ones. Given the characteristics of the system workload, the proposed algorithm finds the best partitions, optimizing the system performance based on the objective function of the total reward minus the total penalty. The sub-rating mechanism will reduce the QoS requirements of several low- priority clients, by cutting out a small fraction of the assigned server capacity, to accept a new high-priority client and to achieve a higher net earning value. A stochastic Petri-Net model is used to find the optimal quota values and two approximation approaches are developed to find sub-optimal settings. The experiment results show that the proposed algorithm performs better than one without sub-rating mechanism, and that the sub-optimal solutions found by the proposed approximation approaches are very close to optimal ones. The approximation approaches enable the algorithm to dynamically adjust the quota values, based on the characteristics of the system workload, to achieve higher system performance.

AB - An admission control algorithm for a multimedia server is responsible for determining if a new request can be accepted without violating the Quality of Service (QoS) requirements of the existing requests in the system. A novel quota-based admission control algorithm with sub-rating for two priority classes of requests is proposed in this study. The server capacity is divided into three partitions based on the quota values: one for each class of requests and one common pool shared by two classes of requests. Reward and penalty are adopted in the proposed system model. High-priority requests are associated with higher values of reward as well as penalty than low-priority ones. Given the characteristics of the system workload, the proposed algorithm finds the best partitions, optimizing the system performance based on the objective function of the total reward minus the total penalty. The sub-rating mechanism will reduce the QoS requirements of several low- priority clients, by cutting out a small fraction of the assigned server capacity, to accept a new high-priority client and to achieve a higher net earning value. A stochastic Petri-Net model is used to find the optimal quota values and two approximation approaches are developed to find sub-optimal settings. The experiment results show that the proposed algorithm performs better than one without sub-rating mechanism, and that the sub-optimal solutions found by the proposed approximation approaches are very close to optimal ones. The approximation approaches enable the algorithm to dynamically adjust the quota values, based on the characteristics of the system workload, to achieve higher system performance.

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

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

U2 - 10.1007/s005300050152

DO - 10.1007/s005300050152

M3 - Article

AN - SCOPUS:0037645949

VL - 8

SP - 83

EP - 91

JO - Multimedia Systems

JF - Multimedia Systems

SN - 0942-4962

IS - 2

ER -