11,479 research outputs found
A survey of QoS-aware web service composition techniques
Web service composition can be briefly described as the process of aggregating services with disparate functionalities into a new composite service in order to meet increasingly complex needs of users. Service composition process has been accurate on dealing with services having disparate functionalities, however, over the years the number of web services in particular that exhibit similar functionalities and varying Quality of Service (QoS) has significantly increased. As such, the problem becomes how to select appropriate web services such that the QoS of the resulting composite service is maximized or, in some cases, minimized. This constitutes an NP-hard problem as it is complicated and difficult to solve. In this paper, a discussion of concepts of web service composition and a holistic review of current service composition techniques proposed in literature is presented. Our review spans several publications in the field that can serve as a road map for future research
PACMAS: A Personalized, Adaptive, and Cooperative MultiAgent System Architecture
In this paper, a generic architecture, designed to
support the implementation of applications aimed at managing
information among different and heterogeneous sources,
is presented. Information is filtered and organized according
to personal interests explicitly stated by the user. User pro-
files are improved and refined throughout time by suitable
adaptation techniques. The overall architecture has been called
PACMAS, being a support for implementing Personalized, Adaptive,
and Cooperative MultiAgent Systems. PACMAS agents are
autonomous and flexible, and can be made personal, adaptive and
cooperative, depending on the given application. The peculiarities
of the architecture are highlighted by illustrating three relevant
case studies focused on giving a support to undergraduate and
graduate students, on predicting protein secondary structure, and
on classifying newspaper articles, respectively
Novel optimization schemes for service composition in the cloud using learning automata-based matrix factorization
A thesis submitted to the University of Bedfordshire, in partial fulfilment of the requirements for the degree of Doctor of PhilosophyService Oriented Computing (SOC) provides a framework for the realization of loosely couple service oriented applications (SOA). Web services are central to the concept of SOC. They possess several benefits which are useful to SOA e.g. encapsulation, loose coupling and reusability. Using web services, an application can embed its functionalities within the business process of other applications. This is made possible through web service composition. Web services are composed to provide more complex functions for a service consumer in the form of a value added composite service.
Currently, research into how web services can be composed to yield QoS (Quality of Service) optimal composite service has gathered significant attention. However, the number and services has risen thereby increasing the number of possible service combinations and also amplifying the impact of network on composite service performance. QoS-based service composition in the cloud addresses two important sub-problems; Prediction of network performance between web service nodes in the cloud, and QoS-based web service composition. We model the former problem as a prediction problem while the later problem is modelled as an NP-Hard optimization problem due to its complex, constrained and multi-objective nature.
This thesis contributed to the prediction problem by presenting a novel learning automata-based non-negative matrix factorization algorithm (LANMF) for estimating end-to-end network latency of a composition in the cloud. LANMF encodes each web service node as an automaton which allows v it to estimate its network coordinate in such a way that prediction error is minimized. Experiments indicate that LANMF is more accurate than current approaches.
The thesis also contributed to the QoS-based service composition problem by proposing four evolutionary algorithms; a network-aware genetic algorithm (INSGA), a K-mean based genetic algorithm (KNSGA), a multi-population particle swarm optimization algorithm (NMPSO), and a non-dominated sort fruit fly algorithm (NFOA). The algorithms adopt different evolutionary strategies coupled with LANMF method to search for low latency and QoSoptimal solutions. They also employ a unique constraint handling method used to penalize solutions that violate user specified QoS constraints.
Experiments demonstrate the efficiency and scalability of the algorithms in a large scale environment. Also the algorithms outperform other evolutionary algorithms in terms of optimality and calability. In addition, the thesis contributed to QoS-based web service composition in a dynamic environment. This is motivated by the ineffectiveness of the four proposed algorithms in a dynamically hanging QoS environment such as a real world scenario. Hence, we propose a new cellular automata-based genetic algorithm (CellGA) to address the issue. Experimental results show the effectiveness of CellGA in solving QoS-based service composition in dynamic QoS environment
Simulation as a method for asymptotic system behavior identification (e.g. water frog hemiclonal population systems)
Studying any system requires development of ways to describe the variety of its conditions. Such development includes three steps. The first one is to identify groups of similar systems (associative typology). The second one is to identify groups of objects which are similar in characteristics important for
their description (analytic typology). The third one is to arrange systems into groups based on their predicted common future (dynamic typology).
We propose a method to build such a dynamic topology for a system. The first step is to build a simulation model of studied systems. The model must be undetermined and simulate stochastic processes. The model generates distribution of the studied systems output parameters with the same initial parameters.
We prove the correctness of the model by aligning the parameters sets generated by the model with the set of the original systems conditions evaluated empirically. In case of a close match between the two, we can presume that the model
is adequately describing the dynamics of the studied systems. On the next stage, we should determine the probability distribution of the systems transformation outcome. Such outcomes should be defined based on the simulation of the
transformation of the systems during the time sufficient to determine its fate. If the systems demonstrate asymptotic behavior, its phase space can be divided into pools corresponding to its different future state prediction. A dynamic typology is determined by which of these pools each system falls into.
We implemented the pipeline described above to study water frog hemiclonal population systems. Water frogs (Pelophylax esculentus complex) is an animal group displaying interspecific hybridization and non-mendelian inheritance
Artificial table testing dynamically adaptive systems
Dynamically Adaptive Systems (DAS) are systems that modify their behavior and
structure in response to changes in their surrounding environment. Critical
mission systems increasingly incorporate adaptation and response to the
environment; examples include disaster relief and space exploration systems.
These systems can be decomposed in two parts: the adaptation policy that
specifies how the system must react according to the environmental changes and
the set of possible variants to reconfigure the system. A major challenge for
testing these systems is the combinatorial explosions of variants and
envi-ronment conditions to which the system must react. In this paper we focus
on testing the adaption policy and propose a strategy for the selection of
envi-ronmental variations that can reveal faults in the policy. Artificial
Shaking Table Testing (ASTT) is a strategy inspired by shaking table testing
(STT), a technique widely used in civil engineering to evaluate building's
structural re-sistance to seismic events. ASTT makes use of artificial
earthquakes that simu-late violent changes in the environmental conditions and
stresses the system adaptation capability. We model the generation of
artificial earthquakes as a search problem in which the goal is to optimize
different types of envi-ronmental variations
- …