An New Ant-Based Approach for Optimal Service Selection with E2E QoS Constraints


In this paper, we study the dynamic service composition becomes a decision problem on which component services should be selected under the E2E QoS constraints. This problem is modeled is a nonlinear optimization problem under several constraints. We have two approaches: local selection is an event strategy with polynomial time complexity but cannot handle global constraints and the traditional global selection approach based on integer linear programming can handle global constraints, but its poor performance renders it inappropriate for practical applications with dynamic requirements. To overcome this disadvantage, we proposed a novel Min-Max Ant System algorithm with the utilites heuristic information to search the global approximate optimal. The experiment results show that our algorithm is efficiency and feasibility more than the recently proposed related algorithms.


5 Figures and Tables

Download Full PDF Version (Non-Commercial Use)