Towards mashup optimisation with global constraints in the cloud Online publication date: Sat, 09-May-2015
by Wanchun Yang; Chenxi Zhang; Bin Mu
International Journal of Grid and Utility Computing (IJGUC), Vol. 5, No. 4, 2014
Abstract: With the growing number of services being deployed in cloud environment, it becomes difficult to facilitate mashup quickly. In this paper, we introduce a comprehensive evaluation model of mashup which considers three aspects, including functional similarity, QoS characteristics and transactional properties, and use them together as optimisation criteria. To enlarge the scope of feasible solutions, we adopt Analytic Hierarchy Process (AHP) to analyse the global constraints and consider relevant services with different granularity. An efficient mashup optimisation algorithm based on skyline and hybrid particle swarm optimisation is proposed to seek a near-to-optimal solution. To overcome the premature convergence of traditional particle swarm optimisation, a series of effective strategies are presented, which include global mutation operation and adaptive inertia weight parameter. The experimental results show that our proposed approach is feasible and effective.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Grid and Utility Computing (IJGUC):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook