摘要
如何提供严格有保障的数据服务质量,为每个数据访问请求提供满足必然性QoS约束的数据服务,是数据网格成功的关键.在副本放置模型的基础上,给出了QoS约束形式化的描述方法.并得出必然性QoS约束满足的形式化定义.针对必然性QoS约束的副本放置问题.在矩阵表示的基础上,利用矩阵操作给出一种有效的副本放置算法.分析和实验表明,该算法能够很好地解决各种规模条件下必然性QoS约束的副本放置问题,并具有稳定性和可扩展性的特点,在多种网络拓扑和访问模式下均能获得满足必然性QoS约束的副本策略.
It is critical for data grid to provide strictly QoS guarantee. Certain-QoS-Restriction replication service guaranteed strict QoS satisfaction for every individual user, which is very important in some grid applications. A graph-based replica placement model was built, and a formula description method was presented. With the help of self-designed matrix operations, a novel algorithm was proposed. Analysis and experiments show that the algorithm is feasible in arbitrary problem scales and can obtain approximateoptimal replica policy under different simulating conditions.
出处
《系统工程理论与实践》
EI
CSSCI
CSCD
北大核心
2012年第12期2796-2801,共6页
Systems Engineering-Theory & Practice
基金
国家自然科学基金(61100042)
海军工程大学自然科学基金(HGDQNJJ023)
关键词
数据网格
必然性QoS
副本放置
data grid
certain QoS restriction
replica placement
