Open Access Open Access  Restricted Access Subscription Access

A New Ant Algorithm for Optimal Service Selection with End-to-End QoS Constraints

Dac-Nhuong Le,


In this paper, we study the dynamic service composition becomes a decision problem on which component services should be selected under the E2E-to-End Quality of Service constraints. This problem is modeled is a nonlinear optimization problem under several constraints. We have two approaches to solve this problem. The first approach is local selection which is an efficient strategy with polynomial time complexity but can not handle global constraints. The second approach is 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, in this study we proposed a novel Min-Max Ant System algorithm with the new utilities heuristic information to search the global approximate optimal. Our goal focus on its efficiency in terms of execution time and the quality in terms of the obtained best solution fitness value. The experiment results show that our algorithm is efficiency and feasibility more than the recently proposed related algorithms.


Service selection; E2E QoS constraints; QoS-aware; Min-max ant system

Citation Format:
Dac-Nhuong Le, "A New Ant Algorithm for Optimal Service Selection with End-to-End QoS Constraints," Journal of Internet Technology, vol. 18, no. 5 , pp. 1017-1030, Sep. 2017.

Full Text:



  • There are currently no refbacks.

Published by Executive Committee, Taiwan Academic Network, Ministry of Education, Taipei, Taiwan, R.O.C
JIT Editorial Office, Library and Information Center, National Dong Hwa University
No. 1, Sec. 2, Da Hsueh Rd. Shoufeng, Hualien 97401, Taiwan, R.O.C.
Tel: +886-3-931-7017  E-mail: