欢迎您！东篱公司
退出
-
申报数据库
-
立项数据库
-
成果数据库
-
项目获奖数据库
中文摘要：
网格服务质量（QoS）保证是网格环境中最关键的研究内容之一，以往的网格QoS保证机制大多关注于性能QoS的保证，而对于安全QoS鲜有涉及．针对这一不足，提出了用网格安全保护质量（grid quality ofprotection，GQoP）的概念来定义网格安全QoS，并给出了相应的测量技术．将GQoP看作为网格QoS（GQoS）的一个子类，通过融合模型和协商算法来消除两者之间的资源竞争矛盾，并据此提出了一种具有GQoP保证的网格QoS自适应调度算法．该算法不需要中央节点的控制，而由各资源提供者按照一定的概率分布来调节GQoP和GQoS等级，不仅能够保证用户的GQoP和GQoS需求，而且能够通过构造的马尔可夫链，渐进地逼近系统效用的全局最优解．
英文摘要：
Grid computing aims to discover, allocate and coordinate all kinds of service capabilities, which are interconnected by Internet. In service oriented grid, how to guarantee user QoS （quality of service） requirements becomes increasingly urgent, which is one of the most important study areas in grid computing. In the past, most guarantee mechanisms proposed in the literature concerned more about the guarantee of performance QoS than that of security QoS. This is a relative lack of research on this area. In this paper, we use the concept of GQoP （grid quality of protection）to describe security QoS, and a measurement technology is given to quantize it. We start with definition of quality, description, measurement and mapping of GQoP, which is considered as a subclass of GQoS in this research. And a fusion model about GQoP and GQoS is proposed to resolve the resources conflict between them. Moreover, A GQoP guaranteed QoS adaptive scheduling algorithm is developed and it is adopted into grid system to guarantee user QoS and GQoP. This algorithm regulates QoS grade by each resource provider according to a probability distribution. It can guarantee the users＇QoS grade very well, and can also achieve global utility optimum gradually through a constructed Markov chain.
同期刊论文项目
同项目期刊论文
A novel task scheduling algorithm based on dynamic critical path and effective duplication for perva
NETOP: a Non-cooperative game based Topology OPtimization model towards improving search performance
期刊信息
位置：