高级检索

    网格资源部署动态策略的一种拟生算法

    A Biology Imitation Algorithm of Resource Deployment Strategy in Grid

    • 摘要: 通过将资源动态部署问题转化成收益目标函数的优化问题 ,并在网格架构基础上 ,通过模拟生物跟随食物变化的动态分布过程 ,引入服务节点的动态迁移、竞争和死亡等行为 ,设计了拟生动态部署优化策略解决该优化问题 在针对单一资源访问以延时为主要服务质量评价标准的测试过程中拟生部署策略的目标函数值相比传统方法均有提高 ,算法时间复杂度接近O(N2 ) ,各个计算节点时间复杂度接近O(N) ,算法的实际叠代次数约为 2~ 3次

       

      Abstract: The resource placement problem is often formulated as a classical optimization problem: place N proxies within the Internet so as to minimize the average user response time for retrieving Web objects.Approaches to this problem in the literature include graph theoretic approaches, combinatorial approaches, dynamic programming approaches, and vector quantization approaches.In this paper service level agreement is induced to compose resource consumption and user’s quality requirement to one benefit function, and change the dynamic deployment problem to an optimize problem of benefit object function’s value.To solve the optimized problem, an biology imitation algorithm is presented by constructing mapping from biology action follow with the food to the problem.By imitating the biology action including competition, moving and dying, the algorithm realizes the dynamic resource deployment strategy in grid environment.

       

    /

    返回文章
    返回