摘要
服务质量优化问题是多维服务质量参数映射有限的资源问题 ,这个优化问题是一个 NP- hard问题 .我们采用通过改进流行遗传算法来解决这一棘手问题 ,于是提出了基于权的自适应遗传算法 (weighted based adaptive geneticalgorithm) ,通过实验说明这一算法优于目前为止最好的启发式算法 [4]和普通的遗传算法 ,算法运算时间短 ,鲁棒性强 .
The problem of QoS optimization by allocation a single finite resource to satisfy Quality of Service requirements of multiple applications along multiple QoS dimensions was studied in 〔4〕 . In this paper, we consider the more complex problem of apportioning multiple finite resources to satisfy the QoS needs of applications along multiple QoS dimensions. This is provably NP hard problem. We adapt genetic algorithm and programming to yield the near optimal results with small running times.
出处
《小型微型计算机系统》
CSCD
北大核心
2001年第6期716-718,共3页
Journal of Chinese Computer Systems
基金
电子科学研究院预研项目资助
关键词
服务质量
优化
自适应遗传算法
分布式多媒体
伸缩性
QoS optimization
QoS tradeoff
Resource tradeoff
QoS based resource allocation
Scalability
Genetic algorithm
Weighted based adaptive genetic algorithm
