...
首页> 外文期刊>Performance Evaluation >Performance evaluation of an admission control algorithm: dynamic threshold with negotiation
【24h】

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

机译:准入控制算法的性能评估:带有协商的动态阈值

获取原文
获取原文并翻译 | 示例
   

获取外文期刊封面封底 >>

       

摘要

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.
机译:多媒体服务器的准入控制算法负责确定是否可以接受新请求而不会违反系统中现有请求的QoS要求。大多数准入控制算法会统一处理每个请求,从而通过最大化已允许和已服务请求的数量来优化系统性能。实际上,请求对系统的重要性可能不同。对系统性能提供高贡献或高回报的请求应优先处理。未能接受高优先级请求将对系统造成高额罚款。我们先前的研究中提出了一种新颖的基于阈值的准入控制算法,该算法针对两个优先级的请求进行协商。服务器容量根据阈值分为三个分区:一个分区用于每个请求类别,一个公用池由两个请求类别共享。提议的系统模型采用了奖励和惩罚。与低优先级请求相比,高优先级请求与较高的奖励和惩罚值相关联。在本文中,鉴于系统工作负载的特征,所提出的分析模型旨在找到最佳分区,并基于总奖励减去总惩罚的目标函数来优化系统性能。协商机制通过减少分配的服务器容量的一小部分,以接受新的高优先级客户端并获得更高的净收益价值,从而降低了几个低优先级客户端的QoS要求。随机Petri-Net模型用于查找最佳阈值,并开发了两种分析方法以查找次优设置。实验结果表明,所提出的分析方法发现的次优解与最优解非常接近。该方法使算法能够根据系统工作负载的特性动态调整阈值,以实现更高的系统性能。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号