Relaxation Based SaaS for Repairing Failed Queries over the Cloud Computing

Cloud Computing based Software as a Service (SaaS) combines multiple Web Services to satisfy a SaaS request, therefore SaaS should be able to dynamically seek replacements for faulty or underperforming services, thus performing self-healing. However, it may be the case of available services that do not match all user's request, leading the system to grind to a halt. It is better to have an alternative candidate in the cloud while not fullfilling all the constraints. In this paper, we provide a Relaxation SaaS solution to repair the failed user's query by rewriting it with an approximation. It is based on an incremental approach that exploits Quantified Satisfiability (QSAT) problem to repair the query and provide an alternative SaaS that leads to a successful request closed to the original one with maximized Quality of Service (QoS).

[1]  Nicolas Sabouret,et al.  Web services composition handling user constraints: towards a semantic approach , 2010, iiWAS.

[2]  Salima Benbernou,et al.  A Soft Constraint-Based Approach to QoS-Aware Service Selection , 2010, ICSOC.

[3]  Dongwon Lee,et al.  Type-Aware Web Service Composition Using Boolean Satisfiability Solver , 2008, 2008 10th IEEE Conference on E-Commerce Technology and the Fifth IEEE Conference on Enterprise Computing, E-Commerce and E-Services.

[4]  Robert E. Tarjan,et al.  A Linear-Time Algorithm for Testing the Truth of Certain Quantified Boolean Formulas , 1979, Inf. Process. Lett..

[5]  Ching-Seh Wu,et al.  Tree-based Search Algorithm for Web Service Composition in SaaS , 2012, 2012 Ninth International Conference on Information Technology - New Generations.

[6]  Yuhong Yan,et al.  An Efficient Syntactic Web Service Composition Algorithm Based on the Planning Graph Model , 2008, 2008 IEEE International Conference on Web Services.

[7]  Shanping Li,et al.  Constraint satisfaction in dynamic Web service composition , 2005, 16th International Workshop on Database and Expert Systems Applications (DEXA'05).

[8]  M. Brian Blake,et al.  Generalized Semantics-Based Service Composition , 2008, 2008 IEEE International Conference on Web Services.

[9]  Thierry Vidal,et al.  A distributed multi-agent planning approach for automated web services composition , 2012, Web Intell. Agent Syst..

[10]  Soundar R. T. Kumara,et al.  Web Service Planner (WSPR): An Effective and Scalable Web Service Composition Algorithm , 2007, Int. J. Web Serv. Res..

[11]  Manuel Mucientes,et al.  Automatic Web Service Composition with a Heuristic-Based Search Algorithm , 2011, 2011 IEEE International Conference on Web Services.

[12]  Lakhdar Sais,et al.  A Pigeon-Hole Based Encoding of Cardinality Constraints , 2013, ISAIM.

[13]  Sharad Malik,et al.  Conflict driven learning in a quantified Boolean satisfiability solver , 2002, IEEE/ACM International Conference on Computer Aided Design, 2002. ICCAD 2002..

[14]  Danilo Ardagna,et al.  Quality-of-service in cloud computing: modeling techniques and their applications , 2014, Journal of Internet Services and Applications.

[15]  Dhara Virani,et al.  Service Composition Based on Multi Agent in Cloud Environment , 2012 .

[16]  Mazen Malek Shiaa,et al.  An Incremental Graph-based Approach to Automatic Service Composition , 2008, 2008 IEEE International Conference on Services Computing.

[17]  Armando Tacchella,et al.  Clause/Term Resolution and Learning in the Evaluation of Quantified Boolean Formulas , 2006, J. Artif. Intell. Res..