Solutions to a complete web service discovery and composition

Mohammad A. Makhzan*, Kwei Jay Lin

*此作品的通信作者

研究成果: 圖書/報告稿件的類型會議稿件同行評審

2 引文 斯高帕斯(Scopus)

摘要

With the increasing number of web services and growingr demand for web service oriented computing, it is necessary to develop fast algorithms that could take a service requirement, and through compositional search of UDDI registered web services, find a cost effective (in terms of length of service response, total cost of composed services, minimal length of services, amount of space used for composition discovery) result. This paper describes two approaches for syntactic search, one for discovery of web services, without chaining, and the second one for the compositional chaining of web services with a front-to-end DAG based search approach. The assumption is that a user provides a XMLfile stating his required output and set of inputs, and the algorithm is supposed to identify one or a chain of services that does the job.

原文英語
主出版物標題Proceedings - CEC/EEE 2006
主出版物子標題Joint Conference - 8th IEEE International Conference on E-Commerce and Technology (CEC 2006), 3rd IEEE International Conference on Enterprise Computing, E-Commerce
DOIs
出版狀態已出版 - 2006
對外發佈
事件CEC/EEE 2006 Joint Conferences - San Francisco, CA, 美國
持續時間: 26 06 200629 06 2006

出版系列

名字CEC/EEE 2006 Joint Conferences
2006

Conference

ConferenceCEC/EEE 2006 Joint Conferences
國家/地區美國
城市San Francisco, CA
期間26/06/0629/06/06

指紋

深入研究「Solutions to a complete web service discovery and composition」主題。共同形成了獨特的指紋。

引用此