Please use this identifier to cite or link to this item: http://hdl.handle.net/123456789/6564
Title: EFFICIENT ALGORITHMS FOR WEB SERVICE COMPOSITION
Authors: Singuru, Varahanarasimhulu
Keywords: ELECTRONICS AND COMPUTER ENGINEERING
WEB SERVICE COMPOSITION
DISTRIBUTED COMPUTING
QOS CONSTRAINTS
Issue Date: 2011
Abstract: With the popularity of Internet technology, web services are becoming the most promising paradigm for distributed computing. However, when a single web service fails to meet service requestor's multiple function needs, web services need to be dynamically configured together to form a web service composition. This thesis proposes a special data structure for storing web services. Normally web services are stored in inverted data tables in UDDI registry. In the thesis web services are stored in web services chain data structure which describes the dependent relations among - web services, is proposed, and an efficient algorithm for WS composition is developed based on the data structure. Experiments are carried out in order to compare the performance of the algorithms with different data structure. This thesis proposes Bi-Directional Dijkstra's algorithm for web service selection, which is based on the sorted function graph. With the graph model, it converts the problem to a multi-constraint optimal path problem in the graph theory. The optimal composite services can be constructed with meeting the QOS constraints. Experiments are carried out in compare the performance of runtime with dijkstra algorithm
URI: http://hdl.handle.net/123456789/6564
Other Identifiers: M.Tech
Appears in Collections:MASTERS' DISSERTATIONS (E & C)

Files in This Item:
File Description SizeFormat 
ECED G20946.pdf2.05 MBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.