CFP last date
20 May 2024
Call for Paper
June Edition
IJCA solicits high quality original research papers for the upcoming June edition of the journal. The last date of research paper submission is 20 May 2024

Submit your paper
Know more
The week's pick
Responsive image
Enhancing Privacy Preservation: Multi-Attribute Protection with P-Sensitive K-Anonymity

Twinkle Patel Kiran Amin
Random Articles
Reseach Article

Optimal QoS based Web Service Choreography using Ant Colony Optimization

by Alexander T, E. Kirubakaran
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 102 - Number 11
Year of Publication: 2014
Authors: Alexander T, E. Kirubakaran
10.5120/17862-8776

Alexander T, E. Kirubakaran . Optimal QoS based Web Service Choreography using Ant Colony Optimization. International Journal of Computer Applications. 102, 11 ( September 2014), 39-46. DOI=10.5120/17862-8776

@article{ 10.5120/17862-8776,
author = { Alexander T, E. Kirubakaran },
title = { Optimal QoS based Web Service Choreography using Ant Colony Optimization },
journal = { International Journal of Computer Applications },
issue_date = { September 2014 },
volume = { 102 },
number = { 11 },
month = { September },
year = { 2014 },
issn = { 0975-8887 },
pages = { 39-46 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume102/number11/17862-8776/ },
doi = { 10.5120/17862-8776 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T22:32:52.872013+05:30
%A Alexander T
%A E. Kirubakaran
%T Optimal QoS based Web Service Choreography using Ant Colony Optimization
%J International Journal of Computer Applications
%@ 0975-8887
%V 102
%N 11
%P 39-46
%D 2014
%I Foundation of Computer Science (FCS), NY, USA
Abstract

Web services have become an integral part of any web based application, due to their availability and ease of use. As the number of web services start increasing uncertainty arises as to which service should be selected. Even though this can be solved by ensuring the appropriate quality of service parameters, performing these checks on numerous services would prove to be a tedious task and time consuming. Hence this paper proposes an efficient QoS based service choreography, that selects the web services on the basis of the quality parameters and cost. A modified Ant Colony Optimization is used for this purpose. The modification is brought about by modifying the evaporation rate of each of the links depending on certain parameters. An effective result that satisfies the QoS constraints is obtained within the stipulated time.

References
  1. Alexander T, Kirubakaran E. 2013. Neural network and GA based intelligent b2b negotiation system. International Journal of Computer Applications. Volume 68 - Number 17. Doi: 10. 5120/11668-7264.
  2. Saaty T. L. 1980. The analytic hierarchy process: planning, priority setting, resources allocation. Publisher: McGraw-Hill.
  3. Saaty T. L. 2005. Theory and applications of the analytic network process: decision making with bene_ts, opportunities, costs, and risks. RWS publications.
  4. Talreja S. 2013. A Heuristic Proposal in the Dimension of Ant Colony Optimization. Department of Applied Mathematics. Applied Mathematical Sciences, Vol. 7, 2013, no. 41, 2017 - 2026.
  5. Web Services Glossary. W3C. February 11, 2004. Retrieved 2011-04-22.
  6. Dorigo M, Maniezzo V, Colorni A. 1996. Ant system: optimization by a colony of cooperating agents. Systems, Man, and Cybernetics, Part B: Cybernetics, IEEE Transactions on 26. 1: 29-41.
  7. Sorin C. Negulescu, Constantin Oprean,Claudiu V. Kifor, Ilie Carabulea. 2008. Elitist ant system for route allocation problem. World Scientific and Engineering Academy and Society (WSEAS) Stevens Point, Wisconsin, USA.
  8. T. Stützle et H. H. Hoos. 2000. Max Min Ant System. Future Generation Computer Systems, volume 16, pages 889-914.
  9. Bernd Bullnheimer Richard F. Hartl, Christine Strau. 1997. A New Rank Based Version of the Ant System - A Computational Study. Working Paper No. 1.
  10. Xiao-Min Hu, Jun Zhang, Yun Li. 2008. Orthogonal Methods Based Ant Colony Search for Solving Continuous Optimization Problems. Journal of Computer Science and Technology. Volume 23, Issue 1, pp 2-18.
  11. Gupta. D. K, Arora, Singh. U. K, Gupta. J. P. 2012. Recursive Ant Colony Optimization for estimation of parameters of a function. Recent Advances in Information Technology (RAIT), International Conference, March 2012, DOI: 10. 1109/RAIT. 2012. 6194620, pages 448 – 454.
  12. Kumar, Neeraj, et al. 2011. An ant based multi constraints QoS aware service selection algorithm in wireless mesh networks. Simulation modelling practice and theory 19. 9: 1933-1945.
  13. Gutjahr, Walter J. 2004. S-ACO: An ant-based approach to combinatorial optimization under uncertainty. Ant colony optimization and swarm intelligence. Springer Berlin Heidelberg. 238-249.
  14. Rivero, Jessica, et al. 2012. Using the ACO algorithm for path searches in social networks. Applied Intelligence 36. 4: 899-917.
  15. Thiruvady, Dhananjay, et al. 2013. Constraint-based ACO for a shared resource constrained scheduling problem. International Journal of Production Economics 141. 1: 230-242.
  16. Wu, Quanwang, Qingsheng Zhu. 2013. Transactional and QoS-aware dynamic service composition based on ant colony optimization. Future Generation Computer Systems 29. 5: 1112-1119.
  17. Rajeswari M. et al. 2014. Appraisal and analysis on various web service composition approaches based on QoS factors. Journal of King Saud University-Computer and Information Sciences 26. 1: 143-152.
Index Terms

Computer Science
Information Sciences

Keywords

Web Service Choreography QoS based service selection ACO

Powered by PhDFocusTM