Service Composition to Enhance the QOS of Web Services
Keywords:
Web Services, QoS, Optimization, Service Composition.Abstract
QoS-based service selection becomes a usually accepted procedure to support fast and dynamic net service composition.An adaptational technique is employed for choosing services supported the hardness of QoS constraints. The fundamental plan is to sample services that represent a selected quality-value vary. The quality-value vary of candidate services is split into smaller sub-ranges within which representative services ar sampled and evaluated. At now, the dimensions of the QoS sub-ranges is decided adaptably supported the hardness of the QoS constraints. In this, we'll notice the edge worth to keep up an affordable level of optimality so as to extend the success rate of service composition. during this we address this downside and propose an answer that mixes global optimisation with local selection techniques to learn from the benefits of each globals. The projected resolution consists of 2 steps: Initially, we use Mixed number Programming(MIP) to search out the best decomposition of global QoS constraints into local constraints. Second, we use distributed local selection to search out the most effective net services that satisfy these local constraints.
References
- M. M. Akbar, E. G. Manning, G. C. Shoja, and S. Khan. Heuristic solutions for the multiple-selection multi-dimension knapsack problem. In Proceedings of the Global Conference on Computational Science-Part II, pages 659-668, London, UK, 2001. Springer-Verlag.
- E. Al-Masri and Q. H. Mahmoud. The qws dataset. Web page. http: //www.uoguelph.ca/~qmahmoud/qws/indexhtml/.
- E. Al-Masri and Q. H. Mahmoud. Qos-based discovery and ranking of web services. In Proceedings of the IEEE Global Conference on Computer Communications and Networks, 2007.
- B.Lalitha Optimizing Service Selection in Combinatorial Option by Resolving Non-linear constraints.
- D. Ardagna and B. Pernici. Global and local qos, constraints guarantee in web service selection. In Proceedings of the IEEE Global Conference on Web Services, pages 805-806, Washington, DC, USA, 2005. IEEE Computer Society.
- D. Ardagna and B. Pernici. Adaptive service composition in flexible processes. IEEE Transactions on Software Engineering, 33(6):369-384, 2007.
- C. Aurrecoechea, A. T. Campbell, and L. Hauw. A survey of qos architectures. Multimedia Systems, 6(3):138-151, 1998.
- B. Benatallah, Q. Z. Sheng, A. H. H. Ngu, and M. Dumas. Declarative composition and peer-to-peer provisioning of dynamic web services. In Proceedings of the Global Conference on Data Engineering, pages 297-308, Washington, DC, USA, 2002. IEEE Computer Society.
- A. S. Bilgin and M. P. Singh. A daml-based repository for qos-aware semantic web service selection. In Proceedings of the IEEE Global Conference on Web Services, pages 368-375, Washington, DC, USA, 2004. IEEE Computer Society.
- J. Cardoso, J. Miller, A. Sheth, and J. Arnold. Quality of service for workflows and web service processes. Journal of Web Semantics, 1:281-308, 2004.
- F. Casati and M.-C. Shan. Dynamic and adaptive composition of e-services. Information Systems, 26(3):143-163, 2001.
- Y. Cui and K. Nahrstedt. Supporting qos for ubiquitous multimedia service delivery. In Proceedings of the ACM Global Conference on Multimedia, pages 461-462, 2001.
- M. Gillmann, G. Weikum, and W. Wonner. Workflow management with service quality guarantees. In Proceedings of the SIGMOD Conference, pages 228-239, 2002.
- F. Li, F. Yang, K. Shuang, and S. Su. Q-peer: A decentralized qos registry architecture for web services. In Proceedings of the Global Conference on Services Computing, pages 145-156, 2007.
- Y. Liu, A. H. H. Ngu, and L. Zeng. Qos computation and policing in dynamic web service selection. In Proceedings of the Global Global Wide Web Conference, pages 66-73, 2004.
- I. Maros. Computational Techniques of the Simplex Method. Springer, 2003.
- K. E. Michel Berkelaar and P. Notebaert. Open source (mixed-integer) linear programming system. Sourceforge. http://lpsolve.sourceforge.net/.
- G. L. Nemhauser and L. A. Wolsey. Integer and Combinatorial Optimization. Wiley-Interscience, New York, NY, USA, 1988.
- OASIS. Web services business process execution language, April 2007. http://docs.oasis-open.org/wsbpel/2.0/wsbpel-v2.0.pdf.
- D. Pisinger. Algorithms for Knapsack Problems. PhD thesis, University of Copenhagen, Dept. of Computer Science, February 1995.
- M. Wagner and W. Kellerer. Web services selection for distributed composition of multimedia content. In Proceedings of the ACM Global Conference on Multimedia, pages 104-107, New York, NY, USA, 2004. ACM.
- K. . P. Yoon and C.-L. Hwang. Multiple Attribute Decision Making: An Introduction (Quantitative Applications in the Social Sciences). Sage Publications, 1995.
- T. Yu, Y. Zhang, and K.-J. Lin. Efficient algorithms for web services selection with end-to-end qos constraints. ACM Transactions on the Web, 1(1), 2007.
- L. Zeng, B. Benatallah, M. Dumas, J. Kalagnanam, and Q. Z. Sheng. Quality driven web services composition. In Proceedings of the Global Global Wide Web Conference, pages 411-421, 2003.
- L. Zeng, B. Benatallah, A. H. H. Ngu, M. Dumas, J. Kalagnanam, and H. Chang. Qos-aware middleware for web services composition. IEEE Transactions on Software Engineering, 30(5):311-327, 2004.
Downloads
Published
Issue
Section
License
Copyright (c) IJSRCSEIT
This work is licensed under a Creative Commons Attribution 4.0 International License.