Frequency : 12 issues per year
Subject : Computer Applications and Technology
ISSN : 2319–8656 (Online)
IJCATR Volume 1 Issue 1
An Efficient Gravitational Search Algorithm Based Optimal Web SERVICE Selection for Composition in SOA
D.Palanikkumar, P.Anbuselvan, and M.Kathiravan
10.7753/2012.1005
keywords : PSO, GSA, Service Selection.
The Web services model has emerged as a standard for representation, discovery, and invocation of services in a distributed environment. During service composition, Selection of appropriate services for composition is the chief task. A series of tasks are tied together to form a composite web service. Such composition is a challenging task because a number of Web services with the same or similar functions are increasing rapidly. QoS plays a vital role in the problem of selecting the most appropriate web service for composition. It is a measure for how well the composite web service serves the requester. Particle Swarm Optimization (PSO) algorithm and Gravitational Search Algorithm can be used to resolve this problem of optimal service selection. To compose individual web services dynamically according to users’ requirements in functional aspects as well as in non-functional preferences. In order to meet the QoS requirements of consumers, this paper presents the QoS calculation of non-functional requirements such as cost, availability, reliability and execution time. To verify the effectiveness in latency of Web Services selection the above two algorithms are compared. Results indicate the Gravitational Search Algorithm improves the latency over the Particle Swarm Optimization algorithm.
@artical{d112012ijcatr01011005,
Title = "An Efficient Gravitational Search Algorithm Based Optimal Web SERVICE Selection for Composition in SOA",
Journal ="International Journal of Computer Applications Technology and Research(IJCATR)",
Volume = "1",
Issue ="1",
Pages ="20 - 24",
Year = "2012",
Authors ="D.Palanikkumar, P.Anbuselvan, and M.Kathiravan"}
null