Heuristic Based Time-Aware Service Selection Approach
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 timeaware
service selection approach to efficiently select a close-tooptimal
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.
Domains
Computer Science [cs]
Origin : Files produced by the author(s)
Loading...