Heuristic Based Time-Aware Service Selection Approach
Authors:
- Ikbel GuidaraIGIkbel Guidara
- Nawal GuermoucheNGNawal Guermouche
- Tarak ChaariTCTarak Chaari
- Said TaziSTSaid Tazi
- Mohamed JmaielMJMohamed Jmaiel
- 1 June 2015
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 65-72
Abstract
QoS-based service selection is one of the important requirements in Service Oriented Computing (SOC). A challenging task towards this purpose is the selection of the best combination of services that fulfils user's requirements while meeting quality of service (QoS) constraints. This challenge becomes more complex when dealing with time-dependent QoS values and temporal properties. Indeed, during the selection, mutual dependencies between the different temporal constraints may arise so that the selection of each service may influence or be influenced by the selection of other services. On other side, to find the best solution, all potential combinations must be compared. However, the number of these combinations may be very high, which can present a barrier for enabling effective service selection. In this paper, we present a heuristic based time-aware service selection approach to efficiently select a close-to-optimal combination of services. First, pruning techniques are adopted to reduce the search space. Second, a novel heuristic approach is proposed based on service clustering, constraints decomposition and local selection while considering both QoS and temporal constraints. Finally, experiments which confirm the feasibility and effectiveness of the proposed approach in terms of its timeliness and optimality, are conducted.Keywords
This publication has 14 references indexed in Scilit:
- Time-Dependent QoS Aware Best Service Combination SelectionInternational Journal of Web Services Research, 2015
- Pruning Based Service Selection Approach Under QoS and Temporal Constraints2014
- QoS decomposition for service composition using genetic algorithmApplied Soft Computing, 2013
- A decomposition-based approach for service composition with global QoS guaranteesInformation Sciences, 2012
- Multi-objective Service Composition with Time- and Input-Dependent QoS2012
- Service Composition with Pareto-Optimality of Time-Dependent QoS Attributes2010
- Combining global optimization with local selection for efficient QoS-aware service composition2009
- Adaptive Service Composition in Flexible ProcessesIEEE Transactions on Software Engineering, 2007
- QoS-aware middleware for Web services compositionIEEE Transactions on Software Engineering, 2004
- Least squares quantization in PCMIEEE Transactions on Information Theory, 1982