Performance evaluation of an admission control algorithm: Dynamic threshold with negotiation

Sheng-Tzong Cheng, Chi Ming Chen, Ing Ray Chen

Research output: Contribution to journalArticle

27 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 QoS requirements of the existing requests in the system. Most admission control algorithms treat every request uniformly and hence optimize the system performance by maximizing the number of admitted and served requests. In practice, requests might have different levels of importance to the system. Requests offering high contribution or reward to the system performance deserve priority treatment. Failure of accepting a high-priority request would incur high penalty to the system. A novel threshold-based admission control algorithm with negotiation for two priority classes of requests is proposed in our previous study. The server capacity is divided into three partitions based on the threshold 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. In this paper, given the characteristics of the system workload, the proposed analytical models aim to finds the best partitions, optimizing the system performance based on the objective function of the total reward minus the total penalty. The negotiation mechanism reduces 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. Stochastic Petri-Net model is used to find the optimal threshold values and two analytical methods are developed to find sub-optimal settings. The experiment results show that the sub-optimal solutions found by the proposed analytical methods are very close to optimal ones. The methods enable the algorithm to dynamically adjust the threshold values, based on the characteristics of the system workload, to achieve higher system performance.

Original languageEnglish
Pages (from-to)1-13
Number of pages13
JournalPerformance Evaluation
Volume52
Issue number1
DOIs
Publication statusPublished - 2003 Mar 1

Fingerprint

Admission Control
Access control
Control Algorithm
Performance Evaluation
Servers
Reward
Penalty
System Performance
Threshold Value
Quality of service
Server
Analytical Methods
Workload
Petri nets
Analytical models
Partition
Stochastic Petri Nets
Requirements
Analytical Model
Multimedia

All Science Journal Classification (ASJC) codes

  • Software
  • Modelling and Simulation
  • Hardware and Architecture
  • Computer Networks and Communications

Cite this

@article{ac57ed08b6544cab8a3b4e7fa9357c8a,
title = "Performance evaluation of an admission control algorithm: Dynamic threshold with negotiation",
abstract = "An admission control algorithm for a multimedia server is responsible for determining if a new request can be accepted without violating the QoS requirements of the existing requests in the system. Most admission control algorithms treat every request uniformly and hence optimize the system performance by maximizing the number of admitted and served requests. In practice, requests might have different levels of importance to the system. Requests offering high contribution or reward to the system performance deserve priority treatment. Failure of accepting a high-priority request would incur high penalty to the system. A novel threshold-based admission control algorithm with negotiation for two priority classes of requests is proposed in our previous study. The server capacity is divided into three partitions based on the threshold 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. In this paper, given the characteristics of the system workload, the proposed analytical models aim to finds the best partitions, optimizing the system performance based on the objective function of the total reward minus the total penalty. The negotiation mechanism reduces 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. Stochastic Petri-Net model is used to find the optimal threshold values and two analytical methods are developed to find sub-optimal settings. The experiment results show that the sub-optimal solutions found by the proposed analytical methods are very close to optimal ones. The methods enable the algorithm to dynamically adjust the threshold values, based on the characteristics of the system workload, to achieve higher system performance.",
author = "Sheng-Tzong Cheng and Chen, {Chi Ming} and Chen, {Ing Ray}",
year = "2003",
month = "3",
day = "1",
doi = "10.1016/S0166-5316(02)00128-1",
language = "English",
volume = "52",
pages = "1--13",
journal = "Performance Evaluation",
issn = "0166-5316",
publisher = "Elsevier",
number = "1",

}

Performance evaluation of an admission control algorithm : Dynamic threshold with negotiation. / Cheng, Sheng-Tzong; Chen, Chi Ming; Chen, Ing Ray.

In: Performance Evaluation, Vol. 52, No. 1, 01.03.2003, p. 1-13.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Performance evaluation of an admission control algorithm

T2 - Dynamic threshold with negotiation

AU - Cheng, Sheng-Tzong

AU - Chen, Chi Ming

AU - Chen, Ing Ray

PY - 2003/3/1

Y1 - 2003/3/1

N2 - An admission control algorithm for a multimedia server is responsible for determining if a new request can be accepted without violating the QoS requirements of the existing requests in the system. Most admission control algorithms treat every request uniformly and hence optimize the system performance by maximizing the number of admitted and served requests. In practice, requests might have different levels of importance to the system. Requests offering high contribution or reward to the system performance deserve priority treatment. Failure of accepting a high-priority request would incur high penalty to the system. A novel threshold-based admission control algorithm with negotiation for two priority classes of requests is proposed in our previous study. The server capacity is divided into three partitions based on the threshold 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. In this paper, given the characteristics of the system workload, the proposed analytical models aim to finds the best partitions, optimizing the system performance based on the objective function of the total reward minus the total penalty. The negotiation mechanism reduces 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. Stochastic Petri-Net model is used to find the optimal threshold values and two analytical methods are developed to find sub-optimal settings. The experiment results show that the sub-optimal solutions found by the proposed analytical methods are very close to optimal ones. The methods enable the algorithm to dynamically adjust the threshold 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 QoS requirements of the existing requests in the system. Most admission control algorithms treat every request uniformly and hence optimize the system performance by maximizing the number of admitted and served requests. In practice, requests might have different levels of importance to the system. Requests offering high contribution or reward to the system performance deserve priority treatment. Failure of accepting a high-priority request would incur high penalty to the system. A novel threshold-based admission control algorithm with negotiation for two priority classes of requests is proposed in our previous study. The server capacity is divided into three partitions based on the threshold 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. In this paper, given the characteristics of the system workload, the proposed analytical models aim to finds the best partitions, optimizing the system performance based on the objective function of the total reward minus the total penalty. The negotiation mechanism reduces 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. Stochastic Petri-Net model is used to find the optimal threshold values and two analytical methods are developed to find sub-optimal settings. The experiment results show that the sub-optimal solutions found by the proposed analytical methods are very close to optimal ones. The methods enable the algorithm to dynamically adjust the threshold values, based on the characteristics of the system workload, to achieve higher system performance.

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

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

U2 - 10.1016/S0166-5316(02)00128-1

DO - 10.1016/S0166-5316(02)00128-1

M3 - Article

AN - SCOPUS:0037350733

VL - 52

SP - 1

EP - 13

JO - Performance Evaluation

JF - Performance Evaluation

SN - 0166-5316

IS - 1

ER -